The Mathematical-Function Computation Handbook

[1]  Pierre L'Ecuyer,et al.  A search for good multiple recursive random number generators , 1993, TOMC.

[2]  Merrell L. Patrick,et al.  Polynomial evaluation with scaling , 1990, TOMS.

[3]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[4]  Albert Werbrouck,et al.  Efficient Algorithms for Integer Division by Constants Using Multiplication , 2008, Comput. J..

[5]  Amos R. Omondi,et al.  Computer arithmetic systems - algorithms, architecture and implementation , 1994, Prentice Hall International series in computer science.

[6]  S. Oishi,et al.  ACCURATE FLOATING-POINT SUMMATION , 2005 .

[7]  Claude Brezinski,et al.  History of continued fractions and Pade approximants , 1990, Springer series in computational mathematics.

[8]  Eric M. Schwarz,et al.  Decimal floating-point support on the IBM System z10 processor , 2009, IBM J. Res. Dev..

[9]  Eric Grunwald The equation that couldn’t be solved: How mathematical genius discovered the language of symmetry , 2006 .

[10]  K. C. Ng,et al.  ARGUMENT REDUCTION FORHUGE ARGUMENTS: Good to the Last Bit , 2006 .

[11]  Paulo Ribenboim,et al.  The little book of big primes , 1991 .

[12]  Michael L. Overton,et al.  Numerical Computing with IEEE Floating Point Arithmetic , 2001 .

[13]  D. E. Bodenstab,et al.  UNIX Operating System Porting Experiences * , 1984 .

[14]  C. A. R. Hoare,et al.  The emperor's old clothes , 1981, CACM.

[15]  James E. Smith,et al.  Virtual machines - versatile platforms for systems and processes , 2005 .

[16]  Yvonne Neudorf Cryptographic Security Architecture Design And Verification , 2016 .

[17]  Milos D. Ercegovac,et al.  A Radix-16 Combined Complex Division/Square Root Unit with Operand Prescaling , 2012, IEEE Transactions on Computers.

[18]  William M. Waite,et al.  Software manual for the elementary functions , 1980 .

[19]  William B. Jones,et al.  Numerical stability in evaluating continued fractions , 1974 .

[20]  Wayne B. Hayes,et al.  Algorithm 908 , 2010 .

[21]  Jonathan M. Borwein,et al.  A very rapidly convergent product expansion for π , 1983 .

[22]  Christopher A. Krygowski,et al.  The S/390 G5 floating-point unit , 1999, IBM J. Res. Dev..

[23]  F. Cajori A history of mathematics , 1989 .

[24]  A. Uhl,et al.  Optimization of random number generators: efficient search for high-quality LCGs , 2001 .

[25]  E. Jahnke,et al.  Tafeln höherer Funktionen = Tables of higher functions , 1960 .

[26]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[27]  T. Fukushima Fast computation of Jacobian elliptic functions and incomplete elliptic integrals for constant values of elliptic parameter and elliptic characteristic , 2009 .

[28]  David W. Matula,et al.  In-and-out conversions , 1968, CACM.

[29]  C. Edwards,et al.  Rational Chebyshev approximations for the inverse of the error function , 1976 .

[30]  Sylvie Boldo,et al.  Representable correcting terms for possibly underflowing floating point operations , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[31]  John Marsaglia,et al.  Rapid evaluation of the inverse of the normal distribution function , 1994 .

[32]  Richard M. Russell,et al.  The CRAY-1 computer system , 1978, CACM.

[33]  B. C. Carlson Algorithms Involving Arithmetic and Geometric Means , 1971 .

[34]  Roger A. Smith A Continued-Fraction Analysis of Trigonometric Argument Reduction , 1995, IEEE Trans. Computers.

[35]  David M. Smith,et al.  Algorithm 693: a FORTRAN package for floating-point multiple-precision arithmetic , 1991, TOMS.

[36]  Aleksander Jablonski Numerical evaluation of spherical Bessel functions of the first kind , 1994 .

[37]  Constance Reid From Zero to Infinity: What Makes Numbers Interesting , 2006 .

[38]  K. Pearson On the Criterion that a Given System of Deviations from the Probable in the Case of a Correlated System of Variables is Such that it Can be Reasonably Supposed to have Arisen from Random Sampling , 1900 .

[39]  T. J. Rivlin The Chebyshev polynomials , 1974 .

[40]  W. Beyer CRC Standard Mathematical Tables and Formulae , 1991 .

[41]  Jean-Michel Muller,et al.  Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .

[42]  Norm L. Schryer,et al.  A Test of a Computer's Floating-Point Arithmetic Unit , 1981 .

[43]  T. Chihara,et al.  An Introduction to Orthogonal Polynomials , 1979 .

[44]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[45]  Cláudio Saiani Journey through genius: The great theorems of mathematics. , 2013 .

[46]  B A Anicin Comments on a paper by T. L. Dutt on the low-frequency dielectric constant of a plasma , 1966 .

[47]  W. Morven Gentleman,et al.  More on algorithms that reveal properties of floating point arithmetic units , 1974, CACM.

[48]  Guillaume Melquiond,et al.  Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd , 2008, IEEE Transactions on Computers.

[49]  William D. Clinger How to read floating point numbers accurately , 1990, PLDI '90.

[50]  Joseph F. Traub,et al.  Algorithms and Complexity: New Directions and Recent Results , 1976 .

[51]  Walter Gautschi,et al.  Leonhard Euler: His Life, the Man, and His Works , 2008, SIAM Rev..

[52]  F. Olver Asymptotics and Special Functions , 1974 .

[53]  J. Stillwell Mathematics and Its History , 2020, Undergraduate Texts in Mathematics.

[54]  Henri Cohen,et al.  Convergence Acceleration of Alternating Series , 2000, Exp. Math..

[55]  A. R. Barnett,et al.  Coulomb and Bessel functions of complex arguments and order , 1986 .

[56]  William J. Cody,et al.  The use of Taylor series to test accuracy of function programs , 1991, TOMS.

[57]  Raymond Hubbard,et al.  The widespread misinterpretation of p-values as error probabilities , 2011 .

[58]  David Leigh-Lancaster Great Feuds in Mathematics: Ten of the Liveliest Disputes Ever [Book Review] , 2007 .

[59]  Doron S. Lubinsky,et al.  Orthogonal Polynomials for Exponential Weights , 2001 .

[60]  Walter Van Assche,et al.  Asymptotics for Orthogonal Polynomials , 1987 .

[61]  Frederick P. Brooks,et al.  Architecture of the IBM System/360 , 2000, IBM J. Res. Dev..

[62]  Larry C. Andrews,et al.  Special Functions Of Mathematics For Engineers , 2022 .

[63]  H. Wall,et al.  Analytic Theory of Continued Fractions , 2000 .

[64]  T. E. Hull,et al.  Variable precision exponential function , 1986, TOMS.

[65]  Pierre Eymard The number [pi] , 2004 .

[66]  Frederick P. Brooks,et al.  Processing Data in Bits and Pieces , 1959, IRE Trans. Electron. Comput..

[67]  Egon Börger,et al.  Java and the Java Virtual Machine: Definition, Verification, Validation , 2001 .

[68]  Nico M. Temme,et al.  Computing solutions of the modified Bessel differential equation for imaginary orders and positive arguments , 2004, TOMS.

[69]  Tien Chi Chen,et al.  Storage-efficient representation of decimal data , 1975, CACM.

[70]  Avram Sidi,et al.  Practical Extrapolation Methods - Theory and Applications , 2003, Cambridge monographs on applied and computational mathematics.

[71]  H. C. Hamaker,et al.  Approximating the Cumulative Normal Distribution and its Inverse , 1978 .

[72]  Urs Ammann On code generation in a PASCAL compiler , 1976 .

[73]  Jean-Michel Muller,et al.  Worst cases for correct rounding of the elementary functions in double precision , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[74]  W. Gautschi Computational Aspects of Three-Term Recurrence Relations , 1967 .

[75]  Frank Yellin,et al.  The Java Virtual Machine Specification , 1996 .

[76]  Melvin Klerer,et al.  Digital Computer User's Handbook , 1968 .

[77]  Jerome T. Coonen Errata for 'an implementation guide to a proposed standard for floating-point arithmetic , 1981 .

[78]  Annie A. M. Cuyt,et al.  Algorithm 871: A C/C++ precompiler for autogeneration of multiprecision programs , 2008, TOMS.

[79]  Louis Vessot King,et al.  On the Direct Numerical Calculation of Elliptic Functions and Integrals , 2011 .

[80]  Ping Tak Peter Tang Table-driven implementation of the exponential function in IEEE floating-point arithmetic , 1989, TOMS.

[81]  Lothar Afflerbach,et al.  Normal random numbers lying on spirals and clubs , 1988 .

[82]  M. J. Jamison Rapidly converging iterative formulae for finding square roots and their computational efficiencies , 1989 .

[83]  John Harrison,et al.  Scientific Computing on Itanium-Based Systems , 2002 .

[84]  B. C. Carlson,et al.  Algorithm 577: Algorithms for Incomplete Elliptic Integrals [S21] , 1981, TOMS.

[85]  Neil J. A. Sloane,et al.  The encyclopedia of integer sequences , 1995 .

[86]  G. Marsaglia,et al.  Some Difficult-to-pass Tests of Randomness , 2022 .

[87]  Richard P. Brent,et al.  Further analysis of the binary Euclidean algorithm , 2013, ArXiv.

[88]  Donald MacKenzie,et al.  The social limits of speed: development and use of supercomputers , 1994, IEEE Annals of the History of Computing.

[89]  Anthony C. Hearn REDUCE is free software as of January 2009 , 2009, ACCA.

[90]  Richard H. Eckhouse,et al.  Minicomputer Systems: Organization, Programming, and Applications (Pdp-11) , 1975 .

[91]  William J. Cody Algorithm 597: sequence of modified Bessel functions of the first kind , 1983, TOMS.

[92]  Doug Hensley Complex Continued Fractions , 2006 .

[93]  David H. Bailey,et al.  A Fortran 90-based multiprecision system , 1995, TOMS.

[94]  David Defour,et al.  Numerical reproducibility for the parallel reduction on multi- and many-core architectures , 2015, Parallel Comput..

[95]  M. Cowlishaw Densely packed decimal encoding , 2002 .

[96]  Eric R. Ziegel,et al.  Probability and Statistics for Engineering and the Sciences , 2004, Technometrics.

[97]  Diego Dominici NESTED DERIVATIVES: A SIMPLE METHOD FOR COMPUTING SERIES EXPANSIONS OF INVERSE FUNCTIONS , 2003 .

[98]  Arnaud Tisserand,et al.  The Table Maker's Dilemma , 1998 .

[99]  B. C. Carlson,et al.  Symmetric Elliptic Integrals of the Third Kind , 1970 .

[100]  Richard P. Brent,et al.  An AUGMENT Interface for Brent's Multiple Precision Arithmetic Package , 1980, TOMS.

[101]  Michael A. Malcolm,et al.  Algorithms to reveal properties of floating-point arithmetic , 1972, CACM.

[102]  L. Fox,et al.  Chebyshev polynomials in numerical analysis , 1970 .

[103]  William J. Cody Double-precision square root for the CDC-3600 , 1964, CACM.

[104]  Joseph D. Darcy,et al.  How Java’s Floating-Point Hurts Everyone Everywhere , 2004 .

[105]  Dennis Eichmann,et al.  The History Of Mathematics An Introduction , 2016 .

[106]  James V. Rauff,et al.  The Mathematics of Egypt, Mesopotamia, China, India, and Islam: A Sourcebook , 2009 .

[107]  W. Cody Chebyshev Approximations for the Complete Elliptic Integrals K and E , 1965 .

[108]  Annie A. M. Cuyt,et al.  A precision- and range-independent tool for testing floating-point arithmetric I: basic operations, square root, and remainder , 2001, TOMS.

[109]  C. Bays C364. Improving a random number generator: a comparison between two shuffling methods , 1990 .

[110]  Pat H. Sterbenz,et al.  Floating-point computation , 1973 .

[111]  C. W. Clenshaw,et al.  The special functions and their approximations , 1972 .

[112]  William J. Cody,et al.  Performance evaluation of programs for certain Bessel functions , 1989, TOMS.

[113]  Russell C. H. Cheng,et al.  Random Variate Generation , 2007 .

[114]  Richard P. Brent Remark on “Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]” , 1979, TOMS.

[115]  David Defour,et al.  Fast correct rounding of elementary functions in double precision using double-extended arithmetic , 2004 .

[116]  Jean-Michel Muller,et al.  Exact and Approximated Error of the FMA , 2011, IEEE Transactions on Computers.

[117]  Jr Phllip,et al.  The Function Inverfc , 1960 .

[118]  S. Gill,et al.  A process for the step-by-step integration of differential equations in an automatic digital computing machine , 1951, Mathematical Proceedings of the Cambridge Philosophical Society.

[119]  W. J. Cody,et al.  Chebyshev Approximations for the Natural Logarithm of the Gamma Function , 1967 .

[120]  T. Gowers Princeton companion to mathematics , 2008 .

[121]  Jonathan P. Sorenson,et al.  An analysis of Lehmer's Euclidean GCD algorithm , 1995, ISSAC '95.

[122]  Thomas Wieder,et al.  Algorithm 794: numerical Hankel transform by the Fortran program HANKEL , 1999, TOMS.

[123]  S. Moshier,et al.  Computer approximations , 1986 .

[124]  Leonhard Euler,et al.  Leonhardi Euleri Opera omnia , 1911 .

[125]  Jean-Michel Muller,et al.  Some functions computable with a fused-mac , 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

[126]  Brad Abrams .NET Framework Standard Library Annotated Reference, Volume 1: Base Class Library and Extended Numerics Library, 1/e , 2004 .

[127]  J. Borwein,et al.  The quest for PI , 1997 .

[128]  Pei-Chi Wu,et al.  Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1 , 1997, TOMS.

[129]  Jonathan M. Borwein,et al.  The Computer as Crucible: An Introduction to Experimental Mathematics , 2008 .

[130]  Jerome T. Coonen Underflow and the Denormalized Numbers , 1981, Computer.

[131]  Kirk L. Kroeker Celebrating the legacy of PLATO , 2010, Commun. ACM.

[132]  Larry C. Andrews,et al.  Bessel Functions of the First Kind , 2011 .

[133]  Eric W. Weisstein,et al.  CRC encyclopedia of mathematics , 2009 .

[134]  Toshio Fukushima,et al.  Fast computation of incomplete elliptic integral of first kind by half argument transformation , 2010, Numerische Mathematik.

[135]  Walter Gautschi,et al.  A Computational Procedure for Incomplete Gamma Functions , 1979, TOMS.

[136]  James Demmel,et al.  Fast and Accurate Floating Point Summation with Application to Computational Geometry , 2004, Numerical Algorithms.

[137]  Toshio Fukushima,et al.  Numerical computation of incomplete elliptic integrals of a general form , 1994 .

[138]  A. D. Hall,et al.  The PORT Mathematical Subroutine Library , 1978, TOMS.

[139]  Donald E. Knuth,et al.  Deciphering a linear congruential encryption , 1985, IEEE Trans. Inf. Theory.

[140]  Jean-Michel Muller,et al.  Error bounds on complex floating-point multiplication with an FMA , 2017, Math. Comput..

[141]  Nico M. Temme,et al.  Evaluation of the modified Bessel function of the third kind of imaginary orders , 2002 .

[142]  A. Grossmann,et al.  Iterative method for calculation of the Weierstrass elliptic function , 1990 .

[143]  Nico M. Temme,et al.  Numerical methods for special functions , 2007 .

[144]  Jon Louis Bentley,et al.  Generating Sorted Lists of Random Numbers , 1980, TOMS.

[145]  Karl Entacher,et al.  Bad subsequences of well-known linear congruential pseudorandom number generators , 1998, TOMC.

[146]  John Lions,et al.  Lions' Commentary on UNIX 6th Edition, with Source Code , 1976, Computer classics revisited.

[147]  Sylvie Boldo,et al.  A Simple Test Qualifying the Accuracy of Horner'S Rule for Polynomials , 2004, Numerical Algorithms.

[148]  Chiang Kao,et al.  An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215 , 1996 .

[149]  I. D. Hill,et al.  Applied Statistics Algorithms. , 1985 .

[150]  I. Krasikov Approximations for the Bessel and Airy functions with an explicit error term , 2014 .

[151]  H. Zeisel,et al.  A Remark on Algorithm as 183. An Efficient and Portable Pseudo‐Random Number Generator , 1986 .

[152]  W. J. Cody,et al.  Chebyshev polynomial expansions of complete elliptic integrals , 1965 .

[153]  Brian D. Ripley,et al.  Thoughts on pseudorandom number generators , 1990 .

[154]  Masao Kodama,et al.  Algorithm 877: A Subroutine Package for Cylindrical Functions of Complex Order and Nonnegative Argument , 2008, TOMS.

[155]  Dura W. Sweeney An Analysis of Floating-Point Addition , 1965, IBM Syst. J..

[156]  Richard P. Brent,et al.  A systolic algorithm for extended GCD computation , 1987 .

[157]  Luc Devroye,et al.  Non-Uniform Random Variate Generation , 1986 .

[158]  Michael F. Cowlishaw,et al.  Decimal floating-point: algorism for computers , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[159]  Richard P. Brent,et al.  Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1] , 1978, TOMS.

[160]  B. J. R. Bailey Alternatives to Hastings' Approximation to the Inverse of the Normal Cumulative Distribution Function , 1981 .

[161]  Danny Cohen On Holy Wars and a Plea for Peace , 1981, Computer.

[162]  Mary H. Payne,et al.  Degree reduction for trigonometric functions , 1983, SGNM.

[163]  Philippe Langlois,et al.  Compensated Horner Scheme , 2005, Algebraic and Numerical Algorithms and Computer-assisted Proofs.

[164]  Henry R. Neave,et al.  On Using the Box‐Müller Transformation with Multiplicative Congruential Pseudo‐Random Number Generators , 1973 .

[165]  D. E. Smith,et al.  History of Mathematics , 1924, Nature.

[166]  Arthur G. Adams Remark on algorithm 304 [S15]: normal curve integral , 1969, CACM.

[167]  Bit W. Kahan Branch Cuts for Complex Elementary Functions or Much Ado About Nothing ' s Sign , 2011 .

[168]  Vincent Lefèvre,et al.  Worst cases and lattice reduction , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[169]  Gilad Bracha,et al.  The Java Virtual Machine Specification, Java SE 8 Edition , 2013 .

[170]  Jürgen Lehn,et al.  A non-linear congruential pseudo random number generator , 1986 .

[171]  Charles L. Lawson,et al.  Basic Linear Algebra Subprograms for Fortran Usage , 1979, TOMS.

[172]  M. Livio The Golden Ratio: The Story of Phi, the World's Most Astonishing Number , 2002 .

[173]  Werner Buchholz,et al.  Planning a Computer System: Project Stretch , 1962 .

[174]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

[175]  Eli Maor,et al.  The universal history of numbers : from prehistory to the invention of the computer , 2001 .

[176]  Jerome Toby Coonen Contributions to a proposed standard for binary floating-point arithmetic (computer arithmetic) , 1984 .

[177]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[178]  Nelson H. F. Beebe,et al.  The design of TEX and METAFONT: A retrospective , 2005 .

[179]  D. E. Amos Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order , 1986, TOMS.

[180]  Toshio Fukushima,et al.  Series expansions of symmetric elliptic integrals , 2011, Math. Comput..

[181]  Kim Williams,et al.  Leonhard euler: life, work and legacy , 2008 .

[182]  William J. Cody Algorithm 714: CELEFUNT: a portable test package for complex elementary functions , 1993, TOMS.

[183]  Bruce Schneier,et al.  Cryptography Engineering - Design Principles and Practical Applications , 2010 .

[184]  Stephen Rawlinson Notable Mathematicians: : From Ancient Times to the Present , 1999 .

[185]  Peter McCullagh A rapidly convergent series for computing () and its derivatives , 1981 .

[186]  Wafaa S. Sayed,et al.  What are the Correct Results for the Special Values of the Operands of the Power Operation? , 2016, ACM Trans. Math. Softw..

[187]  Philip Rabinowitz,et al.  Methods of Numerical Integration , 1985 .

[188]  Claude Brezinski,et al.  Extrapolation methods - theory and practice , 1993, Studies in computational mathematics.

[189]  Lloyd N. Trefethen,et al.  Chopping a Chebyshev Series , 2015, ACM Trans. Math. Softw..

[190]  Loyola Marymount,et al.  Multiple Precision Complex Arithmetic and Functions , 1998 .

[191]  B. C. Carlson Computing elliptic integrals by duplication , 1979 .

[192]  Charles F. Webb IBM z10: The Next-Generation Mainframe Microprocessor , 2008, IEEE Micro.

[193]  L. R. Moore,et al.  An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$ , 1986 .

[194]  C. A. R. Hoare,et al.  Ambiguities and insecurities in pascal , 1977, Softw. Pract. Exp..

[195]  Donald E. Amos,et al.  Remark on algorithm 644 , 1990, TOMS.

[196]  G. W. Stewart,et al.  A note on complex division , 1985, TOMS.

[197]  K. B. Oldham,et al.  An Atlas of Functions. , 1988 .

[198]  E. Page,et al.  Approximations to the Cumulative Normal Function and its Inverse for Use on a Pocket Calculator , 1977 .

[199]  Michel L. Lapidus Strings, Fractal Membranes and Noncommutative Spacetimes Strings, Fractal Membranes and Noncommutative Spacetimes , 2008 .

[200]  Jürgen Eichenauer-Herrmann,et al.  Inversive congruential pseudorandom numbers : a tutorial , 1992 .

[201]  M. Newman Power laws, Pareto distributions and Zipf's law , 2005 .

[202]  Mike Gancarz Linux and the Unix philosophy , 2003 .

[203]  Eric Gunnerson A Programmer’s Introduction to C# , 2001, Apress.

[204]  Christine Guenther The Millennium Problems: The Seven Greatest Unsolved Mathematical Puzzles of Our Time , 2003 .

[205]  M. E. Galassi,et al.  GNU SCIENTI C LIBRARY REFERENCE MANUAL , 2005 .

[206]  Donald R. Franceschetti Biographical encyclopedia of mathematicians , 1999 .

[207]  Henry M. Levy,et al.  Computer Programming and Architecture: The VAX-11 , 1980 .

[208]  Jonathan M. Borwein,et al.  Mathematics by experiment - plausible reasoning in the 21st century , 2003 .

[209]  Yves Nievergelt,et al.  Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit , 2003, TOMS.

[210]  Douglas M. Priest,et al.  Algorithms for arbitrary precision floating point arithmetic , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[211]  I. D. Hill,et al.  Correction: Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator , 1982 .

[212]  G. Blanch,et al.  Numerical Evaluation of Continued Fractions , 1964 .

[213]  P. J. Plauger The Standard C Library , 1991 .

[214]  Celso Leandro Palma,et al.  Handbook of simulation: principles, methodology, advances, applications, and practice , 2016 .

[215]  John Gustafson,et al.  Computational Verifiability and Feasibilitv J of the ASCI Program , 1998 .

[216]  George G. Szpiro,et al.  The poincare conjecture: in search of the shape of the universe Poincares prize: the hundred-year q , 2007 .

[217]  R. Broucke,et al.  Algorithm 446: Ten subroutines for the manipulation of Chebyshev series , 1973 .

[218]  Brian Randell,et al.  The origins of digital computers: Selected papers , 1975 .

[219]  John Gregg Lewis Certification of “Algorithm 349: Polygamma Functions with Arbitrary Precision” , 1975, TOMS.

[220]  Alicja Smoktunowicz,et al.  On improving the accuracy of Horner’s and Goertzel’s algorithms , 2004, Numerical Algorithms.

[221]  Wayne R. Cowell,et al.  Sources and development of mathematical software , 1984 .

[222]  Eleanor Pairman,et al.  Tables of the digamma and trigamma functions , 2022 .

[223]  Eli Maor,et al.  The Pythagorean Theorem: A 4,000-Year History , 2019 .

[224]  Jeremy Gray,et al.  The Hilbert Challenge , 2001 .

[225]  M. E. Muller,et al.  A Note on the Generation of Random Normal Deviates , 1958 .

[226]  W. W. Bell,et al.  Special Functions for Scientists and Engineers , 1968 .

[227]  Joan Boyar,et al.  Inferring sequences produced by pseudo-random number generators , 1989, JACM.

[228]  Jean-Michel Muller,et al.  Computing correctly rounded integer powers in floating-point arithmetic , 2010, TOMS.

[229]  Jeanne C. Adams,et al.  Fortran 95 handbook : complete ISO/ANSI reference , 1997 .

[230]  N. L. Johnson,et al.  Continuous Multivariate Distributions, Volume 1: Models and Applications , 2019 .

[231]  Michael Mascagni,et al.  SPRNG: A Scalable Library for Pseudorandom Number Generation , 1999, PP.

[232]  R. Beals,et al.  Special Functions: Discrete orthogonal polynomials , 2010 .

[233]  Eugene Eric Kim,et al.  Ada and the First Computer The collaboration between Ada, countess of Lovelace, and computer pioneer Charles Babbage resulted in a landmark publication that described how to program the world's first computer , 1999 .

[234]  Jeffrey A. Keasler,et al.  Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations , 2013, J. Comput. Phys..

[235]  Frederick P. Brooks,et al.  Computer architecture - concepts and evolution , 1997 .

[236]  Jinn-Tyan Lin,et al.  Approximating the normal tail probability and its inverse for use on a pocket calculator , 1989 .

[237]  Stephen W. Hawking,et al.  God Created the Integers: The Mathematical Breakthroughs That Changed History , 2005 .

[238]  Michael J. Schulte,et al.  A survey of hardware designs for decimal arithmetic , 2010, IBM J. Res. Dev..

[239]  Seppo Linnainmaa,et al.  Software for Doubled-Precision Floating-Point Computations , 1981, TOMS.

[240]  G. W. Stewart Corrigendum: “A Note on Complex Division” , 1986, TOMS.

[241]  Paul Friedland Algorithm 312: Absolute value and square root of a complex number , 1967, CACM.

[242]  M. Payne,et al.  Radian reduction for trigonometric functions , 1983, SGNM.

[243]  Whitlock,et al.  Pseudorandom number generator for massively parallel molecular-dynamics simulations. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[244]  N. Temme Special Functions: An Introduction to the Classical Functions of Mathematical Physics , 1996 .

[245]  Lih-Yuan Deng,et al.  Efficient and portable multiple recursive generators of large order , 2005, TOMC.

[246]  Richard L. Sites,et al.  Alpha AXP architecture reference manual , 1995 .

[247]  B. F. Finkel,et al.  Biography: Leonhard Euler , 1897 .

[248]  A. Bergson Algorithms: Certification of and remark on algorithm 304:Normal curve integral , 1968, CACM.

[249]  D. Mccloskey,et al.  The Cult of Statistical Significance: How the Standard Error Costs Us Jobs, Justice, and Lives , 2008 .

[250]  Lih-Yuan Deng,et al.  Large-Order Multiple Recursive Generators with Modulus 231 - 1 , 2012, INFORMS J. Comput..

[251]  W. J. Cody,et al.  Tables of the Complete Elliptic Integrals K, K , E, and E , 1965 .

[252]  Walter Gautschi Algorithm 542: Incomplete Gamma Functions [S14] , 1979, TOMS.

[253]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[254]  Harald Niederreiter,et al.  Programs to generate Niederreiter's low-discrepancy sequences , 1994, TOMS.

[255]  M Tent The prince of mathematics , 2006 .

[256]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[257]  Toshio Fukushima Precise and fast computation of Jacobian elliptic functions by conditional duplication , 2013, Numerische Mathematik.

[258]  N. M. Maclaren,et al.  A limit on the usable length of a pseudorandom sequence , 1992 .

[259]  C. Lanczos,et al.  A Precision Approximation of the Gamma Function , 1964 .

[260]  Lawrence D'Antonio,et al.  Euler at 300 : an appreciation , 2007 .

[261]  Howard Eves,et al.  An introduction to the history of mathematics , 1953 .

[262]  John Derbyshire,et al.  Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics , 2003 .

[263]  Petr Beckmann,et al.  A History of Pi , 1970 .

[264]  John Harrison Decimal Transcendentals via Binary , 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

[265]  Ariel J. Feldman,et al.  Lest we remember: cold-boot attacks on encryption keys , 2008, CACM.

[266]  Alfred S. Posamentier,et al.  The Fabulous Fibonacci Numbers , 2007 .

[267]  Jean-Michel Muller,et al.  Sharp error bounds for complex floating-point inversion , 2016, Numerical Algorithms.

[268]  Greg Rose KISS: A bit too simple , 2017, Cryptography and Communications.

[269]  Carter Bays,et al.  Improving a Poor Random Number Generator , 1976, TOMS.

[270]  F. James A Review of Pseudorandom Number Generators , 1990 .

[271]  J. E. Thornton Design of a Computer: The Control Data 6600 , 1970 .

[272]  D. A. Dunnett Classical Electrodynamics , 2020, Nature.

[273]  C. Severance,et al.  IEEE 754: An Interview with William Kahan , 1998, Computer.

[274]  Cleve B. Moler,et al.  Replacing Square Roots by Pythagorean Sums , 1983, IBM J. Res. Dev..

[275]  Simon Singh,et al.  The Code Book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography , 1999 .

[276]  John Harrison,et al.  A Software Implementation of the IEEE 754R Decimal Floating-Point Arithmetic Using the Binary Encoding Format , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).

[277]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[278]  I. G. MacDonald,et al.  Symmetric Functions and Orthogonal Polynomials , 1998 .

[279]  Ken Arnold,et al.  The Java Programming Language , 1996 .

[280]  Keith Devlin,et al.  The Man of Numbers: Fibonacci's Arithmetic Revolution , 2011 .

[281]  Douglas M. Priest On properties of floating point arithmetics: numerical stability and the cost of accurate computations , 1992 .

[282]  Ole Møller Note on quasi double-precision , 1965 .

[283]  David W. Matula The base conversion theorem , 1968 .

[284]  William Kahan,et al.  Anomalies in the IBM ACRITH package , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[285]  Angelos D. Keromytis,et al.  Cryptography in OpenBSD: An Overview , 1999, USENIX Annual Technical Conference, FREENIX Track.

[286]  Jean-Michel Muller,et al.  On the Componentwise Accuracy of Complex Floating-Point Division with an FMA , 2013, 2013 IEEE 21st Symposium on Computer Arithmetic.

[287]  장훈,et al.  [서평]「Computer Organization and Design, The Hardware/Software Interface」 , 1997 .

[288]  Ali Y. Duale,et al.  Decimal floating-point in z9: An implementation and testing perspective , 2007, IBM J. Res. Dev..

[289]  Robert Piessens,et al.  Remark and certification on algorithm 446 : Ten subroutines for the manipulation of Chebyshev series , 1975 .

[290]  James Demmel,et al.  Design, implementation and testing of extended and mixed precision BLAS , 2000, TOMS.

[291]  J. Brooks Why most published research findings are false: Ioannidis JP, Department of Hygiene and Epidemiology, University of Ioannina School of Medicine, Ioannina, Greece , 2008 .

[292]  Claude-Pierre Jeannerod,et al.  Improved error bounds for floating-point products and Horner’s scheme , 2016 .

[293]  G. S. Fishman,et al.  A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 231 — 1 , 1982 .

[294]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[295]  I. D. Hill,et al.  Algorithm 304: Normal curve integral , 1967, CACM.

[296]  George E. Forsythe,et al.  WHAT IS A SATISFACTORY QUADRATIC EQUATION SOLVER , 1967 .

[297]  Robert L. Ashenhurst,et al.  Unnormalized Floating Point Arithmetic , 1959, JACM.

[298]  Guy L. Steele,et al.  The Java Language Specification , 1996 .

[299]  James A. Reeds CRACKING A MULTIPLICATIVE CONGRUENTIAL ENCRYPTION ALGORITHM , 1979 .

[300]  Jean-Michel Muller,et al.  On the definition of ulp(x) , 2005 .

[301]  Arak M. Mathai,et al.  Special Functions for Applied Scientists , 2008 .

[302]  Vincent Lefèvre,et al.  Searching worst cases of a one-variable function using lattice reduction , 2005, IEEE Transactions on Computers.

[303]  C. Seife Zero: The Biography of a Dangerous Idea , 2000 .

[304]  George G. Szpiro Poincare's Prize : The Hundred-Year Quest to Solve One of Math's Greatest Puzzles , 2007 .

[305]  Daniel Nahum Rockmore Stalking the Riemann Hypothesis: The Quest to Find the Hidden Law of Prime Numbers , 2005 .

[306]  Nelson H. F. Beebe,et al.  Classic Shell Scripting , 2005 .

[307]  Bernard P. Zajac Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[308]  B. C. Carlson Special functions of applied mathematics , 1977 .

[309]  Robert L. Smith,et al.  A Robust Complex Division in Scilab , 2012, ArXiv.

[310]  L. Carlitz,et al.  The inverse of the error function , 1963 .

[311]  T. J. Rivlin Chebyshev polynomials : from approximation theory to algebra and number theory , 1990 .

[312]  Mark A. Moraes,et al.  Parallel random numbers: As easy as 1, 2, 3 , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[313]  Radford M. Neal Fast exact summation using small and large superaccumulators , 2015, ArXiv.

[314]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[315]  William J. Cody,et al.  The Computation of Real Fractional Order Bessel Functions of the Second Kind , 1977, TOMS.

[316]  Frank E. Harris,et al.  Methods for incomplete Bessel function evaluation , 2009 .

[317]  E. Salamin,et al.  Computation of π Using Arithmetic-Geometric Mean , 1976 .

[318]  Lih-Yuan Deng,et al.  A system of high-dimensional, efficient, long-cycle and portable uniform random number generators , 2003, TOMC.

[319]  Peter Sestoft,et al.  C# annotated standard , 2007 .

[320]  Shmuel Gal,et al.  An accurate elementary mathematical library for the IEEE floating point standard , 1991, TOMS.

[321]  Herbert Schildt,et al.  The annotated ANSI C Standard American National Standard for Programming Languages—C: ANSI/ISO 9899-1990 , 1990 .

[322]  John Shalf,et al.  Extending Summation Precision for Network Reduction Operations , 2013, SBAC-PAD.

[323]  Stephen Lloyd Baluk Moshier,et al.  Methods and programs for mathematical functions , 1989 .

[324]  Murray Hill,et al.  Why Pascal is Not My Favorite Programming Language , 1981 .

[325]  Richard P. Brent,et al.  Error bounds on complex floating-point multiplication , 2007, Math. Comput..

[326]  Toshio Fukushima,et al.  Precise and fast computation of the general complete elliptic integral of the second kind , 2011, Math. Comput..

[327]  Walter S. Brainerd,et al.  Programmer's guide to Fortran 90 , 1990 .

[328]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[329]  Florent de Dinechin,et al.  Towards the post-ultimate libm , 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

[330]  C. Lanczos,et al.  Some improvements in practical Fourier analysis and their application to x-ray scattering from liquids , 1942 .

[331]  W. Cody,et al.  Rational Chebyshev approximations for the error function , 1969 .

[332]  Vincent Lefèvre,et al.  Worst Cases of a Periodic Function for Large Arguments , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).

[333]  Michael J. Flynn,et al.  Introduction to Arithmetic for Digital Systems Designers , 1995 .

[334]  Robert C. Seacord,et al.  Secure coding in C and C , 2005 .

[335]  C. Loan Computational Frameworks for the Fast Fourier Transform , 1992 .

[336]  George Gershwin,et al.  One, Two, Three , 2011 .

[337]  C. G. Bell,et al.  Computer engineering: A DEC view of hardware systems design , 1978 .

[338]  Eberhard Lange Implementation and Test of the ACRITH Facility in a System/370 , 1987, IEEE Transactions on Computers.

[339]  Masao Kodama Remark on Algorithm 644 , 2007, TOMS.

[340]  Iosif G. Dyadkin,et al.  A study of 64-bit multipliers for Lehmer pseudorandom number generators , 1997 .

[341]  John D. Barrow Mathematical Malaises. (Book Reviews: Pi in the Sky. Counting, Thinking, and Being.) , 1993 .

[342]  Sheng Liang,et al.  Java Native Interface: Programmer's Guide and Specification , 1999 .

[343]  R. Kent Dybvig,et al.  Printing floating-point numbers quickly and accurately , 1996, PLDI '96.

[344]  Barbara G. Ryder,et al.  The pfort verifier , 1974, Softw. Pract. Exp..

[345]  Michael J. Flynn,et al.  Advanced Computer Arithmetic Design , 2001 .

[346]  William J. Cody,et al.  Performance evaluation of programs related to the real gamma function , 1991, TOMS.

[347]  G. Marsaglia Random numbers fall mainly in the planes. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[348]  L SteeleGuy,et al.  How to print floating-point numbers accurately , 1990 .

[349]  William J. Cody,et al.  Performance evaluation of programs for the error and complementary error functions , 1990, TOMS.

[350]  M. B. W. Tent Leonhard Euler and the Bernoullis: Mathematicians from Basel , 2009 .

[351]  W. J. Cody,et al.  Chebyshev Approximations for the Psi Function , 1973 .

[352]  Raymond Ayoub Euler and the Zeta Function , 1974 .

[353]  Sebastiano Vigna,et al.  An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled , 2014, ACM Trans. Math. Softw..

[354]  Peter W Lewis,et al.  Naval Postgraduate School Random Number Generator Package LLRANDOM , 1973 .

[355]  Makoto Matsumoto,et al.  Common defects in initialization of pseudorandom number generators , 2007, TOMC.

[356]  Frederick E. Petry,et al.  Higher radix floating point representations , 1989, Proceedings of 9th Symposium on Computer Arithmetic.

[357]  Jean-Pierre Deschamps,et al.  Guide to FPGA Implementation of Arithmetic Functions , 2012, Lecture Notes in Electrical Engineering.

[358]  Chris Arney Notable Women in Mathematics: A Biographical Dictionary , 2001 .

[359]  Nicole Fassbinder Selected Topics In Approximation And Computation , 2016 .

[360]  Israel Koren Computer arithmetic algorithms , 1993 .

[361]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[362]  J. E. Thornton,et al.  The CDC 6600 Project , 1980, Annals of the History of Computing.

[363]  Karl Sigmund,et al.  Kepler’s conjecture: How some of the greatest minds in history helped solve one of the oldest math problems in the world , 2004 .

[364]  W. J. Thron,et al.  Continued Fractions: Analytic Theory and Applications , 1984 .

[365]  Lih-Yuan Deng,et al.  Efficient computer search of large-order multiple recursive pseudo-random number generators , 2012, J. Comput. Appl. Math..

[366]  Peter R. Turner The Distribution of l.s.d. and Its Implications for Computer Design , 1987 .

[367]  Jonathan M. Borwein,et al.  Experimentation in Mathematics: Computational Paths to Discovery , 2004 .

[368]  Yudell L. Luke,et al.  Algorithms for the Computation of Mathematical Functions , 1977 .

[369]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[370]  Annie A. M. Cuyt,et al.  Handbook of Continued Fractions for Special Functions , 2008 .

[371]  J. B. Campbell,et al.  On Temme's Algorithm for the Modified Bessel Function of the Third Kind , 1980, TOMS.

[372]  Iosif G. Dyadkin,et al.  A family of enhanced Lehmer random number generators, with hyperplane suppression, and direct support for certain physical applications , 1997 .

[373]  Guillaume Melquiond,et al.  When double rounding is odd , 2005 .

[374]  L. J. Bain,et al.  Introduction to Probability and Mathematical Statistics , 1987 .

[375]  E. Copson,et al.  Jacobian Elliptic Functions , 1944, Nature.

[376]  Daniel W. Lozier,et al.  NIST Digital Library of Mathematical Functions , 2003, Annals of Mathematics and Artificial Intelligence.

[377]  Siegfried M. Rump,et al.  Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest , 2008, SIAM J. Sci. Comput..

[378]  Annie A. M. Cuyt,et al.  Algorithm 895: A continued fractions package for special functions , 2009, TOMS.

[379]  T. E. Hull,et al.  Properly rounded variable precision square root , 1985, TOMS.

[380]  Claude-Pierre Jeannerod A Radix-Independent Error Analysis of the Cornea-Harrison-Tang Method , 2016, ACM Trans. Math. Softw..

[381]  David Joyce How Mathematics Happened: The First 50,000 Years , 2007 .

[382]  Richard P. Brent,et al.  Recent technical reports , 1977, SIGA.

[383]  I. Bennett Goldberg 27 bits are not enough for 8-digit accuracy , 1967, CACM.

[384]  I︠u︡. A Brychkov Handbook of Special Functions: Derivatives, Integrals, Series and Other Formulas , 2008 .

[385]  M. J. Wichura The percentage points of the normal distribution , 1988 .

[386]  P. Ribenboim The Little Book of Bigger Primes , 2004 .

[387]  R. A. Brooker,et al.  Approximations for Digital Computers , 1957 .

[388]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[389]  Thomas Levenson Newton and the Counterfeiter: The Unknown Detective Career of the World's Greatest Scientist , 2009 .

[390]  Michael J. Schulte,et al.  Hardware Designs for Binary Integer Decimal-Based Rounding , 2011, IEEE Transactions on Computers.

[391]  Nico M. Temme,et al.  Algorithm 969 , 2016, ACM Trans. Math. Softw..

[392]  Peter D. Miller,et al.  Discrete orthogonal polynomials: Asymptotics and applications , 2007 .

[393]  Frank E. Harris,et al.  Mathematical Methods for Physicists: A Comprehensive Guide , 2012 .

[394]  Michael F. Cowlishaw The decNumber C library , 2003 .

[395]  Hui-Chin Tang An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers , 2006 .

[396]  J. D. Beasley,et al.  Algorithm AS 111: The Percentage Points of the Normal Distribution , 1977 .

[397]  D. F. Lawden Elliptic Functions and Applications , 1989 .

[398]  I. D. Hill,et al.  An Efficient and Portable Pseudo‐Random Number Generator , 1982 .

[399]  Michael Cowlishaw,et al.  The REXX language: a practical approach to programming (2nd ed.) , 1985 .

[400]  Michael Mascagni,et al.  Corrigendum: Algorithm 806: SPRNG: a scalable library for pseudorandom number generation , 2000, TOMS.

[401]  Fred P. Brooks,et al.  The Mythical Man-Month , 1975, Reliable Software.

[402]  Albert Werbrouck,et al.  An Analysis of Associated Dividends in the DBM Algorithm for Division by Constants Using Multiplication , 2011, Comput. J..

[403]  Peter W. Markstein,et al.  IA-64 and elementary functions - speed and precision , 2000 .

[404]  Richard P. Brent,et al.  Modern Computer Arithmetic , 2010 .

[405]  Richard P. Brent Analysis of the binary Euclidean algorithm , 1976, SIGS.

[406]  Annie A. M. Cuyt,et al.  A precision- and range-independent tool for testing floating-point arithmetic II: conversions , 2001, TOMS.

[407]  Jean-Luc Chabert,et al.  A history of algorithms: from the pebble to the microchip , 1999 .

[408]  Daniel Zwillinger,et al.  Handbook of Integration. , 1992 .

[409]  Francisco Marcellán,et al.  Orthogonal Polynomials and Special Functions: Computation and Applications , 2006 .

[410]  Abraham Ziv,et al.  Fast evaluation of elementary mathematical functions with correctly rounded last bit , 1991, TOMS.

[411]  Jeffrey Shallit,et al.  Analysis of a left-shift binary GCD algorithm , 1994, ANTS.

[412]  George Marsaglia,et al.  Uniform Random Number Generators , 1965, JACM.

[413]  Nicole Fruehauf Numerical Methods Based On Sinc And Analytic Functions , 2016 .

[414]  Florian Loitsch,et al.  Printing floating-point numbers quickly and accurately with integers , 2010, PLDI '10.

[415]  Anthony C. Hearn,et al.  REDUCE: The First Forty Years , 2005, Algorithmic Algebra and Logic.

[416]  B. C. Carlson Hidden Symmetries of Special Functions , 1970 .

[417]  Sylvie Boldo,et al.  Kahan's Algorithm for a Correct Discriminant Computation at Last Formally Proven , 2009, IEEE Transactions on Computers.

[418]  W. Gautschi Orthogonal Polynomials: Computation and Approximation , 2004 .

[419]  David Hough,et al.  Applications of the Proposed IEEE 754 Standard for Floating-Point Arithetic , 1981, Computer.

[420]  Toshio Fukushima,et al.  Fast computation of complete elliptic integrals and Jacobian elliptic functions , 2009 .

[421]  Alan Jeffrey,et al.  Handbook of mathematical formulas and integrals , 1995 .

[422]  M. D. MacLaren Remark on algorithm 272: Procedure for the normal distribution functions , 1968, Commun. ACM.

[423]  Lawrence M Leemis,et al.  Univariate Distribution Relationships , 2008 .

[424]  Michael Frederic Cowlishaw The NetRexx language , 1997 .

[425]  Miguel Herrero-Collantes,et al.  Quantum random number generators , 2016, 1604.03304.

[426]  D. Gay Correctly Rounded Binary-Decimal and Decimal-Binary Conversions , 1990 .

[427]  Siegfried M. Rump,et al.  Ultimately Fast Accurate Summation , 2009, SIAM J. Sci. Comput..

[428]  A. J. Strecok,et al.  On the calculation of the inverse of the error function , 1968 .

[429]  David Kahn,et al.  Cryptology: Yesterday, Today, and Tomorrow , 1987 .

[430]  James A. Reeds,et al.  "Cracking" a Random Number Generator , 1977, Cryptologia.

[431]  Iosif G. Dyadkin,et al.  A study of 128-bit multipliers for congruential pseudorandom number generators , 2000 .

[432]  J. Bardi,et al.  The Calculus Wars: Newton, Leibniz, and the Greatest Mathematical Clash of All Time , 2006 .

[433]  K W Wojciechowski,et al.  Efficient Monte Carlo simulations using a shuffled nested Weyl sequence random number generator. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[434]  Walter Bright,et al.  The D Programming Language , 2010 .

[435]  A. Stroud,et al.  Gaussian quadrature formulas , 1966 .

[436]  Guy L. Steele,et al.  How to print floating-point numbers accurately , 1990, SIGP.

[437]  Vincent Lefèvre Correctly Rounded Arbitrary-Precision Floating-Point Summation , 2017, IEEE Transactions on Computers.

[438]  George Marsaglia,et al.  A random number generator for PC's , 1990 .

[439]  Tjalling J. Ypma,et al.  Historical Development of the Newton-Raphson Method , 1995, SIAM Rev..

[440]  C. S. Roberts Implementing and testing new versions of a good, 48-bit, pseudo-random number generator , 1982, The Bell System Technical Journal.

[441]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .

[442]  David Blatner The Joy of [pi] , 1997 .

[443]  George Marsaglia,et al.  Random Number Generators , 2003 .

[444]  David H. Bailey,et al.  Experimental Mathematics in Action , 2007 .

[445]  Louis Vessot King,et al.  On some new formulæ for the numerical calculation of the mutual induction of coaxial circles , 1921 .

[446]  Craig A. Knoblock,et al.  Advanced Programming in the UNIX Environment , 1992, Addison-Wesley professional computing series.

[447]  Wolfgang Hörmann,et al.  Automatic Nonuniform Random Variate Generation , 2011 .

[448]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[449]  P. L’Ecuyer Random Number Generation , 2012 .

[450]  Peter Ahrens,et al.  Efficient Reproducible Floating Point Summation and BLAS , 2015 .

[451]  Guy L. Steele,et al.  Fast splittable pseudorandom number generators , 2014, OOPSLA 2014.

[452]  Jean-Michel Muller,et al.  Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic , 2011, IEEE Transactions on Computers.

[453]  David Flannery,et al.  In Code: A Mathematical Journey , 2002 .

[454]  Christopher Strachey On Taking the Square Root of a Complex Number , 1959, Comput. J..

[455]  G. A. Barnard,et al.  Student: A Statistical Biography of William Sealy Gosset , 1990 .

[456]  W. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[457]  Michael Metcalf,et al.  Fortran 90 Explained , 1990 .

[458]  Sergey Khrushchev Orthogonal Polynomials and Continued Fractions: From Euler's Point of View , 2008 .

[459]  Peter L. Walker,et al.  Elliptic Functions: A Constructive Approach , 1996 .

[460]  N.J. Higham,et al.  Numerical Computation: Methods, Software, And Analysis , 1998, IEEE Computational Science and Engineering.

[461]  J. Phillips,et al.  The NAG library , 1986 .

[462]  A. D. Hall,et al.  Algorithm 528: Framework for a Portable Library [Z] , 1978, TOMS.

[463]  Eric W. Weisstein,et al.  The CRC concise encyclopedia of mathematics , 1999 .

[464]  Alexander A. Stepanov,et al.  C++ Standard Template Library , 2000 .

[465]  Jürgen Wolff von Gudenberg,et al.  A long accumulator like a carry-save adder , 2011, Computing.

[466]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[467]  Philippe Langlois,et al.  Improving the compensated Horner scheme with a fused multiply and add , 2006, SAC.

[468]  Hui-Chin Tang,et al.  An exhaustive search for good 64-bit linear congruential random number generators with restricted multiplier , 2011, Comput. Phys. Commun..

[469]  Charles Edward Sandifer,et al.  The Early Mathematics of Leonhard Euler , 2007 .

[470]  John Harrison Fast and Accurate Bessel Function Computation , 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

[471]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[472]  Stef Graillat,et al.  Accurate Floating-Point Product and Exponentiation , 2009, IEEE Transactions on Computers.

[473]  Karl Sabbagh The Riemann hypothesis : the greatest unsolved problem in mathematics , 2004 .

[474]  I. D. Hill,et al.  Remarks on Algorithm 180: Error function—large X , 1967 .

[475]  Pierre L'Ecuyer,et al.  Maximally equidistributed combined Tausworthe generators , 1996, Math. Comput..

[476]  B. C. Carlson Numerical computation of real or complex elliptic integrals , 2005, Numerical Algorithms.

[477]  M. Donald MacLaren Algorithm 272: procedure for the normal distribution functions , 1965, CACM.

[478]  Silvia M. Müller,et al.  Quad Precision Floating Point on the IBM z13 , 2016, 2016 IEEE 23nd Symposium on Computer Arithmetic (ARITH).

[479]  Robert Kaplan,et al.  The Nothing that Is: A Natural History of Zero , 1999 .

[480]  André DeHon,et al.  Accurate Parallel Floating-Point Accumulation , 2013, IEEE Transactions on Computers.

[481]  Melba Phillips,et al.  Classical Electricity and Magnetism , 1955 .

[482]  Niklaus Wirth The programming language pascal , 2004, Acta Informatica.

[483]  G. Marsaglia,et al.  A New Class of Random Number Generators , 1991 .

[484]  Tomás Lang,et al.  Digit-Serial Arithmetic , 2004 .

[485]  U. D. Jentschura,et al.  Numerical calculation of Bessel, Hankel and Airy functions , 2011, Comput. Phys. Commun..

[486]  Ronald F. Boisvert,et al.  Portable vectorized software for Bessel function evaluation , 1992, TOMS.

[487]  Keith Devlin,et al.  The Unfinished Game: Pascal, Fermat, and the Seventeenth-Century Letter that Made the World Modern , 2008 .

[488]  Jian-Ming Jin,et al.  Computation of special functions , 1996 .

[489]  William J. Cody,et al.  Algorithm 715: SPECFUN–a portable FORTRAN package of special function routines and test drivers , 1993, TOMS.

[490]  Phyllis Fox Remark on “Algorithm 528: Framework for a Portable Library [Z]” , 1979, TOMS.

[491]  José E. Moreira,et al.  The fused multiply-add instruction leads to algorithms for extended-precision floating point: applications to java and high-performance computing , 1999, CASCON.

[492]  Lih-Yuan Deng,et al.  Scalable parallel multiple recursive generators of large order , 2009, Parallel Comput..

[493]  Kenneth E. Iverson,et al.  A Formal Description of SYSTEM/360 , 1964, IBM Syst. J..

[494]  Susann Ragsdale,et al.  The Common Language Infrastructure Annotated Standard , 2003 .

[495]  Jiirgen Eichenauer-Herrmann,et al.  Pseudorandom Number Generation by Nonlinear Methods , 1995 .

[496]  Wolfgang Rülling,et al.  A Circuit for Exact Summation of Floating-Points Numbers , 1996, Inf. Process. Lett..

[497]  S. Nash,et al.  Numerical methods and software , 1990 .

[498]  Xiaoye S. Li,et al.  Quad-Double Arithmetic: Algorithms, Implementation, and Application∗ , 2007 .

[499]  Laszlo Hars Modular Inverse Algorithms Without Multiplications for Cryptographic Applications , 2006, EURASIP J. Embed. Syst..

[500]  Augustin A. Dubrulle,et al.  A Class of Numerical Methods for the Computation of Pythagorean Sums , 1983, IBM J. Res. Dev..

[501]  A. R. Barnett,et al.  Coulomb wave functions for all real eta and rho , 1974 .

[502]  Pierre L'Ecuyer,et al.  On the xorshift random number generators , 2005, TOMC.

[503]  J. L. Schonfelder,et al.  Chebyshev expansions for the error and related functions , 1978 .

[504]  Klaudia Beich To Infinity And Beyond A Cultural History Of The Infinite , 2016 .

[505]  R. E. Odeh,et al.  Algorithm AS 70: The Percentage Points of the Normal Distribution , 1974 .

[506]  J. Marion,et al.  Classical Electromagnetic Radiation , 1965 .

[507]  Henry S. Warren,et al.  Hacker's Delight , 2002 .

[508]  Roger M. Needham,et al.  TEA, a Tiny Encryption Algorithm , 1994, FSE.

[509]  Thomas J. Misa,et al.  An interview with Edsger W. Dijkstra , 2010, Commun. ACM.

[510]  Zhishun A. Liu Berkeley Elementary Functions Test Suite , 1988 .

[511]  Peter Naur Reprinted from the Communications of the Association for Computing Machinery , 1961 .

[512]  Peter Hellekalek,et al.  Empirical evidence concerning AES , 2003, TOMC.

[513]  H. Niederreiter Quasi-Monte Carlo methods and pseudo-random numbers , 1978 .

[514]  Vincent Lefèvre,et al.  Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format , 2008, Reliable Implementation of Real Number Algorithms.

[515]  Ronald Cools,et al.  Algorithm 858: Computing infinite range integrals of an arbitrary product of Bessel functions , 2006, TOMS.

[516]  Peter H. Salus,et al.  A quarter century of UNIX , 1994 .

[517]  G. Arfken Mathematical Methods for Physicists , 1967 .

[518]  N. L. Johnson,et al.  Discrete Multivariate Distributions , 1998 .

[519]  Averill Law,et al.  Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management) , 2006 .

[520]  Frank B. Baker,et al.  A method for evaluating the area of the normal function , 1961, CACM.

[521]  Liang-Wu Cai On the computation of spherical Bessel functions of complex arguments , 2011, Comput. Phys. Commun..

[522]  Mike Gancarz The Unix Philosophy: A Cast of Thousands , 1994 .

[523]  Bruce Schneier,et al.  Practical cryptography , 2003 .

[524]  Damien Stehlé,et al.  Gal's accurate tables method revisited , 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

[525]  D. E. Amos,et al.  Algorithm 610: A Portable FORTRAN Subroutine for Derivatives of the Psi Function , 1983, TOMS.

[526]  W. H. J. Feijen,et al.  Beauty Is Our Business: A Birthday Salute to Edsger W.Dijkstra , 1990 .

[527]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[528]  William Dunham Euler: The Master of Us All , 1999 .

[529]  G. Marsaglia,et al.  Monkey tests for random number generators , 1993 .

[530]  Magdy Bayoumi,et al.  Hardware Design of a Binary Integer Decimal-based IEEE P754 Rounding Unit , 2007 .

[531]  Bruce Schneier,et al.  Beyond fear - thinking sensibly about security in an uncertain world , 2003 .

[532]  Jerome T. Coonen,et al.  Ieee standard for binary floating-point arithmetic , 1985 .

[533]  David G. Hough,et al.  A Proposed Radix- and Word-length-independent Standard for Floating-point Arithmetic , 1984, IEEE Micro.

[534]  Aleksander Donev Interoperability with C in Fortran 2003 , 2006, FORF.

[535]  GoldbergDavid,et al.  "What Every Computer Scientist Should Know About Floating-Point Arithmetic" , 1991, ACM Comput. Surv..

[536]  Ora E. Percus,et al.  Theory and application of Marsaglia's monkey test for pseudorandom number generators , 1995, TOMC.

[537]  Martin Campbell-Kelly,et al.  The History of Mathematical Tables , 2003 .

[538]  L. Milne‐Thomson A Treatise on the Theory of Bessel Functions , 1945, Nature.

[539]  Philippe Langlois,et al.  How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).

[540]  Juliane Junker,et al.  Computer Organization And Design The Hardware Software Interface , 2016 .

[541]  Jean-Michel Muller On the Error of Computing ab+cd using Cornea, Harrison and Tang's Method , 2015, ACM Trans. Math. Softw..

[542]  Daniel N. Rockmore,et al.  The FFT: an algorithm the whole family can use , 2000, Comput. Sci. Eng..

[543]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.

[544]  Vincent Lefèvre,et al.  On the Computation of Correctly-Rounded Sums , 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

[545]  A. Wiles,et al.  The Millennium Prize Problems , 2006 .

[546]  Alan Agresti,et al.  Statistics: The Art and Science of Learning from Data , 2005 .

[547]  Ronald G. Parson Certification of algorithm 147 [S14]: PSIF , 1969, CACM.

[548]  I. D. Hill,et al.  Generating good pseudo-random numbers , 2006, Comput. Stat. Data Anal..

[549]  Vincent Lefèvre,et al.  MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.

[550]  William Dunham The genius of Euler : reflections on his life and work , 2007 .

[551]  R. R. Hall,et al.  AN INTRODUCTION TO THE THEORY OF THE RIEMANN ZETA‐FUNCTION , 1989 .

[552]  Akio Watanabe,et al.  Architecture and software support in IBM S/390 Parallel Enterprise Servers for IEEE Floating-Point arithmetic , 1999, IBM J. Res. Dev..

[553]  Craig B. Borkowf,et al.  Random Number Generation and Monte Carlo Methods , 2000, Technometrics.

[554]  J. Stein Computational problems associated with Racah algebra , 1967 .

[555]  P. Morse,et al.  Methods of theoretical physics , 1955 .

[556]  Julian Havil Gamma: Exploring Euler's Constant , 2003 .

[557]  Andreas K. Heyne,et al.  Leonhard Euler: A Man to Be Reckoned With , 2007 .

[558]  D ClingerWilliam How to read floating point numbers accurately , 1990 .

[559]  T. J. Dekker,et al.  A floating-point technique for extending the available precision , 1971 .

[560]  Ole Møller Quasi double-precision in floating point addition , 1965 .

[561]  James Demmel Effects of Underflow on Solving Linear Systems , 1983 .

[562]  Bruce Schneier,et al.  Secrets and Lies: Digital Security in a Networked World , 2000 .

[563]  Ping Tak Peter Tang,et al.  Implementing complex elementary functions using exception handling , 1994, TOMS.

[564]  H. E. Salzer,et al.  Table of the zeros and weight factors of the first fifteen Laguerre polynomials , 1949 .

[565]  Ronald F. Boisvert,et al.  NIST Handbook of Mathematical Functions , 2010 .

[566]  Brian W. Kernighan,et al.  The Practice of Programming , 1999 .

[567]  Paul F. Byrd,et al.  Handbook of elliptic integrals for engineers and scientists , 1971 .

[568]  D. Stevenson A Proposed Standard for Binary Floating-Point Arithmetic , 1981, Computer.

[569]  Stefan Wegenkittl,et al.  A survey of quadratic and inversive congruential pseudorandom numbers , 1998 .

[570]  J. Tukey The Teaching of Concrete Mathematics , 1958 .

[571]  Serafina Cuomo,et al.  Fibonacci’s Liber Abaci: A Translation into Modern English of Leonardo Pisano’s Book of Calculation , 2003 .

[572]  Refaat El Attar Special Functions and Orthogonal Polynomials , 2006 .

[573]  Michael J. Schulte,et al.  The K5 transcendental functions , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[574]  Tsuyoshi Horiguchi,et al.  Convergence of the arithmetic-geometric mean procedure for the complex variables and the calculation of the complete elliptic integrals with complex modulus , 1972 .

[575]  Joseph H. Silverman,et al.  A Friendly Introduction to Number Theory , 1996 .

[576]  Martin H. Levinson Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem , 1998 .

[577]  Ahmed Hemani,et al.  Gaussian Random Number Generation , 2016, ACM Comput. Surv..

[578]  J. L. Blue,et al.  A Portable Fortran Program to Find the Euclidean Norm of a Vector , 1978, TOMS.

[579]  Toshio Fukushima Recursive computation of derivatives of elliptic functions and of incomplete elliptic integrals , 2013, Appl. Math. Comput..

[580]  B. Schmeiser,et al.  Approximations to the Inverse Cumulative Normal Function for Use on Hand Calculators , 1979 .

[581]  Jean-Michel Muller,et al.  Further analysis of Kahan's algorithm for the accurate computation of 2×2 determinants , 2013, Math. Comput..

[582]  Rob Gordon,et al.  Essential Jni: Java Native Interface , 1998 .

[583]  Andreas Knöfel Fast hardware units for the computation of accurate dot products , 1991, IEEE Symposium on Computer Arithmetic.

[584]  Douglas M. Priest Efficient scaling for complex division , 2004, TOMS.

[585]  Niklaus Wirth,et al.  The design of a pascal compiler , 1971, Softw. Pract. Exp..

[586]  Kyle Forinash,et al.  Mathematical Methods in Physics: Partial Differential Equations, Fourier Series, and Special Functions , 2009 .

[587]  Samuel Kotz,et al.  Urn Models and Their Application: An Approach to Modern Discrete Probability Theory , 1978 .

[588]  Donald E. Knuth,et al.  Computation of Tangent, Euler, and Bernoulli Numbers* , 1967 .

[589]  Kenneth L. Bowers,et al.  Sinc methods for quadrature and differential equations , 1987 .

[590]  Eric S. Raymond,et al.  The Art of Unix Programming , 2003 .

[591]  Pierre L'Ecuyer,et al.  On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators , 2014, INFORMS J. Comput..

[592]  Larry C. Andrews Modified Bessel Functions of the First Kind , 2011 .

[593]  Robin J. Wilson Four Colors Suffice: How the Map Problem Was Solved , 2002 .

[594]  Donald E. Knuth MMIXware, A RISC Computer for the Third Millennium , 1999, Lecture Notes in Computer Science.

[595]  William J. Cody Analysis of Proposals for the Floating-Point Standard , 1981, Computer.

[596]  P. Shiu,et al.  PI AND THE AGM A Study in Analytic Number Theory and Computational Complexity (Canadian Mathematical Society Series of Monographs and Advanced Texts) , 1988 .

[597]  Petr Beckmann,et al.  Orthogonal polynomials for engineers and physicists , 1973 .

[598]  Henry E. Fettis,et al.  A stable algorithm for computing the inverse error function in the “tail-end” region , 1974 .

[599]  Shin'ichi Oishi,et al.  Error-free transformation of matrix multiplication with a posteriori validation , 2016, Numer. Linear Algebra Appl..

[600]  N. Metropolis,et al.  The Monte Carlo method. , 1949 .

[601]  David Gries Binary to decimal, one more time , 1990 .

[602]  William J. Thompson,et al.  Atlas for Computing Mathematical Functions: An Illustrated Guide for Practitioners with Programs in Fortran 90 and Mathematica , 1997 .

[603]  David M. Gay,et al.  Self-adapting Fortran 77 machine constants: comment on Algorithm 528 , 1999, TOMS.

[604]  George Pólya,et al.  Remarks on Computing the Probability Integral in One and Two Dimensions , 1949 .

[605]  Solomon W. Golomb,et al.  Claude Elwood Shannon (1916–2001), Volume 49, Number 1 , 1916 .

[606]  Marcus du Sautoy The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics , 2012 .

[607]  P. Ribenboim The new book of prime number records , 1996 .

[608]  Peter Kornerup,et al.  Finite Precision Number Systems and Arithmetic , 2010 .

[609]  Siegfried M. Rump,et al.  Accurate Sum and Dot Product , 2005, SIAM J. Sci. Comput..

[610]  Shu Tezuka,et al.  On the lattice structure of the add-with-carry and subtract-with-borrow random number generators , 1993, TOMC.

[611]  Ping Tak Peter Tang,et al.  Implementing the complex arcsine and arccosine functions using exception handling , 1997, TOMS.

[612]  Peter Kornerup,et al.  Semantics for exact floating point operations , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[613]  Markus Neher,et al.  Complex standard functions and their implementation in the CoStLy library , 2007, TOMS.

[614]  Siegfried M. Rump Error estimation of floating-point summation and dot product , 2012 .

[615]  Haim Shore Simple Approximations for the Inverse Cumulative Function, the Density Function and the Loss Integral of the Normal Distribution , 1982 .

[616]  Pamela Gorkin Dr. Euler’s fabulous formula: cures many mathematical ills , 2007 .

[617]  James Demmel,et al.  Communication lower bounds and optimal algorithms for numerical linear algebra*† , 2014, Acta Numerica.