NoZDR.RU » Библиотека » KOLXO3 » Отдельные статьи » Численные методы

Навигация

• Онлайн: 2



Рейтинг@Mail.ru Индекс цитирования

Яндекс
biblio/kolxoz/papers/numerical_methods.txt · Последнее изменение: 09.09.2023 16:47 — nozdr

Численные методы

  1. ACM TOMS algorithms code
    1. www.netlib.org_TOMS.zip (85.3М)
  2. Akima H. New method for interpolation and curve fitting based on local procedures (JACM 17, p589, 1970)(T)(14s).djvu (196.8К)
  3. Bachmann, Zima. Chains of recurrences for evaluation of functions at regular grids(T)(8s).djvu (198.4К)
  4. Bachmann. Effective simplification of chains of recurrences (1997)(11s).ps.gz (122.2К)
  5. Bernstein. SURF, a simple unpredictable random function(3s).ps.gz (68.8К)
  6. Bessel functions
    1. Amos. Algorithm 644. Computation of Bessel functions (1986)(T)(9s).djvu (117.2К)
    2. Ball. Zeros of Bessel functions and others(7s).ps.gz (137.9К)
    3. Gautschi. Algorithm 236, Bessel functions of the 1st kind(T)(5s).djvu (198.5К)
    4. Gautschi. Bessel and Airy function computations(10s).ps.gz (46.8К)
    5. Gil et al. Algorithm 819. Complex Airy functions (TOMS2002)(T)(12s).djvu (129.6К)
    6. Gil et al. Computation of the Bessel 3rd kind of imaginary order(T)(18s).djvu (104.1К)
    7. Gil et al. Computing Airy function by quadrature(T)(15s).djvu (108.3К)
    8. Gil et al. Computing toroidal functions(14s).ps.gz (184.4К)
    9. Gil et al. Using non-oscillating integrals for Airy function(T)(14s).djvu (93.1К)
    10. Temme. Numerics for Airy-type asymptotic expansions (1997)(18s).ps.gz (103.2К)
    11. Temme. Numerics of parabolic cylinder functions(27s).ps.gz (136.5К)
    12. Temme. Uniform asymptotic expansions of integrals (1995)(24s).ps.gz (86.9К)
    13. Wegstein. Algorithm 163. Modified Hankel function(T)(9s).djvu (319.1К)
  7. Beta,Gamma functions
    1. Algorithm 708 (Fortran).f.gz (14.6К)
    2. Amos. Computing exponential integrals(T)(13s).djvu (149.5К)
    3. Boik et al. Derivatives of the incomplete beta function(20s).pdf (137.2К)
    4. Bradley. Ramanujan#s formula for psi function(12s).ps.gz (45.6К)
    5. Brown, Levy. Certification of algorithm 708, incomplete beta(T)(5s).djvu (69.5К)
    6. Buehring. Asymptotic expansion for ratio of products of Gamma functions (IJMMS2000)(6s).pdf (91.6К)
    7. DiDonato, Morris. Computation of incomplete Gamma functions ratios(T)(17s).djvu (196.0К)
    8. Didonato, Morris. Algorithm 708, incomplete beta function ratios(T)(14s).djvu (144.7К)
    9. Doman. Asymptotic of incomplete beta function(T)(6s).djvu (44.0К)
    10. Euler#s constant gamma(7s).ps.gz (49.2К)
    11. Formulae for Euler#s constant gamma(5s).ps.gz (42.4К)
    12. Fullerton. Modified incomplete Gamma function(T)(3s).djvu (81.9К)
    13. Gamma function with lanczos and GMP(7s).ps.gz (31.4К)
    14. Gamma function with lanczos and GMP.htm.gz (4.9К)
    15. Gautschi Algorithm 471, exponential integrals(T)(3s).djvu (141.5К)
    16. Gautschi. A note on the recursive calculation of incomplete Gamma function(T)(7s).djvu (56.1К)
    17. Gautschi. Algorithm 542, Incomplete Gamma function(T)(8s).djvu (83.0К)
    18. Gautschi. Computation of incomplete Gamma function(T)(16s).djvu (207.7К)
    19. Gautschi. Expansion of Ei in incomplete Gamma(8s).ps.gz (32.2К)
    20. Gautschi. Incomplete Gamma function and Tricomi(43s).ps.gz (409.2К)
    21. Gourdon et al. Introduction to Gamma function(20s).ps.gz (200.9К)
    22. Hare. Computing the principal branch of the log-gamma function(T)(16s).djvu (92.7К)
    23. Introduction to the gamma function(20s).ps.gz (200.9К)
    24. Jones, Thron. Computation of incomplete Gamma function in the complex domain (JCAM 1985)(C)(17s).djvu (664.2К)
    25. Jones, Thron. Computation of incomplete Gamma function in the complex domain (JCAM 1985)(T)(C)(17s).djvu (715.0К)
    26. Kuki. Algorithm 421 (complex gamma function)(T)(6s).djvu (120.0К)
    27. Lanczos. Precision approximation for Gamma function(T)(12s).djvu (86.3К)
    28. Ng. Comparison of methods for Gamma function(T)(15s).djvu (209.7К)
    29. Note on complex gamma function via Lanczos .txt.gz (7.1К)
    30. Smith. Algorithm 814. Bernoulli, Gamma and related functions(11s).pdf (130.8К)
    31. Spouge. Calculation of Gamma function and its derivatives(T)(15s).djvu (157.5К)
    32. Temme. Asymptotic inversion of incomplete gamma functions 1992(T)(11s).djvu (86.5К)
    33. Temme. Asymptotics of incomplete gamma and beta functions 1975(T)(7s).djvu (68.0К)
    34. Temme. Asymptotics of incomplete gamma function with negative parameters 1991(11s).ps.gz (107.2К)
    35. Temme. Asymptotics of zeros of incomplete gamma function(8s).ps.gz (55.0К)
    36. fortran_gamma_funcs.zip (44.6К)
    37. ln.gamma by lanczos method.txt.gz (1.2К)
  8. Borwein et al. Sinc integrals analytically found(17s).ps.gz (80.0К)
  9. Borwein. List of publications(10s).ps.gz (44.9К)
  10. Brent. Binary Euclidean algorithm(19s).ps.gz (111.4К)
  11. Brent. Numerical stability of fast algorithms.dvi.gz (27.9К)
  12. Brent. Stability of Schur-Bareiss algorithm.dvi.gz (30.9К)
  13. Businger. Algorithm 358, singular value decomposition of complex matrix(T)(5s).djvu (238.1К)
  14. Cheng, Zima. Acceleration of binary splitting 2000(T)(8s).djvu (110.1К)
  15. Clarkson. Safe and effective determinant evaluation(18s).ps.gz (57.7К)
  16. Cohen et al. Convergence acceleration of alternating series(10s).ps.gz (355.2К)
  17. Continued fractions
    1. Appelgate, Onishi. Slow continued fraction algorithm via 2x2 matrices (AMM 1983)(T)(14s).djvu (142.4К)
    2. Bernstein. Kronecker matrices and continued fractions. 1996(8s).ps.gz (94.4К)
    3. Blanch. Numerical evaluation of continued fractions (SIAM Rev. 1964)(T)(40s).djvu (376.5К)
    4. Brent. Computation of the regular continued fraction for Euler#s constant (MC1977)(T)(8s).djvu (63.8К)
    5. Char. Stieltjes continued fraction for the Gamma function, 40 terms (MC1980)(T)(6s).djvu (51.3К)
    6. Dijkstra. Continued fraction expansion for generalized Dawson#s integral (MC1977)(T)(9s).djvu (77.5К)
    7. Edalat et al. Lazy computation with exact real numbers 1997(12s).ps.gz (70.3К)
    8. Edalat, Heckmann. Computation-with-real-numbers(57s).ps.gz (264.0К)
    9. Edalat. A new representation for exact reals 1997(13s).ps.gz (68.8К)
    10. Edalat. Numerical-integration-with-exact real arithmetic(15s).ps.gz (87.4К)
    11. Edalat. Two algorithms for root finding in exact real arithmetic.1998(20s).ps.gz (110.7К)
    12. Elliott. Truncation errors in Pade approximations (MC 1967)(T)(10s).djvu (101.3К)
    13. Field. Speed of convergence of continued fractions(T)(9s).djvu (88.8К)
    14. Flajolet P., Vallee B. Continued fraction algorithms, functional operators and structure constants (INRIA preprint, 1996)(35s).ps.gz (148.8К)
    15. Flajolet, Sedgewick. Analytic combinatorics. 2001.ALCOMFT-TR-01-8(100s).ps.gz (614.8К)
    16. Flajolet, Vallee. Analysis of continued fraction algorithms. 2001.ALCOMFT-TR-01-1(30s).ps.gz (402.6К)
    17. Flajolet. Combinatorial aspects of continued fractions. 1980(T)(37s).djvu (394.7К)
    18. Frank. New continued fraction expansion for ratios of hypergeometric functions (TAMS1956)(T)(25s).djvu (192.0К)
    19. Frank. New continued fraction expansions for ratios of Heine functions (TAMS1958)(T)(14s).djvu (136.4К)
    20. Frank. Real parts of zeros of complex polynomials, applications to continued fraction expansions (TAMS1947)(T)(13s).djvu (135.3К)
    21. Gargantini, Henrici. Continued fraction algorithm for computation of higher transcendental functions (MC1967)(T)(13s).djvu (125.0К)
    22. Gautschi. Convergence of continued fractions (MC 1983)(T)(7s).djvu (61.4К)
    23. Gautschi. Wrong convergence of continued fraction for Kummer functions (MC 1977)(T)(7s).djvu (68.4К)
    24. Hayden. Continued fraction approximation to functions (Numer.Math.1965)(L)(T)(9s).djvu (168.7К)
    25. Heckmann. How many digits needed for n result digits (1999)(21s).ps.gz (85.6К)
    26. Heckmann. Translation of Taylor series into LFT (continued fractions)(10s).ps.gz (39.0К)
    27. Henrici, Pfluger. Truncation error estimates for Stieltjes fractions (Numer.Math.1966)(L)(T)(10s).djvu (183.5К)
    28. Jefferson. Truncation error estimates for T-fractions (SIAM JNA 1969)(T)(7s).djvu (62.6К)
    29. Jones, Snell. Truncation error bounds for continued fractions (SIAM JNA 1969)(T)(13s).djvu (98.9К)
    30. Jones, Thron. A posteriori bounds for truncation error of continued fractions (SIAM JNA 1971)(T)(14s).djvu (104.9К)
    31. Jones, Thron. Numerical stability for continued fractions(T)(17s).djvu (140.4К)
    32. Jones. Rounding error in continued fractions(T)(8s).djvu (68.4К)
    33. Just B. Generalizing the continued fraction algorithm to arbitrary dimensions (SIAM J.Comp.21, p909, 1992)(T)(18s).djvu (246.2К)
    34. Lester. Exact statistics and continued fractions(10s).ps.gz (42.5К)
    35. Merkes. Truncation error for continued fractions (SIAM JNA 1966)(T)(12s).djvu (104.5К)
    36. Olds. Simple continued fraction expansion of e (AMM1970)(T)(8s).djvu (67.1К)
    37. Potts, Edalat. Exact real computer arithmetic 1997(25s).ps.gz (128.7К)
    38. Potts. Computable real arithmetic, elementary functions 1996(39s).ps.gz (142.5К)
    39. Rosen, Shallit. Continued fraction algorithm for approximation real polynomial roots (MathMag 1978)(T)(6s).djvu (64.5К)
    40. Scott, Wall. Continued fraction expansions for arbitrary power series (AnnMath1940)(T)(23s).djvu (210.8К)
    41. Scott. Corresponding continued fraction of J-fraction (AnnMath1950)(T)(13s).djvu (137.8К)
    42. Scott. Reciprocal of a continued fraction (PAMS1952)(T)(6s).djvu (56.7К)
    43. Shiu. Continued fractions of zeros of functions (MC 1995)(T)(12s).djvu (124.3К)
    44. Spielberg. Efficient continued fraction approximations to elementary functions (MC1961)(T)(10s).djvu (103.9К)
    45. Spielberg. Polynomial and continued-fraction approximations for logarithmic functions (MC1962)(T)(14s).djvu (146.5К)
    46. Strassen. Computational complexity of continued fractions(T)(17s).djvu (556.5К)
    47. Sweezy, Thron. Estimates of speed of convergence of certain continued fractions (SIAM JNA 1967)(T)(18s).djvu (150.0К)
    48. Teichmann. Complexity of elementary math on continued fractions(13s).ps.gz (48.7К)
    49. Thron, Waadeland. Accelerating convergence of limit periodic continued fractions K(an1) (Numer.Math.1980)(L)(T)(9s).djvu (153.1К)
    50. Van Vleck. Convergence of the continued fraction of Gauss and others (AnnMath1901)(T)(19s).djvu (242.0К)
    51. Vaughan. Generalization of simple continued fraction algorithm (MC1978)(T)(23s).djvu (191.3К)
    52. Vuillemin. Exact arithmetic with continued fractions(T)(14s).djvu (233.6К)
    53. Wynn P. Converging factors for continued fractions (Numer.Math.1959)(T)(49s).djvu (400.7К)
    54. Wynn P. Rational approximation of functions defined by power series (Math.Comp.1960)(T)(41s).djvu (593.1К)
    55. Wynn. Recent developments in theory and applications of continued fractions (SIAM JNA 1964)(T)(22s).djvu (178.6К)
  18. Cooley, Tukey. Algorithm for machine calculation of complex Fourier series (Math.Comp.19, p297, 1965)(600dpi)(T)(6s).djvu (104.2К)
  19. Dickey L. High powers of matrices (SIGAPL87)(T)(4s).djvu (95.2К)
  20. Dyer, Ip. Introduction to Scientific Computing(59s).ps.gz (184.3К)
  21. Error function
    1. Blair et al. Rational Chebyshev approximations for inverse error function (MC 1976)(T)(67s).djvu (264.2К)
    2. Carta. Low-order approximations for error function (MC 1975)(T)(8s).djvu (77.7К)
    3. Gautschi. Algorithm 363, error function(2s).djvu (54.6К)
    4. Gautschi. Algorithm 363, error function(T)(2s).djvu (55.6К)
    5. Gautschi. Efficient computation of erfc (1970)(T)(13s).djvu (113.7К)
    6. Gautschi. Repeated integrals of coerror function(T)(13s).djvu (182.0К)
    7. McCabe. Continued fraction for Dawson#s integral(T)(7s).djvu (58.1К)
    8. Mori M. Computation of error function with high relative accuracy (Publ.RIMS 19, p1081, 1983)(600dpi)(T)(14s).djvu (201.1К)
    9. Poppe, Wijers. Computation of the erfc (Alg. 680)(T)(1s).djvu (14.9К)
    10. Poppe, Wijers. More efficient computation of the erfc(T)(9s).djvu (97.6К)
    11. Wegstein. Algorithm 180, erf x at large x(T)(6s).djvu (190.1К)
  22. Fessler et al. HURRY, acceleration of sequences(T)(9s).djvu (129.0К)
  23. Fresnel integrals
    1. Acton. Recurrence for Fresnel integral(T)(2s).djvu (54.8К)
    2. Anderson. Remark on algorithm 723 (Fresnel integral)(T)(1s).djvu (8.2К)
    3. Fresnel integrals (Fortran).shar.gz (50.4К)
    4. Van Snyder. Algorithm 723 (Fresnel integrals)(T)(5s).djvu (68.6К)
    5. Van Snyder. Remark on algorithm 723 (Fresnel integrals)(T)(3s).djvu (26.1К)
  24. GCD
    1. Bernstein_fast_gcd_notes.txt (4.0К)
    2. Bradley. Algorithm 386. GCD of n integers and multipliers (CACM1970)(T)(4s).djvu (142.9К)
    3. Bradley. New Euclidean algorithm for GCD (CACM 1970)(T)(4s).djvu (160.5К)
    4. Brown. Euclid algorithm and polynomial GCD analysis (SIGSAM1971)(T)(17s).djvu (260.9К)
    5. Jebelean. Generalization of Euclidean GCD(8s).ps.gz (53.6К)
    6. Jebelean. Lehmer-Euclid GCD algorithm(15s).ps.gz (88.1К)
    7. Moenck. Fast computation of GCDs using Schoenhage (ACM1973)(T)(10s).djvu (129.8К)
    8. Pottier. Euclidean algorithm in dimension n (ISSAC96)(T)(3s).djvu (71.0К)
    9. Sorenson. Analysis of Lehmer#s GCD algorithm. ISSAC95(T)(5s).djvu (129.2К)
    10. Weber. Accelerated integer GCD. TOMS 1995(T)(12s).djvu (174.3К)
    11. Yap. integer and polynomial HGCD algorithms(23s).ps.gz (106.1К)
  25. Galway. Implementation of the Lagarias-Odlyzko algorithm for pi(x)(21s).ps.gz (97.9К)
  26. Goldberg D. What every computer scientist should know about floating-point arithmetic (ACM, 1991)(600dpi)(T)(94s).djvu (617.3К)
  27. Goldberg D. What every computer scientist should know about floating-point arithmetic (ACM, 1991)(94s).pdf (716.2К)
  28. Goldberg D. What every computer scientist should know about floating-point arithmetic (ACM, 1991)(T)(94s).djvu (615.4К)
  29. Gourdon et al. Acceleration of series convergence(16s).ps.gz (182.9К)
  30. Grad, Brebner. Eigenvectors and eigenvalues of real general matrix(T)(12s).djvu (466.5К)
  31. Graphical Simulation
    1. Breinholt, Schierz. Algorithm 781. Generating Hilbert#s space-filling curve by recursion (TOMS1998)(6s).pdf (96.7К)
    2. Dobashi et al. Method for animation of clouds(T)(C)(10s).djvu (230.4К)
    3. Foster, Fedkiw. Graphical simulation of fluid flows(T)(C)(8s).djvu (187.8К)
    4. Fournier. Simple model of ocean waves(T)(C)(10s).djvu (945.4К)
    5. Kass et al. Rapid computer graphics simulation of fluid dynamics(T)(C)(9s).djvu (948.2К)
    6. McIlroy. Best approximate circles on integer grids (ACM 1983)(T)(27s).djvu (274.1К)
    7. Sclaroff S., Pentland A. Generalized implicit functions for computer graphics (Comp.Graphics 25, p247, 1991)(T)(4s).djvu (288.1К)
    8. Stephenson. Digitized line and number theory (phd thesis)(247s).ps.gz (451.4К)
    9. Viennot, Eyrolles, Janey, Arqus. Combinatorial analysis of ramified patterns and computer imagery of trees (Comp.Graph. 1989)(T)(10s).djvu (361.1К)
  32. HAKMEM (selections) (html).zip (52.3К)
  33. Horowitz. Finite fields and modular arithmetic, tutorial(T)(7s).djvu (102.8К)
  34. Howell. Computation of conformal maps with Schwarz-Christoffel 1990 (Ph.D. thesis)(125s).ps.gz (635.3К)
  35. Huang, Pan. Fast parallel matrix multiplication 1997(T)(13s).djvu (295.0К)
  36. Huang, Pan. Fast rectangular matrix multiplication 1998(T)(43s).djvu (233.5К)
  37. Hueper. Calculus approach to matrix eigenvalue algorithms (habil.Diss. Wuerzburg, 2002)(81s).pdf (368.7К)
  38. Hypergeometric function
    1. Abad. Computation of Hypergeometric 1F1(3s).pdf (73.7К)
    2. Becken, Schmelcher. Gaussian hypergeometric function 2F1 for arbitrary parameters (JCAM 2000)(T)(30s).djvu (240.4К)
    3. Gautschi. Hypergeometric function calculations(19s).ps.gz (99.3К)
    4. Temme. Hypergeometric function with large parameters(T)(23s).djvu (119.5К)
    5. Thorsley, Chidichimo. Asymptotic expansion for hypergeometric function 2F1(a,b,c,x) (JMathPhys.2001)(10s).ps.gz (77.5К)
  39. Image recognition
    1. Arias-Castro, Donoho, Huo. Near-optimal detection of geometric objects by fast multiscale methods (2003)(T)(47s).djvu (441.2К)
    2. Caprari R.S. Algorithm for text page up-down orientation detection (Patt.Recogn.Lett. 21, p311, 2000)(7s).pdf (157.1К)
    3. Cinque, Lombardi, Manzini. Multiresolution approach for page segmentation (Patt.Recogn.Lett.19, p217, 1998)(9s).pdf (587.7К)
    4. Donoho, Flesia. Digital ridgelet transform based on true ridge functions (2001)(T)(C)(33s).djvu (446.6К)
    5. Donoho, Huo. Beamlets and multiscale image processing (2001)(T)(48s).djvu (548.4К)
    6. Hamamoto et al. Gabor filter based method for recognizing handprinted numbers(T)(6s).djvu (118.2К)
    7. Hel-Or, Hel-Or. Real time pattern matching using projection kernels (draft, 2003)(T)(27s).djvu (346.4К)
    8. Howard et al. The emerging JBIG2 standard(T)(27s).djvu (430.9К)
    9. Kapoor, Bagai, Kamal. New algorithm for skew detection and correction (Patt.Recogn.Lett.25, p1215, 2004)(15s).pdf (544.9К)
    10. Tompkins, Kossentini. Fast segmentation algorithm for bi-level image compression using JBIG2(T)(5s).djvu (131.0К)
    11. Toutin T. Geometric processing of remote sensing images.. models, algorithms and methods (review)(Int.J.Remote sensing, 2004)(T)(32s).djvu (411.8К)
    12. Ye, Cossman. Fast and memory-efficient JBIG2 encoder (ICASSP 2001)(4s).pdf (42.8К)
  40. Integer factoring
    1. Adleman. Factoring using singular integers(T)(8s).djvu (109.0К)
    2. Bernstein. Factoring into comprimes in linear time(23s).ps.gz (159.3К)
    3. Bernstein. How to find small factors of integers(14s).ps.gz (120.0К)
    4. Boender, te Riele. Factoring integers with large primes using MPQS(17s).ps.gz (352.8К)
    5. Boneh98 Generating crypto product of 3 primes(15s).ps.gz (84.1К)
    6. Brent. Elliptic curve factoring(15s).ps.gz (90.3К)
    7. Brent. Number field sieve(20s).ps.gz (145.4К)
    8. Brent. Recent progress and prospects for integer factoring(18s).ps.gz (104.6К)
    9. Buchmann et al. Implementation of the general number field sieve(7s).ps.gz (37.6К)
    10. Buchmann, Mueller. Algorithms for factoring integers (book)(70s).ps.gz (172.2К)
    11. Couveignes. Computing a square root for the number field sieve(8s).ps.gz (37.4К)
    12. Crandall. Parallelization of Pollard-rho factorization(14s).ps.gz (51.6К)
    13. Huizing. Number field sieve factorization(26s).ps.gz (199.0К)
    14. Lenstra, Lenstra, Manasse, Pollard. The number field sieve (T)(9s).djvu (130.0К)
    15. Mathworld. Dixon#s integer factorization(3s).ps.gz (67.5К)
    16. Mihailescu. Cyclotomy of rings and primality testing (phd thesis)(186s).ps.gz (509.9К)
    17. Montgomery. Block Lanczos algorithm for GF(2) linear algebra(16s).ps.gz (86.8К)
    18. Montgomery. ECM Factoring and FFT. UCLA dissertation(118s).ps.gz (240.8К)
    19. Murphy, Brent. Quadratic polynomials for the number field sieve(20s).ps.gz (145.4К)
    20. Nakamula. Survey of the number field sieve(10s).ps.gz (82.4К)
    21. Pomerance, Smith. Reduction of sparse matrices over finite fields (for sieve)(6s).ps.gz (232.1К)
    22. Pomerance. A tale of two sieves (Notices AMS, 1997)(13s).pdf (275.0К)
  41. Interval arithmetic
    1. Fateman. Honest plotting using interval arithmetic(8s).ps.gz (69.4К)
    2. Hickey et al. Interval constraint plotting of implicitly defined relations(12s).ps.gz (136.7К)
    3. Kearfott. Algorithm 763. Fortran 90 module for interval arithmetic (TOMS1996)(T)(8s).djvu (70.7К)
    4. Kearfott. Introduction to interval computations(23s).ps.gz (63.8К)
    5. Popova et al. Simplification of interval expressions(T)(8s).djvu (126.4К)
    6. Snyder. Interval analysis for graphics(T)(10s).djvu (478.7К)
  42. Kaltofen. Computing determinants without divisions(T)(8s).djvu (175.3К)
  43. Kislenkov et al. Computing products via chains of recurrences 1999(T)(8s).djvu (311.3К)
  44. Mathematica 4.1 - some implementation details (html).zip (22.0К)
  45. Miller. Checking function ranges by differences(T)(10s).djvu (98.8К)
  46. Misc. special funcs
    1. Adamchik. Multiple Gamma function and computation of series (2000)(20s).pdf (224.3К)
    2. Alhargan. Algorithm 804. Mathieu function of integer order (TOMS2000)(7s).pdf (87.2К)
    3. Alhargan. Computation of Mathieu functions of integer order (TOMS2000)(T)(18s).djvu (100.0К)
    4. Almkvist, Wilf. Coefficient in the HRR formula for partition function(5s).ps.gz (28.4К)
    5. Brent. Computation of Euler#s constant (erratum).txt.gz (170.0Б)
    6. Brent. Computation of Euler#s constant(T)(8s).djvu (76.0К)
    7. Brent. Ramanujan#s constant.dvi.gz (10.6К)
    8. Cody. Funpack - Package of special functions(T)(13s).djvu (202.6К)
    9. Cody. Run-time determination of floating-point machine parameters(T)(9s).djvu (111.5К)
    10. Dunkl, Ramirez. Hyperelliptic integrals, algorithm(T)(14s).djvu (157.4К)
    11. Dunkl, Ramirez. Hyperelliptic integrals, implementation(T)(9s).djvu (87.0К)
    12. Eckhardt. Rational aproximation to Weierstrass P function (MC 1976)(T)(10s).djvu (78.0К)
    13. Fateman. Evaluating polynomials(T)(15s).djvu (112.6К)
    14. Fee. Computation of Catalan#s constant using Ramanujan#s identity (ACM 1990)(T)(4s).djvu (92.4К)
    15. Fritsch, Shafer, Crowley. Algorithm 443. Lambert W function (CACM 1973)(T)(2s).djvu (57.1К)
    16. Garoni, Frankel, Glasser. Complete asymptotic expansion of the Fermi-Dirac integral (JmathPhys.2001)(9s).ps.gz (69.7К)
    17. Gil et al. Algorithm 822. Complex Scorer functions (TOMS2002)(T)(12s).djvu (119.7К)
    18. Lagarias et al. Meissel-Lehmer method of computing pi(x)(47s).pdf (101.0К)
    19. Lifchitz. Quick computation of pi(x) mod 2(4s).ps.gz (35.1К)
    20. Macleod. Algorithm 779. Fermi-Dirac functions of orders half to 5 halves (TOMS1998)(T)(12s).djvu (81.5К)
    21. Montgomery. Evaluating Lucas recurrences(20s).ps.gz (81.7К)
    22. Olver. Numerical evaluation of special functions, index of software(48s).pdf (374.9К)
    23. Temme N.M. Asymptotic estimates of Stirling numbers (Stud.Appl.Math.89, p233, 1993)(T)(11s).djvu (78.3К)
    24. Wegstein. Algorithm 165. Complete elliptic integral(T)(2s).djvu (63.8К)
    25. Wood D.C. Computation of polylogarithms (U.Kent tech.rep. 15-92, 1992)(19s).ps.gz (72.7К)
    26. Wood D.C. Computation of polylogarithms (U.Kent tech.rep. 15-92, 1992)(T)(19s).djvu (149.3К)
    27. pi_of_x (explanation of the method).txt.gz (6.3К)
  47. Moffat et al. Improved implementation of arithmetic coding(39s).pdf (487.3К)
  48. Mohlenkamp. Fast spherical harmonic transform 1998(27s).ps.gz (204.6К)
  49. Mrozec. Error analysis of numerical algorithms via symbolic. JSC 1996(T)(24s).djvu (158.7К)
  50. Multiple precision
    1. Bailey et al. Khinchine constant(19s).ps.gz (59.0К)
    2. Bailey. Compendium of BBP-type formulae 2000(19s).ps.gz (132.7К)
    3. Bernstein. Applications of fast multiplication. 2003(45s).ps.gz (234.8К)
    4. Bernstein. Fast multiplication for mathematicians(19s).ps.gz (141.3К)
    5. Borwein P. Pi and the AGM (Chapter 10 only.. approximations to elementary functions)(T)(22s).djvu (200.6К)
    6. Borwein P.. On the rapid computation of various polylogarithmic constants(14s).ps.gz (55.4К)
    7. Borwein P.. Ramanujan, modular equations, and approximations to Pi(40s).ps.gz (130.0К)
    8. Borwein P.. Some observations on computer-aided analysis(7s).ps.gz (39.2К)
    9. Borwein P.. The quest for Pi(16s).ps.gz (69.0К)
    10. Brent Multiple Precision Package (Fortran).f.gz (357.3К)
    11. Brent. A Fortran MP Arithmetic Package(T)(14s).djvu (216.5К)
    12. Brent. AUGMENT interface to MP arithmetic package(T)(4s).djvu (53.6К)
    13. Brent. Complexity of multiple-precision arithmetic(30s).ps.gz (124.4К)
    14. Brent. Fast evaluation of elementary functions(T)(10s).djvu (190.3К)
    15. Brent. Multiple-precision zero-finding methods(18s).ps.gz (94.0К)
    16. Brent. Parallel evaluation of arithmetic expressions(T)(6s).djvu (118.7К)
    17. Brent. Unrestricted precision algorithms for elem. functions(13s).ps.gz (74.1К)
    18. Burger. Fast and accurate printing of floating-point(T)(9s).djvu (219.3К)
    19. Burnikel, Ziegler. Fast recursive division(33s).ps.gz (206.7К)
    20. CLN library documentation(59s).ps.gz (119.9К)
    21. Clenshaw, Olver. Beyond floating point(T)(10s).djvu (285.2К)
    22. Clinger. Reading floating-point numbers accurately(T)(10s).djvu (311.2К)
    23. Collins. Addition of multiple precision floating point numbers(T)(7s).djvu (143.3К)
    24. Exact real arithmetic in Mma (project)(T)(44s).djvu (246.8К)
    25. FFT multiplication of arbitrary precision numbers(6s).ps.gz (43.6К)
    26. Fateman. Floating point calculations (tex).zip (47.5К)
    27. Fateman. Multiprecision arithmetic in Macsyma(T)(7s).djvu (123.4К)
    28. Gourdon et al. Representation of arbitrary precision numbers(5s).ps.gz (38.8К)
    29. Gourdon et al. Splitting algorithms(5s).ps.gz (42.5К)
    30. Haible, Papanicolaou. Evaluation of series of rational numbers (LNCS)(T)(13s).djvu (82.9К)
    31. Haible, Papanikolaou. Fast multiprecision evaluation of series of rationals(15s).ps.gz (96.8К)
    32. Hare. Multisectioning rational poly-exponential functions (master#s thesis)(173s).pdf (740.8К)
    33. Hauser. Handling floating exceptions(36s).pdf (350.7К)
    34. Hauser. Handling floating exceptions(T)(36s).djvu (296.4К)
    35. Hehner. New p-adic representation for rationals(12s).pdf (35.2К)
    36. High order algorithms for square root and inverse(10s).ps.gz (14.9К)
    37. Hull et al. Double-precision evaluation of complex arcsin and arccos(T)(37s).djvu (256.1К)
    38. Hull et al. Double-precision evaluations of complex elementary functions(T)(30s).djvu (369.0К)
    39. Hull. Determining machine parameters (FORTRAN77).f.gz (3.3К)
    40. Jebelean T. Systolic multiprecision arithmetic algorithms (phd thesis)(245s).ps.gz (460.7К)
    41. Jebelean. Algorithm for exact division(14s).ps.gz (60.4К)
    42. Jebelean. Karatsuba integer division(T)(3s).djvu (87.2К)
    43. Johnson. Efficient 32-bit sqrt (assembler)(ACM TOMS 13).as.gz (3.1К)
    44. Johnson. Efficient integer and floating sqrt(T)(14s).djvu (125.7К)
    45. Karp. Tricks for high-precision sqrt(29s).pdf (249.1К)
    46. Krandick, Jebelean. Bidirectional exact integer division(10s).ps.gz (67.3К)
    47. Monte-Carlo Arithmetic 1997(18s).ps.gz (114.4К)
    48. Montgomery. Square roots of algebraic numbers(24s).ps.gz (121.5К)
    49. Multiple precision arithmetic (Fortran 90).sh.gz (218.6К)
    50. Ouchi. Exact computations with real expressions (masters thesis)(71s).ps.gz (240.7К)
    51. Ouchi. Exact computations with real expressions (masters thesis)(T)(71s).djvu (368.2К)
    52. Pi - Iterative algorithms(10s).ps.gz (13.2К)
    53. Pi and the AGM sequence - Intro(7s).ps.gz (12.2К)
    54. Priest D. Algorithms for MP floating-point arithmetic(25s).ps.gz (74.2К)
    55. Smith#s Multiple Precision Package (Fortran).f.gz (52.6К)
    56. Smith, Olver. Extended arithmetic and normalized Legendre polynomials(T)(13s).djvu (172.5К)
    57. Smith. Arbitrary precision package(T)(8s).djvu (70.3К)
    58. Smith. Efficient evaluation of elementary functions((MComp89)(T)(4s).djvu (29.4К)
    59. Smith. Multiple-precision optimized O(N^2) division(T)(7s).djvu (49.0К)
    60. Steele. Printing floating-point numbers(T)(15s).djvu (349.5К)
    61. Yap. Practical fast multiplication(3s).ps.gz (60.8К)
    62. ZMLIB. Fortran multiple precision library (complex algorithms)((ZMLIB.tex)(T)(9s).djvu (55.9К)
    63. Zimmermann. Arithmetique en precision arbitraire (fr) (RR-4272)(25s).ps.gz (194.9К)
    64. Zimmermann. Efficient arithmetic algorithms(4s).ps.gz (71.8К)
    65. Zimmermann. Karatsuba Square Root(11s).ps.gz (111.2К)
    66. Zimmermann. Proof of GMP Division and Sqrt(14s).ps.gz (71.3К)
    67. Ziv. Fast evaluation of elementary functions with correct rounding(T)(14s).djvu (180.9К)
  51. Orthogonal polynomials
    1. Algorithm 726 (Fortran).f.gz (102.8К)
    2. Askey-Wilson scheme - rec2ortho.maple.gz (3.2К)
    3. Askey-Wilson scheme - rec2ortho.maple.ws.gz (3.2К)
    4. Askey-Wilson scheme - rec2ortho.maplehelp.gz (2.6К)
    5. Askey-Wilson scheme for orthogonal polynomials(170s).ps.gz (431.0К)
    6. Gautschi. Algorithm 726, orthogonal polynomials and Gauss-type quadratures(T)(42s).djvu (487.9К)
    7. Gil, Segura. Zeros of orthogonal polynomials and special functions. JSC2003(21s).pdf (194.0К)
    8. Lopez, Temme. Convergent asymptotic expansions of Charlier, Laguerre and Jacobi polynomials (2003, MAS-E0320)(T)(23s).djvu (147.3К)
    9. Temme, Lopez. Askey scheme for asymptotics of orthogonal polynomials (2000, MAS-R0005)(T)(14s).djvu (74.8К)
  52. PLSQ
    1. Bailey, Broadhurst. Parallel PSLQ algorithm 1999(19s).ps.gz (71.6К)
    2. Bailey. Integer relation detection with PSLQ(8s).ps.gz (42.5К)
    3. Borwein, Lisonek. Applications of LLL and PLSQ methods(22s).ps.gz (102.0К)
    4. Ferguson, Bailey. PSLQ algorithm 1991(14s).ps.gz (47.9К)
    5. Ferguson, Bailty, Arno. Analysis of PSLQ algorithm(26s).ps.gz (81.2К)
    6. Kannan. Improved LLL algorithms (1983)(T)(14s).djvu (227.3К)
  53. Plotting
    1. Akima. Algorithm 760. Rectangular grid surface fitting (TOMS1996)(T)(5s).djvu (39.7К)
    2. Akima. Algorithm 761. Scattered data surface fitting (TOMS1996)(T)(10s).djvu (66.5К)
    3. Bajaj, Xu. Splines for visual real algebraic surfaces. JSC 1997(T)(19s).djvu (189.2К)
    4. Peters. Algorithm 783. Pcp2Nurb - smooth surfacing with bicubic B-splines (TOMS1998)(T)(C)(7s).djvu (132.7К)
    5. Renka, Brown. Algorithm 791. Cosine Shepard method for bivariate interpolation (TOMS1999)(4s).pdf (50.9К)
    6. Renka, Brown. Algorithm 792. Accuracy test of bivariate interpolation (TOMS1999)(T)(17s).djvu (349.6К)
    7. Renka. Algorithm 790. Cubic Shepard method for bivariate interpolation of scattered data (TOMS1999)(4s).pdf (47.5К)
    8. Rieger. View graphs of algebraic surfaces. JSC 1993(T)(14s).djvu (349.4К)
    9. Tupper. Reliable graphing methods for boolean functions of 2 variables(T)(10s).djvu (214.5К)
    10. Winkler et al. Parallel symbolic-numeric algebraic curve plotting(14s).ps.gz (132.3К)
  54. Polynomial roots
    1. Akritas. Method for polynomial root isolation(T)(5s).djvu (146.1К)
    2. Akritas. There is no Uspensky method(T)(3s).djvu (54.7К)
    3. Bocher M. Roots of polynomials that satisfy diff. equations of second order (Bull.AMS 4, p256, 1898)(600dpi)(T)(3s).djvu (58.2К)
    4. Collins, Akritas. Polynomial real root isolation using Descartes rule (ACMSAC76)(T)(4s).djvu (77.8К)
    5. Collins, Johnson. Quantifier elimination, sign variation, root isolation. ISSAC89(T)(8s).djvu (285.7К)
    6. Gourdon X. Combinatoire, algorithmique et geometries des polynomes (phd thesis, 1996)(600dpi)(fr)(T)(O)(237s).djvu (1.5М)
    7. Heindel. Integer arithmetic algorithms for polynomial zero determination(T)(16s).djvu (222.3К)
    8. Hribernig, Stetter. Detection and validation of clusters of polynomial zeros (JSC 1997)(T)(15s).djvu (112.7К)
    9. Hull, Mathon. Prototype of polynomial rootfinder with (not really) quadratic convergence (TOMS1996)(T)(20s).djvu (146.2К)
    10. Iliev A.I. Generalization of Obreshkoff#s method for multiple roots of polynomials (arxiv math_0104239, 2001)(4s).pdf (35.7К)
    11. Jenkins, Traub. Algorithm 419.. Zeros of a complex polynomial (CACM 1972)(T)(3s).djvu (141.8К)
    12. Jenkins, Traub. Zeros of complex polynomials(T)(3s).djvu (118.2К)
    13. Jenkins, Traub. Zeros of complex polynomials.Fortran.gz (21.6К)
    14. Jenkins. Zeros of a real polynomial(T)(12s).djvu (124.4К)
    15. Johnson, Crandick. Isolation of real polynomial roots using numerics(T)(8s).djvu (252.2К)
    16. Mekwi W.R. Iterative methods for roots of polynomials (master thesis, Oxford, 2001)(68s).pdf (514.3К)
    17. Mourrain B., Pavone J.-P. Subdivision methods for solving polynomial equations (INRIA report 5658, 2005)(23s).pdf (389.4К)
    18. Nonweiler T. Algorithm 326.. low-order polynomial roots (CACM)(T)(2s).djvu (23.9К)
    19. Pan V. Algorithm for approximating complex polynomial zeros (1998)(600dpi)(T)(4s).djvu (48.3К)
    20. Pan V. Univariate polynomials.. nearly optimal numerical factorization and roots (JSC, 2002)(33s).pdf (358.7К)
    21. Pan. Factorization, rootfinding of univariate polynomials. ISSAC01(T)(15s).djvu (706.3К)
    22. Pan. Review of polynomial equation solving. SIAM 1997 (34s).ps.gz (331.1К)
    23. Pinkert. Exact method for complex roots of polynomials(T)(13s).djvu (192.2К)
    24. Schweikard. Real zeros of trigonometric polynomials(T)(10s).djvu (153.4К)
    25. Spencer M. Polynomial real root finding in Bernstein form (phd thesis)(196s).pdf (1.1М)
    26. Wilf. Zeros of complex polynomials by bisection(T)(6s).djvu (90.7К)
    27. Yang. Determining the number of real roots of parametric polynomials (JSC1999)(T)(18s).djvu (119.0К)
    28. Yap. Polynomial-root bounds for exact geometric computation(10s).ps.gz (149.0К)
    29. uspensky_alrogithm_real_roots_integer_poly.c.gz (2.5К)
  55. Prime numbers
    1. Agrawal, Kayal, Saxena. A polynomial-time primality test(9s).ps.gz (72.6К)
    2. Agrawal, Kayal, Saxena. A polynomial-time primality test(T)(9s).djvu (75.8К)
    3. Arnault. Composites which pass Rabin-Miller test (MC 1995)(T)(8s).djvu (73.7К)
    4. Bernstein. Detecting perfect powers in almost linear time(31s).ps.gz (110.8К)
    5. Bernstein. Multiple-lattice number field sieve(5s).ps.gz (67.8К)
    6. Berrizbeitia, Berry. Generalized strong pseudoprime tests and applications (JSC 2000)(10s).pdf (197.0К)
    7. Berrizbeitia. Generalized strong prime tests. JSC 2000(10s).pdf (276.8К)
    8. Damgard 2001. Extended quadratic Frobenius primality test(46s).ps.gz (223.5К)
    9. Davenport. Primality testing revisited(T)(7s).djvu (150.5К)
    10. Elementary number theory and primality tests (textbook)(117s).pdf (475.7К)
    11. Goldwasser. Testing primality using elliptic curves(T)(23s).djvu (202.3К)
    12. Grantham. A probable prime test with high confidence(13s).ps.gz (92.0К)
    13. Grantham. Frobenius Pseudoprimes(19s).ps.gz (105.0К)
    14. Kayal, Saxena. Towards a polynomial-time primality test(20s).ps.gz (96.7К)
    15. Mckay. Finding complex prime numbers(T)(8s).djvu (195.8К)
    16. Pinch. Primality testing(12s).ps.gz (53.9К)
    17. lecture10 - Miller-Rabin test, 1(6s).ps.gz (29.9К)
    18. lecture11 - Miller-Rabin test, 2(4s).ps.gz (21.3К)
  56. Quadratures
    1. Alpert. Hybrid Gauss-trapezoidal quadrature(T)(34s).djvu (215.4К)
    2. Ammar, Benner, Mehrmann. Multishift algorithm for numerical solution of algebraic Riccati equations (ETNA 1, 1993)(T)(16s).djvu (117.6К)
    3. Bailey and Li. Comparison of high-precision quadrature schemes 2002(10s).ps.gz (41.9К)
    4. Bailey et al. Algorithm 810. SLEOGN2 Sturm-Liouville code (TOMS2001)(50s).pdf (289.4К)
    5. Bailey. New algorithms for numerical Sturm-Liouville problem.f.gz (164.9К)
    6. Computation of Gauss-Kronrod quadrature rules(13s).pdf (109.2К)
    7. Gautschi. Adaptive quadratures overview(23s).ps.gz (74.5К)
    8. Gautschi. Algorithm 793. GQRAT, Gauss quadrature for rational functions (TOMS1999)(27s).pdf (187.2К)
    9. Geddes. Techniques for numerical integration in CAS(T)(7s).djvu (186.2К)
    10. Keeman, algorithm 182, nonrecursive adaptive integration(T)(6s).djvu (185.0К)
    11. Miller. Numerical quadrature in n dimensions - 2(T)(10s).djvu (127.3К)
    12. Miller. Numerical quadrature in n dimensions - 3(T)(10s).djvu (84.9К)
    13. Miller. Numerical quadrature in n dimensions(T)(9s).djvu (120.0К)
    14. Simos. 8thorder method for Schroedinger equation. CPC2000(39s).pdf (890.9К)
  57. RNGs
    1. Aiello et al. Design of practical RNGs(T)(9s).djvu (228.9К)
    2. Brent. Normal RNGs.. Wallace#s method.dvi.gz (17.7К)
    3. Brent. Normal RNGs.. other methods.dvi.gz (18.0К)
    4. Brent. Normally distributed RNGs.dvi.gz (32.7К)
    5. Brent. RNGs on parallel computers(20s).ps.gz (89.7К)
    6. Brent. Uniform RNGs.dvi.gz (32.5К)
    7. Compagner. Fast and reliable RNGs(T)(5s).djvu (129.1К)
    8. Ecuyer. Uniform RNGs, overview(8s).pdf (102.0К)
    9. Mascagni, Srinivasan. Algorithm 806. SPRNG, scalable pseudorandom number library (TOMS2001)(26s).pdf (155.7К)
    10. Mersenne twister RNG materials (pdf,txt,C++).zip (376.0К)
    11. Weingartner. Nonlinear RNGs (thesis)(79s).ps.gz (352.1К)
  58. RNGs software
    1. Matsumoto, Nishimura. Mersenne twister.. a 623-dimensionally equidistributed uniform pseudorandom number generator (1998)(25s).ps.gz (118.1К)
    2. Singleton. algorithm 356. Prime number generator using treesort(T)(5s).djvu (229.5К)
    3. prng-3.0.tar.gz (407.4К)
    4. rng_mcqmc00(T)(12s).djvu (77.3К)
    5. rng_streams00l(T)(30s).djvu (147.1К)
    6. rng_wsc01rng(T)(11s).djvu (127.4К)
  59. Rational approximation
    1. Beckermann, Labahn. Matrix Hermite-Pade approximations(30s).ps.gz (114.2К)
    2. Beckermann. Fraction-free computation of matrix rational interpolants(39s).ps.gz (126.0К)
    3. Borwein, Cuyt, Zhou. Explicit construction of multivariate Pade approximants to an Appell function (Adv.Comp.Math.22, p249, 2005)(25s).pdf (188.2К)
    4. Bultheel et al. Monotonicity of multi-point Pade approximations(12s).ps.gz (49.9К)
    5. Cabay, Jones, Labahn. Algorithm 766. Computing Pade-Hermite approximants (TOMS1997)(T)(20s).djvu (140.4К)
    6. Cabay, Jones, Labahn. Algorithm for multi-dimensional Pade systems 1994(55s).ps.gz (164.4К)
    7. Cabay, Labahn. Fast calculation of Pade-Hermite (polynomial-rational) approximations(T)(6s).djvu (171.1К)
    8. Chaffy. Multivariate Pade approximants(T)(3s).djvu (92.1К)
    9. Cody, Rahlston. Computing rational approximation to exponential functions(T)(3s).djvu (128.0К)
    10. Cuyt. Concepts in multivariate Pade approximants(20s).ps.gz (92.5К)
    11. Cuyt. Recursive computation of multivariate rational interpolants(T)(12s).djvu (154.4К)
    12. Dunham. Convergence of rational approximations of Maehly(T)(6s).djvu (191.1К)
    13. Dunham. Convergence problems in Maehly#s 2nd method(T)(6s).djvu (123.1К)
    14. Fraser, Hart. Rational approximations for continuous functions(T)(4s).djvu (103.7К)
    15. Geddes. Symbolic computation of Pade approximants(T)(16s).djvu (209.2К)
    16. Golub, Smith. Second Remez algorithm for Chebyshev approximation on intervals(T)(10s).djvu (244.5К)
    17. Hochbruck. The Pade table and some numerical algorithms (dr thesis)(163s).ps.gz (389.0К)
    18. Horowitz. Algorithms for rational function arithmetic(T)(11s).djvu (102.3К)
    19. Kirrinnis. Fast computation of numerical partial fractions, contour integrals. ISSAC92(T)(11s).djvu (277.0К)
    20. Maehly. Fitting of rational approximations II, III(T)(21s).djvu (732.5К)
    21. Maehly. Fitting of rational approximations, I(T)(13s).djvu (150.4К)
    22. Ralston. Economization of series by rational functions(5s).pdf (172.0К)
    23. Singer et al. Complexity of sparse rational interpolation 1994(19s).ps.gz (70.6К)
    24. Spielberg. Representation of power series in continued fractions(T)(15s).djvu (360.1К)
    25. Stoer. Direct Chebyshev approximations by rational functions(T)(11s).djvu (352.1К)
    26. Verde-Star L. Interpolation and combinatorial functions (Stud.Appl.Math.79,p65,1988)(T)(28s).djvu (184.8К)
    27. Verde-Star L. Polynomial sequences of interpolatory type (Stud.Appl.Math.88, p153, 1993)(T)(20s).djvu (131.5К)
    28. Willers. Integration of ODE using continued fractions(T)(5s).djvu (108.1К)
  60. Roberts et al. Perturbation technique for nonlinear two-point boundary value problems (SIAM JNA 1969)(T)(13s).djvu (114.3К)
  61. Root finding
    1. Alefeld et al. Algorithm 748, enclosing zeros of functions(T)(18s).djvu (228.8К)
    2. Bauer, Stoer. Algorithm 105.. Newton Maehly(T)(7s).djvu (225.5К)
    3. Brent et al. Optimal iterative rootfinding rpb016i(T)(16s).djvu (272.4К)
    4. Brent. High-order root finding methods(T)(29s).djvu (222.9К)
    5. Brent. Optimal iterative rootfinding (gif)(T)(16s).djvu (144.5К)
    6. Brent. Solving systems of nonlinear equations(T)(18s).djvu (155.7К)
    7. Brent. rpb026i High-order zero-finding with orthogonal polynomials(T)(29s).djvu (470.1К)
    8. Brent. rpb027 High-order zero-finding with many evaluations of derivatives (L)(T)(8s).djvu (75.4К)
    9. Drakopoulos et al. Computation of Schroeder iteration functions (SIAM J.Num.Anal.36, p417, 1999)(600dpi)(T)(19s).djvu (825.4К)
    10. King et al. Starting value for Newton#s method for sqrt(T)(2s).djvu (117.3К)
    11. Le. Root finding without derivatives(T)(13s).djvu (137.4К)
    12. More. Numerical solutions of nonlinear equations(T)(22s).djvu (286.1К)
    13. Potra, Shi. Remark on Brent#s rootfinding method 1995(12s).ps.gz (45.7К)
    14. Sebah, Gourdon. Newton#s method and high order generalizations (2001)(10s).ps.gz (161.4К)
    15. Sonnenschein. Minimierung programmierbarer Funktionen (disser)(de)(130s).ps.gz (315.1К)
  62. Sagan. Why the characteristic polynomial factors(31s).pdf (262.6К)
  63. Shepard. Two-dimensional interpolation for irregularly spaced data(T)(8s).djvu (163.4К)
  64. Temme N.M. Collected works.rar (76.2М)
  65. Templates for the solution of linear systems (netlib)(141s).ps.gz (265.8К)
  66. Tsai, Farouki. Algorithm 812. BPOLY, numerical library for polynomials in Bernstein form (TOMS2001)(30s).pdf (185.4К)
  67. Tsai, Farouki. Library for polynomials in Bernstein form(32s).ps.gz (144.4К)
  68. Tung. Bounds on the difference between the arithmetic and geometric means (MC 1975)(T)(4s).djvu (32.6К)
  69. Vasilyev S.N. Interpolation by fractal functions preserving monotonicity and convexity (East J.Approx. 3, p381, 1997)(600dpi)(T)(12s).djvu (215.6К)
  70. W function
    1. Algorithm 743 (Fortran).f.gz (22.4К)
    2. Barry et al. Algorithm 743, real W function(T)(10s).djvu (115.7К)
    3. Barry et al. Real values of W function(T)(11s).djvu (121.9К)
  71. Wigner symbol
    1. Fritzsche. Maple procedures for Wigner symbols (ps).zip (517.0К)
    2. Schulten, Gordon. Exact evaluation of 3j, 6j coeffs (1976)(T)(10s).djvu (495.9К)
    3. Schulten, Gordon. Recursive evaluation of 3j, 6j coeffs (1976)(T)(10s).djvu (216.0К)
    4. Schulten, Gordon. Semiclassical approximation to 3j, 6j coeffs (1975)(T)(18s).djvu (512.8К)
  72. Zeta function
    1. Almkvist, Granville. Borwein#s formulae for zeta(4n+3) (T)(7s).djvu (66.7К)
    2. Bailey, Bowman. Multiple zeta evaluations(21s).ps.gz (104.6К)
    3. Borwein P. An efficient algorithm for the Riemann Zeta function (1995)(9s).ps.gz (43.4К)
    4. Borwein et al. Combinatorial aspects of multiple zeta 1998(12s).ps.gz (79.2К)
    5. Borwein et al. Special values of multiple polylogarithms(35s).ps.gz (171.0К)
    6. Borwein, Bradley. Formulae for zeta(4n+3)(T)(14s).djvu (121.3К)
    7. Borwein, Girgensohn. Evaluation of triple Euler sums 1996(27s).ps.gz (83.8К)
    8. Borwein-Bradley-Crandall. Computational strategies for Riemann Zeta function(68s).ps.gz (184.4К)
    9. Bradley. Brief survey of multiple polylogarithms(22s).ps.gz (141.1К)
    10. Brent. rpb047 Zeros of the Riemann zeta function(T)(12s).djvu (118.5К)
    11. Broadhurst et al. Evaluation of k-fold Euler sums 1997(21s).ps.gz (67.8К)
    12. Crandall. Combinatorial approach to Feynman path integrals 1993(T)(22s).djvu (459.4К)
    13. Crandall. Fast evaluation of Epstein zeta functions(11s).ps.gz (48.4К)
    14. Crandall. Fast evaluation of multiple (generalized) zeta sums(10s).ps.gz (47.0К)
    15. Crandall. Quantum zeta function 1996(22s).ps.gz (90.2К)
    16. Cvijovic, Klinowski. Continued fraction for Riemann zeta function and polylogarithms (Proc. AMS 1997)(T)(9s).djvu (83.3К)
    17. Flajolet, Salvy. Euler sums, contour integrals 1998(T)(21s).djvu (196.7К)
    18. Flajolet, Vardi. Zeta function expansions of classical constants (INRIA preprint, 1996)(10s).ps.gz (34.8К)
    19. Flajolet. Zeta function expansions of constants(10s).ps.gz (34.8К)
    20. Gourdon, Sebah. Introduction to Bernoulli numbers(12s).ps.gz (63.8К)
    21. Kanemitsu et al. Zeta function at rational arguments(T)(9s).djvu (45.2К)
    22. Odlyzko, Schoenhage. Fast algorithms for multiple evaluations of the Riemann zeta function (25s).pdf (54.6К)
    23. Odlyzko, Schoenhage. Fast multiple evaluations of the Riemann zeta function (24s).ps.gz (46.5К)
    24. Spallone. Zeta function and Bernoulli numbers(3s).ps.gz (30.3К)
    25. Sun Z.-W. Tutorial introduction to Bernoulli and Euler polynomials(13s).ps.gz (80.5К)
  73. Zima E. Recurrent relations and speedup of computations (DISCO92)(L)(T)(5s).djvu (99.5К)
  74. Zima, Kislenkov. Multidimensional chains of recurrences(T)(8s).djvu (130.1К)
  75. Zima. Computational properties of chains of recurrences(T)(8s).djvu (360.7К)
  76. Zima. Simplification of chains of recurrences 1995(T)(9s).djvu (203.0К)
  77. drmath_stuff_on_computation.zip (32.1К)
Инструменты страницы

Инструменты пользователя