About the Project

numerically%20satisfactory%20solutions

AdvancedHelp

(0.001 seconds)

21—30 of 368 matching pages

21: Bibliography B
  • G. Backenstoss (1970) Pionic atoms. Annual Review of Nuclear and Particle Science 20, pp. 467–508.
  • W. Bartky (1938) Numerical calculation of a generalized complete elliptic integral. Rev. Mod. Phys. 10, pp. 264–269.
  • K. L. Bell and N. S. Scott (1980) Coulomb functions (negative energies). Comput. Phys. Comm. 20 (3), pp. 447–458.
  • W. G. Bickley (1935) Some solutions of the problem of forced convection. Philos. Mag. Series 7 20, pp. 322–343.
  • Å. Björck (1996) Numerical Methods for Least Squares Problems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • 22: Bibliography F
  • FDLIBM (free C library)
  • S. Fempl (1960) Sur certaines sommes des intégral-cosinus. Bull. Soc. Math. Phys. Serbie 12, pp. 13–20 (French).
  • C. H. Franke (1965) Numerical evaluation of the elliptic integral of the third kind. Math. Comp. 19 (91), pp. 494–496.
  • G. Freud (1969) On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.
  • C. Fröberg (1955) Numerical treatment of Coulomb wave functions. Rev. Mod. Phys. 27 (4), pp. 399–411.
  • 23: 2.7 Differential Equations
    §2.7(iv) Numerically Satisfactory Solutions
    This kind of cancellation cannot take place with w 1 ( z ) and w 2 ( z ) , and for this reason, and following Miller (1950), we call w 1 ( z ) and w 2 ( z ) a numerically satisfactory pair of solutions. … This is characteristic of numerically satisfactory pairs. …In consequence, if a differential equation has more than one singularity in the extended plane, then usually more than two standard solutions need to be chosen in order to have numerically satisfactory representations everywhere. In oscillatory intervals, and again following Miller (1950), we call a pair of solutions numerically satisfactory if asymptotically they have the same amplitude and are 1 2 π out of phase.
    24: Bibliography K
  • A. V. Kashevarov (1998) The second Painlevé equation in electric probe theory. Some numerical solutions. Zh. Vychisl. Mat. Mat. Fiz. 38 (6), pp. 992–1000 (Russian).
  • A. V. Kashevarov (2004) The second Painlevé equation in the electrostatic probe theory: Numerical solutions for the partial absorption of charged particles by the surface. Technical Physics 49 (1), pp. 1–7.
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • 25: 16.25 Methods of Computation
    There is, however, an added feature in the numerical solution of differential equations and difference equations (recurrence relations). This occurs when the wanted solution is intermediate in asymptotic growth compared with other solutions. …
    26: Bibliography
  • M. J. Ablowitz and H. Segur (1977) Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.
  • A. Adelberg (1992) On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.
  • G. Allasia and R. Besenghi (1987b) Numerical calculation of incomplete gamma functions by the trapezoidal rule. Numer. Math. 50 (4), pp. 419–428.
  • D. E. Amos (1989) Repeated integrals and derivatives of K Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.
  • U. M. Ascher, R. M. M. Mattheij, and R. D. Russell (1995) Numerical Solution of Boundary Value Problems for Ordinary Differential Equations. Classics in Applied Mathematics, Vol. 13, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • 27: Bibliography L
  • P. W. Lawrence, R. M. Corless, and D. J. Jeffrey (2012) Algorithm 917: complex double-precision evaluation of the Wright ω function. ACM Trans. Math. Software 38 (3), pp. Art. 20, 17.
  • W. Lay, K. Bay, and S. Yu. Slavyanov (1998) Asymptotic and numeric study of eigenvalues of the double confluent Heun equation. J. Phys. A 31 (42), pp. 8521–8531.
  • D. J. Leeming (1977) An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.
  • J. L. López and N. M. Temme (2010a) Asymptotics and numerics of polynomials used in Tricomi and Buchholz expansions of Kummer functions. Numer. Math. 116 (2), pp. 269–289.
  • D. W. Lozier (1980) Numerical Solution of Linear Difference Equations. NBSIR Technical Report 80-1976, National Bureau of Standards, Gaithersburg, MD 20899.
  • 28: 36.5 Stokes Sets
    36.5.4 80 x 5 40 x 4 55 x 3 + 5 x 2 + 20 x 1 = 0 ,
    36.5.7 X = 9 20 + 20 u 4 Y 2 20 u 2 + 6 u 2 sign ( z ) ,
    For z < 0 , there are two solutions u , provided that | Y | > ( 2 5 ) 1 / 2 . … The first sheet corresponds to x < 0 and is generated as a solution of Equations (36.5.6)–(36.5.9). …For | Y | > Y 1 the second sheet is generated by a second solution of (36.5.6)–(36.5.9), and for | Y | < Y 1 it is generated by the roots of the polynomial equation …
    29: Bibliography C
  • B. C. Carlson (1995) Numerical computation of real or complex elliptic integrals. Numer. Algorithms 10 (1-2), pp. 13–26.
  • R. Chelluri, L. B. Richmond, and N. M. Temme (2000) Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.
  • W. W. Clendenin (1966) A method for numerical calculation of Fourier integrals. Numer. Math. 8 (5), pp. 422–436.
  • C. W. Clenshaw and A. R. Curtis (1960) A method for numerical integration on an automatic copmputer. Numer. Math. 2 (4), pp. 197–205.
  • C. W. Clenshaw (1957) The numerical solution of linear differential equations in Chebyshev series. Proc. Cambridge Philos. Soc. 53 (1), pp. 134–149.
  • 30: 18.40 Methods of Computation
    Usually, however, other methods are more efficient, especially the numerical solution of difference equations (§3.6) and the application of uniform asymptotic expansions (when available) for OP’s of large degree. …
    A numerical approach to the recursion coefficients and quadrature abscissas and weights
    There are many ways to implement these first two steps, noting that the expressions for α n and β n of equation (18.2.30) are of little practical numerical value, see Gautschi (2004) and Golub and Meurant (2010). …See Gautschi (1983) for examples of numerically stable and unstable use of the above recursion relations, and how one can then usefully differentiate between numerical results of low and high precision, as produced thereby. … Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . …