About the Project

recursion relations

AdvancedHelp

(0.001 seconds)

11—20 of 23 matching pages

11: 18.39 Applications in the Physical Sciences
Table 18.39.1 lists typical non-classical weight functions, many related to the non-classical Freud weights of §18.32, and §32.15, all of which require numerical computation of the recursion coefficients (i. … with matrix eigenvalues ϵ = ϵ i N , i = 1 , 2 , , N , and the eigenvectors, 𝐜 ( ϵ ) = ( c 0 ( ϵ ) , c 1 ( ϵ ) , , c N 1 ( ϵ ) ) , are determined by the recursion relation (18.39.46) below. …
12: 8.25 Methods of Computation
§8.25(v) Recurrence Relations
An efficient procedure, based partly on the recurrence relations (8.8.5) and (8.8.6), is described in Gautschi (1979b, 1999). Stable recursive schemes for the computation of E p ( x ) are described in Miller (1960) for x > 0 and integer p . …
13: 3.6 Linear Difference Equations
A “trial solution” is then computed by backward recursion, in the course of which the original components of the unwanted solution g n die away. … Then computation of w n by forward recursion is unstable. … Then w n is generated by backward recursion from …
Example 1. Bessel Functions
14: Bibliography G
  • W. Gautschi (1961) Recursive computation of the repeated integrals of the error function. Math. Comp. 15 (75), pp. 227–232.
  • W. Gautschi (1967) Computational aspects of three-term recurrence relations. SIAM Rev. 9 (1), pp. 24–82.
  • W. Gautschi (1999) A note on the recursive calculation of incomplete gamma functions. ACM Trans. Math. Software 25 (1), pp. 101–107.
  • A. Gil, J. Segura, and N. M. Temme (2006c) The ABC of hyper recursions. J. Comput. Appl. Math. 190 (1-2), pp. 270–286.
  • A. Gil, J. Segura, and N. M. Temme (2007b) Numerically satisfactory solutions of hypergeometric recursions. Math. Comp. 76 (259), pp. 1449–1468.
  • 15: 18.2 General Orthogonal Polynomials
    §18.2(iii) Standardization and Related Constants
    §18.2(iv) Recurrence Relations
    The monic and orthonormal OP’s, and their determination via recursion, are more fully discussed in §§3.5(v) and 3.5(vi), where modified recursion coefficients are listed for the classical OP’s in their monic and orthonormal forms. … are OP’s with orthogonality relationAlternatives for numerical calculation of the recursion coefficients in terms of the moments are discussed in these references, and in §18.40(ii). …
    16: 29.6 Fourier Series
    In addition, if H satisfies (29.6.2), then (29.6.3) applies. … This solution can be constructed from (29.6.4) by backward recursion, starting with A 2 n + 2 = 0 and an arbitrary nonzero value of A 2 n , followed by normalization via (29.6.5) and (29.6.6). Consequently, 𝐸𝑐 ν 2 m ( z , k 2 ) reduces to a Lamé polynomial; compare §§29.12(i) and 29.15(i). …
    17: Bibliography W
  • J. A. Wilson (1978) Hypergeometric Series, Recurrence Relations and Some New Orthogonal Polynomials. Ph.D. Thesis, University of Wisconsin, Madison, WI.
  • J. Wimp (1968) Recursion formulae for hypergeometric functions. Math. Comp. 22 (102), pp. 363–373.
  • J. Wimp (1984) Computation with Recurrence Relations. Pitman, Boston, MA.
  • M. E. Wojcicki (1961) Algorithm 44: Bessel functions computed recursively. Comm. ACM 4 (4), pp. 177–178.
  • P. Wynn (1966) Upon systems of recursions which obtain among the quotients of the Padé table. Numer. Math. 8 (3), pp. 264–269.
  • 18: 7.17 Inverse Error Functions
    where a 0 = 1 and the other coefficients follow from the recursion
    19: 3.2 Linear Algebra
    Define the Lanczos vectors 𝐯 j and coefficients α j and β j by 𝐯 0 = 𝟎 , a normalized vector 𝐯 1 (perhaps chosen randomly), α 1 = 𝐯 1 T 𝐀 𝐯 1 , β 1 = 0 , and for j = 1 , 2 , , n 1 by the recursive scheme …Its characteristic polynomial can be obtained from the recursionLanczos’ method is related to Gauss quadrature considered in §3.5(v). When the matrix 𝐀 is replaced by a scalar x , the recurrence relation in the first line of (3.2.21) with 𝐮 = β j + 1 𝐯 j + 1 is similar to the one in (3.5.30_5). Also, the recurrence relations in (3.2.23) and (3.5.30) are similar, as well as the matrix 𝐁 in (3.2.22) and the Jacobi matrix 𝐉 n in (3.5.31). …
    20: Bibliography S
  • D. Schmidt and G. Wolf (1979) A method of generating integral relations by the simultaneous separability of generalized Schrödinger equations. SIAM J. Math. Anal. 10 (4), pp. 823–838.
  • J. L. Schonfelder (1978) Chebyshev expansions for the error and related functions. Math. Comp. 32 (144), pp. 1232–1240.
  • K. Schulten and R. G. Gordon (1976) Recursive evaluation of 3 j - and 6 j - coefficients. Comput. Phys. Comm. 11 (2), pp. 269–278.
  • K. Schulten and R. G. Gordon (1975a) Exact recursive evaluation of 3 j - and 6 j -coefficients for quantum-mechanical coupling of angular momenta. J. Mathematical Phys. 16 (10), pp. 1961–1970.
  • J. Segura (2001) Bounds on differences of adjacent zeros of Bessel functions and iterative relations between consecutive zeros. Math. Comp. 70 (235), pp. 1205–1220.