About the Project

plane%20polar%20coordinates

AdvancedHelp

(0.001 seconds)

21—30 of 242 matching pages

21: 36 Integrals with Coalescing Saddles
22: Gergő Nemes
As of September 20, 2021, Nemes performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 25 Zeta and Related Functions. …
23: Wolter Groenevelt
As of September 20, 2022, Groenevelt performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 18 Orthogonal Polynomials. …
24: 33.24 Tables
  • Abramowitz and Stegun (1964, Chapter 14) tabulates F 0 ( η , ρ ) , G 0 ( η , ρ ) , F 0 ( η , ρ ) , and G 0 ( η , ρ ) for η = 0.5 ( .5 ) 20 and ρ = 1 ( 1 ) 20 , 5S; C 0 ( η ) for η = 0 ( .05 ) 3 , 6S.

  • 25: 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.
  • Y. Ameur and J. Cronvall (2023) Szegő Type Asymptotics for the Reproducing Kernel in Spaces of Full-Plane Weighted Polynomials. Comm. Math. Phys. 398 (3), pp. 1291–1348.
  • D. E. Amos (1989) Repeated integrals and derivatives of K Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.
  • G. E. Andrews (1979) Plane partitions. III. The weak Macdonald conjecture. Invent. Math. 53 (3), pp. 193–225.
  • 26: Bibliography G
  • I. Gargantini and P. Henrici (1967) A continued fraction algorithm for the computation of higher transcendental functions in the complex plane. Math. Comp. 21 (97), pp. 18–29.
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • P. Gianni, M. Seppälä, R. Silhol, and B. Trager (1998) Riemann surfaces, plane algebraic curves and their period matrices. J. Symbolic Comput. 26 (6), pp. 789–803.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • 27: Bibliography M
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • R. Metzler, J. Klafter, and J. Jortner (1999) Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems. Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
  • D. S. Moak (1981) The q -analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.
  • L. Mutafchiev and E. Kamenov (2006) Asymptotic formula for the number of plane partitions of positive integers. C. R. Acad. Bulgare Sci. 59 (4), pp. 361–366.
  • 28: Bibliography B
  • G. Backenstoss (1970) Pionic atoms. Annual Review of Nuclear and Particle Science 20, pp. 467–508.
  • A. Bañuelos and R. A. Depine (1980) A program for computing the Riemann zeta function for complex argument. Comput. Phys. Comm. 20 (3), pp. 441–445.
  • 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.
  • E. Brieskorn and H. Knörrer (1986) Plane Algebraic Curves. Birkhäuser Verlag, Basel.
  • 29: 5.21 Methods of Computation
    An effective way of computing Γ ( z ) in the right half-plane is backward recurrence, beginning with a value generated from the asymptotic expansion (5.11.3). …For the left half-plane we can continue the backward recurrence or make use of the reflection formula (5.5.3). …
    30: 27.15 Chinese Remainder Theorem
    Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …