About the Project

solutions via quadratures

AdvancedHelp

(0.001 seconds)

1—10 of 11 matching pages

1: 31.8 Solutions via Quadratures
§31.8 Solutions via Quadratures
2: 18.38 Mathematical Applications
Quadrature “Extended” to Pseudo-Spectral (DVR) Representations of Operators in One and Many Dimensions
3: 11.13 Methods of Computation
§11.13(iii) Quadrature
Subsequently 𝐇 ν ( z ) and 𝐋 ν ( z ) are obtainable via (11.2.5) and (11.2.6). … To insure stability the integration path must be chosen so that as we proceed along it the wanted solution grows in magnitude at least as rapidly as the complementary solutions. … The solution 𝐊 ν ( x ) needs to be integrated backwards for small x , and either forwards or backwards for large x depending whether or not ν exceeds 1 2 . …
4: 15.19 Methods of Computation
As noted in §3.7(ii), the integration path should be chosen so that the wanted solution grows in magnitude at least as fast as all other solutions. … Gauss quadrature approximations are discussed in Gautschi (2002b). … Initial values for moderate values of | a | and | b | can be obtained by the methods of §15.19(i), and for large values of | a | , | b | , or | c | via the asymptotic expansions of §§15.12(ii) and 15.12(iii). …
5: 9.17 Methods of Computation
For details, including the application of a generalized form of Gaussian quadrature, see Gordon (1969, Appendix A) and Schulten et al. (1979). … The second method is to apply generalized Gauss–Laguerre quadrature3.5(v)) to the integral (9.5.8). … For quadrature methods for Scorer functions see Gil et al. (2001), Lee (1980), and Gordon (1970, Appendix A); but see also Gautschi (1983).
§9.17(iv) Via Bessel Functions
Zeros of the Airy functions, and their derivatives, can be computed to high precision via Newton’s rule (§3.8(ii)) or Halley’s rule (§3.8(v)), using values supplied by the asymptotic expansions of §9.9(iv) as initial approximations. …
6: 3.11 Approximation Techniques
There exists a unique solution of this minimax problem and there are at least k + + 2 values x j , a x 0 < x 1 < < x k + + 1 b , such that m j = m , where … With b 0 = 1 , the last q equations give b 1 , , b q as the solution of a system of linear equations. … For convergence results for Padé approximants, and the connection with continued fractions and Gaussian quadrature, see Baker and Graves-Morris (1996, §4.7). … Starting with the first column [ n / 0 ] f , n = 0 , 1 , 2 , , and initializing the preceding column by [ n / 1 ] f = , n = 1 , 2 , , we can compute the lower triangular part of the table via (3.11.25). … If the functions ϕ k ( x ) are linearly independent on the set x 1 , x 2 , , x J , that is, the only solution of the system of equations …
7: 18.40 Methods of Computation
A numerical approach to the recursion coefficients and quadrature abscissas and weights
These quadrature weights and abscissas will then allow construction of a convergent sequence of approximations to w ( x ) , as will be considered in the following paragraphs. … The quadrature abscissas x n and weights w n then follow from the discussion of §3.5(vi). …
Stieltjes Inversion via (approximate) Analytic Continuation
The quadrature points and weights can be put to a more direct and efficient use. …
8: Bibliography H
  • B. A. Hargrave (1978) High frequency solutions of the delta wing equations. Proc. Roy. Soc. Edinburgh Sect. A 81 (3-4), pp. 299–316.
  • F. E. Harris (2002) Analytic evaluation of two-center STO electron repulsion integrals via ellipsoidal expansion. Internat. J. Quantum Chem. 88 (6), pp. 701–734.
  • E. J. Heller, W. P. Reinhardt, and H. A. Yamani (1973) On an “equivalent quadrature” calculation of matrix elements of ( z p 2 / 2 m ) 1 using an L 2 expansion technique. J. Comput. Phys. 13, pp. 536–550.
  • F. T. Howard (1996b) Sums of powers of integers via generating functions. Fibonacci Quart. 34 (3), pp. 244–256.
  • I. Huang and S. Huang (1999) Bernoulli numbers and polynomials via residues. J. Number Theory 76 (2), pp. 178–193.
  • 9: 18.36 Miscellaneous Polynomials
    Orthogonality of the the classical OP’s with respect to a positive weight function, as in Table 18.3.1 requires, via Favard’s theorem, A n A n 1 C n > 0 for n 1 as per (18.2.9_5). … These results are proven in Everitt et al. (2004), via construction of a self-adjoint Sturm–Liouville operator which generates the L n ( k ) ( x ) polynomials, self-adjointness implying both orthogonality and completeness. … EOP’s are non-classical in that not only are certain polynomial orders missing, but, also, not all EOP polynomial zeros are within the integration range of their generating measure, and EOP-orthogonality properties do not allow development of Gaussian-type quadratures. … initialized via : … The restriction to n 1 is now apparent: (18.36.7) does not posses a solution if y ( x ) is a constant. …
    10: Bibliography I
  • A. Iserles, S. P. Nørsett, and S. Olver (2006) Highly Oscillatory Quadrature: The Story So Far. In Numerical Mathematics and Advanced Applications, A. Bermudez de Castro and others (Eds.), pp. 97–118.
  • A. R. Its, A. S. Fokas, and A. A. Kapaev (1994) On the asymptotic analysis of the Painlevé equations via the isomonodromy method. Nonlinearity 7 (5), pp. 1291–1325.
  • A. R. Its and A. A. Kapaev (1998) Connection formulae for the fourth Painlevé transcendent; Clarkson-McLeod solution. J. Phys. A 31 (17), pp. 4073–4113.