About the Project

initial-value problems

AdvancedHelp

(0.002 seconds)

6 matching pages

1: 28.33 Physical Applications
  • Initial-value problems, in which only one equation (28.2.1) or (28.20.1) is involved. See §28.33(iii).

  • §28.33(iii) Stability and Initial-Value Problems
    References for other initial-value problems include: …
    2: 3.7 Ordinary Differential Equations
    §3.7(ii) Taylor-Series Method: Initial-Value Problems
    It will be observed that the present formulation of the Taylor-series method permits considerable parallelism in the computation, both for initial-value and boundary-value problems. …
    3: Bibliography T
  • J. G. Taylor (1978) Error bounds for the Liouville-Green approximation to initial-value problems. Z. Angew. Math. Mech. 58 (12), pp. 529–537.
  • 4: 28.34 Methods of Computation
  • (a)

    Direct numerical integration of the differential equation (28.2.1), with initial values given by (28.2.5) (§§3.7(ii), 3.7(v)).

  • §28.34(ii) Eigenvalues
  • (d)

    Solution of the matrix eigenvalue problem for each of the five infinite matrices that correspond to the linear algebraic equations (28.4.5)–(28.4.8) and (28.14.4). See Zhang and Jin (1996, pp. 479–482) and §3.2(iv).

  • (c)

    Solution of (28.2.1) by boundary-value methods; see §3.7(iii). This can be combined with §28.34(ii)(c).

  • (b)

    Direct numerical integration (§3.7) of the differential equation (28.20.1) for moderate values of the parameters.

  • 5: 6.18 Methods of Computation
    For small or moderate values of x and | z | , the expansion in power series (§6.6) or in series of spherical Bessel functions (§6.10(ii)) can be used. …However, this problem is less severe for the series of spherical Bessel functions because of their more rapid rate of convergence, and also (except in the case of (6.10.6)) absence of cancellation when z = x ( > 0 ). … A 0 , B 0 , and C 0 can be computed by Miller’s algorithm (§3.6(iii)), starting with initial values ( A N , B N , C N ) = ( 1 , 0 , 0 ) , say, where N is an arbitrary large integer, and normalizing via C 0 = 1 / z . … Zeros of Ci ( x ) and si ( x ) can be computed to high precision by Newton’s rule (§3.8(ii)), using values supplied by the asymptotic expansion (6.13.2) as initial approximations. …
    6: 3.6 Linear Difference Equations
    In practice, however, problems of severe instability often arise and in §§3.6(ii)3.6(vii) we show how these difficulties may be overcome. … We first compute, by forward recurrence, the solution p n of the homogeneous equation (3.6.3) with initial values p 0 = 0 , p 1 = 1 . … The least value of N that satisfies (3.6.9) is found to be 16. … For a difference equation of order k ( 3 ), …