About the Project

Monte-Carlo methods

AdvancedHelp

(0.001 seconds)

31—40 of 151 matching pages

31: Alexander A. Its
32: Vadim B. Kuznetsov
Kuznetsov published papers on special functions and orthogonal polynomials, the quantum scattering method, integrable discrete many-body systems, separation of variables, Bäcklund transformation techniques, and integrability in classical and quantum mechanics. …
33: 21.10 Methods of Computation
§21.10 Methods of Computation
34: 27.20 Methods of Computation: Other Number-Theoretic Functions
§27.20 Methods of Computation: Other Number-Theoretic Functions
35: 27.22 Software
  • Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below 10 16 . Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard p 1 , and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.

    For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).

  • ECMNET Project. Links to software for elliptic curve methods of factorization and primality testing.

  • 36: Daniel W. Lozier
    Then he transferred to NIST (then known as the National Bureau of Standards), where he collaborated for several years with the Building and Fire Research Laboratory developing and applying finite-difference and spectral methods to differential equation models of fire growth. … In 2008 he was named an Honorary Fellow of the European Society of Computational Methods in Sciences and Engineering, and in 2017 was named a Fellow of the Washington Academy of Sciences.
    37: 3.7 Ordinary Differential Equations
    §3.7(ii) Taylor-Series Method: Initial-Value Problems
    §3.7(iii) Taylor-Series Method: Boundary-Value Problems
    General methods for boundary-value problems for ordinary differential equations are given in Ascher et al. (1995). … For further information, including other methods and examples, see Pryce (1993, §2.5.1).
    §3.7(v) Runge–Kutta Method
    38: Bibliography I
  • L. Infeld and T. E. Hull (1951) The factorization method. Rev. Modern Phys. 23 (1), pp. 21–68.
  • M. E. H. Ismail and E. Koelink (2011) The J -matrix method. Adv. in Appl. Math. 46 (1-4), pp. 379–395.
  • 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 V. Yu. Novokshënov (1986) The Isomonodromic Deformation Method in the Theory of Painlevé Equations. Lecture Notes in Mathematics, Vol. 1191, Springer-Verlag, Berlin.
  • C. Itzykson and J. Drouffe (1989) Statistical Field Theory: Strong Coupling, Monte Carlo Methods, Conformal Field Theory, and Random Systems. Vol. 2, Cambridge University Press, Cambridge.
  • 39: 1.15 Summability Methods
    §1.15 Summability Methods
    Abel Summability
    Cesàro Summability
    §1.15(ii) Regularity
    40: 36.15 Methods of Computation
    §36.15 Methods of Computation