About the Project

computation

AdvancedHelp

(0.001 seconds)

21—30 of 193 matching pages

21: Marjorie A. McClain
… …  1956 in Ithaca, New York) is a mathematician in the Applied and Computational Mathematics Division of NIST where she has provided support for mathematical software libraries and assisted with numerical computing projects since 1979. …
22: B. L. J. Braaksma
… …  1934 in Groningen, The Netherlands) is Emeritus Professor in the Institute for Mathematics and Computer Science at the University of Groningen, The Netherlands. …
23: 10.74 Methods of Computation
§10.74 Methods of Computation
§10.74(vi) Zeros and Associated Values
Hankel Transform
24: 28.34 Methods of Computation
§28.34 Methods of Computation
§28.34(i) Characteristic Exponents
§28.34(ii) Eigenvalues
§28.34(iii) Floquet Solutions
§28.34(iv) Modified Mathieu Functions
25: Annie A. M. Cuyt
… …  1956 in Elisabethstad, Belgian Congo) is a full professor at the Department of Mathematics and Computer Science of the University of Antwerp. …Her main research interest is in the area of numerical approximation theory and its applications to a diversity of problems in scientific computing. As a consequence her expertise spans a wide range of activities from pure abstract mathematics to computer arithmetic and different engineering applications. …
26: Barry I. Schneider
… …  1940 in Brooklyn, New York) is a staff member of the NIST Applied and Computational Mathematics Division. … Schneider’s current research interests span a broad number of areas of theoretical chemistry, atomic and molecular physics, numerical methods and high performance computing. …He is an Editor in Chief for Computers in Science and Engineering and a Specialist Editor for Computer Physics Communications. Recently he has served as Co-Chair of the US government Fast Track Action Committee to update the US strategic computing plan.
27: 21.10 Methods of Computation
§21.10 Methods of Computation
§21.10(ii) Riemann Theta Functions Associated with a Riemann Surface
In addition to evaluating the Fourier series, the main problem here is to compute a Riemann matrix originating from a Riemann surface. …
28: 27.20 Methods of Computation: Other Number-Theoretic Functions
§27.20 Methods of Computation: Other Number-Theoretic Functions
To compute a particular value p ( n ) it is better to use the Hardy–Ramanujan–Rademacher series (27.14.9). …
29: Daniel W. Lozier
… …  1941 in Portland, Oregon) was the Group Leader of the Mathematical Software Group in the Applied and Computational Mathematics Division of NIST until his retirement in 2013. … His research interests have centered on numerical analysis, special functions, computer arithmetic, and mathematical software construction and testing. … He has served as an associate editor of Mathematics of Computation and of the NIST Journal of Research. …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.
30: 24.19 Methods of Computation
§24.19 Methods of Computation
§24.19(i) Bernoulli and Euler Numbers and Polynomials
Equations (24.5.3) and (24.5.4) enable B n and E n to be computed by recurrence. … For algorithms for computing B n , E n , B n ( x ) , and E n ( x ) see Spanier and Oldham (1987, pp. 37, 41, 171, and 179–180). …
  • A method related to “Stickelberger codes” is applied in Buhler et al. (2001); in particular, it allows for an efficient search for the irregular pairs ( 2 n , p ) . Discrete Fourier transforms are used in the computations. See also Crandall (1996, pp. 120–124).