About the Project

computation of coefficients

AdvancedHelp

(0.002 seconds)

11—20 of 56 matching pages

11: Bibliography B
  • A. Bar-Shalom and M. Klapisch (1988) NJGRAF: An efficient program for calculation of general recoupling coefficients by graphical analysis, compatible with NJSYM. Comput. Phys. Comm. 50 (3), pp. 375–393.
  • W. G. C. Boyd (1990a) Asymptotic Expansions for the Coefficient Functions Associated with Linear Second-order Differential Equations: The Simple Pole Case. In Asymptotic and Computational Analysis (Winnipeg, MB, 1989), R. Wong (Ed.), Lecture Notes in Pure and Applied Mathematics, Vol. 124, pp. 53–73.
  • P. G. Burke (1970) A program to calculate a general recoupling coefficient. Comput. Phys. Comm. 1 (4), pp. 241–250.
  • 12: Bibliography Z
  • H. S. Zuckerman (1939) The computation of the smaller coefficients of J ( τ ) . Bull. Amer. Math. Soc. 45 (12), pp. 917–919.
  • 13: 18.40 Methods of Computation
    A simple set of choices is spelled out in Gordon (1968) which gives a numerically stable algorithm for direct computation of the recursion coefficients in terms of the moments, followed by construction of the J-matrix and quadrature weights and abscissas, and we will follow this approach: Let N be a positive integer and define …
    14: 18.39 Applications in the Physical Sciences
    The discrete variable representations (DVR) analysis is simplest when based on the classical OP’s with their analytically known recursion coefficients (Table 3.5.17_5), or those non-classical OP’s which have analytically known recursion coefficients, making stable computation of the x i and w i , from the J-matrix as in §3.5(vi), straightforward. …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. …
    15: Bibliography D
  • R. McD. Dodds and G. Wiechers (1972) Vector coupling coefficients as products of prime factors. Comput. Phys. Comm. 4 (2), pp. 268–274.
  • O. Dragoun and G. Heuser (1971) A program to calculate internal conversion coefficients for all atomic shells without screening. Comput. Phys. Comm. 2 (7), pp. 427–432.
  • 16: 11.6 Asymptotic Expansions
    These and higher coefficients c k ( λ ) can be computed via the representations in Nemes (2015b). …
    17: 31.18 Methods of Computation
    §31.18 Methods of Computation
    Independent solutions of (31.2.1) can be computed in the neighborhoods of singularities from their Fuchs–Frobenius expansions (§31.3), and elsewhere by numerical integration of (31.2.1). Subsequently, the coefficients in the necessary connection formulas can be calculated numerically by matching the values of solutions and their derivatives at suitably chosen values of z ; see Laĭ (1994) and Lay et al. (1998). …The computation of the accessory parameter for the Heun functions is carried out via the continued-fraction equations (31.4.2) and (31.11.13) in the same way as for the Mathieu, Lamé, and spheroidal wave functions in Chapters 2830.
    18: 9.19 Approximations
  • Corless et al. (1992) describe a method of approximation based on subdividing into a triangular mesh, with values of Ai ( z ) , Ai ( z ) stored at the nodes. Ai ( z ) and Ai ( z ) are then computed from Taylor-series expansions centered at one of the nearest nodes. The Taylor coefficients are generated by recursion, starting from the stored values of Ai ( z ) , Ai ( z ) at the node. Similarly for Bi ( z ) , Bi ( z ) .

  • 19: Bibliography M
  • A. P. Magnus (1995) Painlevé-type differential equations for the recurrence coefficients of semi-classical orthogonal polynomials. J. Comput. Appl. Math. 57 (1-2), pp. 215–237.
  • 20: Bibliography
  • H. Appel (1968) Numerical Tables for Angular Correlation Computations in α -, β - and γ -Spectroscopy: 3 j -, 6 j -, 9 j -Symbols, F- and Γ -Coefficients. Landolt-Börnstein Numerical Data and Functional Relationships in Science and Technology, Springer-Verlag.