메뉴 건너뛰기




Volumn 37, Issue 3, 2010, Pages

Increasing the reliability of adaptive quadrature using explicit interpolants

Author keywords

Adaptive quadrature; Error estimation; Interpolation; Orthogonal polynomials

Indexed keywords

ADAPTIVE QUADRATURE; BATTERY TESTS; ERROR ESTIMATION; GAUTSCHI; INTEGRATION ERROR; INTERPOLANTS; ORTHOGONAL POLYNOMIAL;

EID: 77957578733     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1824801.1824804     Document Type: Article
Times cited : (29)

References (60)
  • 1
    • 0039298696 scopus 로고
    • New aspects in numerical quadrature
    • N. C. Metropolis, A. H. Taub, J. Todd, and C. B. Tompkins, Eds. American Mathematical Society, Providence, RI
    • BAUER, F. L., RUTISHAUSER, H., AND STIEFEL, E. 1963. New aspects in numerical quadrature. In Proceedings of the Experimental Arithmetic, High Speed Computing and Mathematics, N. C. Metropolis, A. H. Taub, J. Todd, and C. B. Tompkins, Eds. American Mathematical Society, Providence, RI, 199-217.
    • (1963) Proceedings of the Experimental Arithmetic, High Speed Computing and Mathematics , pp. 199-217
    • Bauer, F.L.1    Rutishauser, H.2    Stiefel, E.3
  • 2
    • 0026167254 scopus 로고
    • Error estimation in automatic quadrature routines
    • BERNTSEN, J. AND ESPELID, T. O. 1991. Error estimation in automatic quadrature routines. ACM Trans. Math. Softw. 17, 2, 233-252.
    • (1991) ACM Trans. Math. Softw. , vol.17 , Issue.2 , pp. 233-252
    • Berntsen, J.1    Espelid, T.O.2
  • 3
    • 84968468488 scopus 로고
    • Solution of Vandermonde systems of equations
    • BJÖ RCK, Å . AND PEREYRA, V. 1970. Solution of Vandermonde systems of equations. Math. Comput. 24, 112, 893-903.
    • (1970) Math. Comput. , vol.24 , Issue.112 , pp. 893-903
    • Björck, A.1    Pereyra, V.2
  • 4
    • 4544242004 scopus 로고
    • A comparison of some numerical integration programs
    • CASALETTO, J., PICKETT, M., AND RICE, J. 1969. A comparison of some numerical integration programs. SIGNUM Newslett. 4, 3, 30-40.
    • (1969) SIGNUM Newslett. , vol.4 , Issue.3 , pp. 30-40
    • Casaletto, J.1    Pickett, M.2    Rice, J.3
  • 5
    • 0000624238 scopus 로고
    • A method for numerical integration on an automatic computer
    • CLENSHAW, C. W. AND CURTIS, A. R. 1960. A method for numerical integration on an automatic computer. Numer. Math. 2, 197-205.
    • (1960) Numer. Math. , vol.2 , pp. 197-205
    • Clenshaw, C.W.1    Curtis, A.R.2
  • 7
    • 0006901548 scopus 로고
    • CADRE: An algorithm for numerical quadrature
    • J. R. Rice, Ed. Academic Press, New York
    • DE BOOR, C. 1971. CADRE: An algorithm for numerical quadrature. In Mathematical Software, J. R. Rice, Ed. Academic Press, New York, 201-209.
    • (1971) Mathematical Software , pp. 201-209
    • De Boor, C.1
  • 8
    • 0343785086 scopus 로고
    • An adaptive extrapolation algorithm for automatic integration
    • DE DONCKER, E. 1978. An adaptive extrapolation algorithm for automatic integration. SIGNUM Newsl. 13, 2, 12-18.
    • (1978) SIGNUM Newsl. , vol.13 , Issue.2 , pp. 12-18
    • De Doncker, E.1
  • 10
    • 34548742922 scopus 로고    scopus 로고
    • Algorithm 868: Globally doubly adaptive quadrature-ReliableMatlab codes
    • ESPELID, T. O. 2007. Algorithm 868: Globally doubly adaptive quadrature-ReliableMatlab codes. ACM Trans. Math. Softw. 33, 3, 21.
    • (2007) ACM Trans. Math. Softw. , vol.33 , Issue.3 , pp. 21
    • Espelid, T.O.1
  • 11
    • 0026166842 scopus 로고
    • Interpolatory integration formulas for optimal composition
    • FAVATI, P., LOTTI, G., AND ROMANI, F. 1991. Interpolatory integration formulas for optimal composition. ACM Trans. Math. Softw. 17, 2, 207-217.
    • (1991) ACM Trans. Math. Softw. , vol.17 , Issue.2 , pp. 207-217
    • Favati, P.1    Lotti, G.2    Romani, F.3
  • 14
    • 77957551710 scopus 로고
    • Algorithm 303: An adaptive quadrature procedure with random panel sizes
    • GALLAHER, L. J. 1967. Algorithm 303: An adaptive quadrature procedure with random panel sizes. Comm. ACM 10, 6, 373-374.
    • (1967) Comm. ACM , vol.10 , Issue.6 , pp. 373-374
    • Gallaher, L.J.1
  • 15
    • 0038397126 scopus 로고    scopus 로고
    • Adaptive quadrature-revisited
    • 306, Department of Computer Science, ETH Zurich, Switzerland
    • GANDER, W. AND GAUTSCHI, W. 1998. Adaptive quadrature-Revisited. Tech. rep. 306, Department of Computer Science, ETH Zurich, Switzerland.
    • (1998) Tech. Rep.
    • Gander, W.1    Gautschi, W.2
  • 16
    • 0037823843 scopus 로고    scopus 로고
    • Adaptive quadrature-Revisited
    • GANDER, W. AND GAUTSCHI, W. 2001. Adaptive quadrature-Revisited. BIT 40, 1, 84-101.
    • (2001) BIT , vol.40 , Issue.1 , pp. 84-101
    • Gander, W.1    Gautschi, W.2
  • 17
    • 0000082767 scopus 로고
    • Norm estimates for inverses of Vandermonde matrices
    • GAUTSCHI, W. 1975. Norm estimates for inverses of Vandermonde matrices. Numer. Math. 23, 337-347.
    • (1975) Numer. Math. , vol.23 , pp. 337-347
    • Gautschi, W.1
  • 19
    • 84976798302 scopus 로고
    • Implementing Clenshaw-Curtis quadrature, II computing the cosine transformation
    • GENTLEMAN, W. M. 1972. Implementing Clenshaw-Curtis quadrature, II computing the cosine transformation. Comm. ACM 15, 5, 343-346.
    • (1972) Comm. ACM , vol.15 , Issue.5 , pp. 343-346
    • Gentleman, W.M.1
  • 20
    • 0000223746 scopus 로고
    • Calculation of Gauss quadrature rules
    • GOLUB, G. H. AND WELSCH, J. H. 1969. Calculation of Gauss quadrature rules. Math. Comput. 23, 106, 221-230.
    • (1969) Math. Comput. , vol.23 , Issue.106 , pp. 221-230
    • Golub, G.H.1    Welsch, J.H.2
  • 23
    • 77957559902 scopus 로고
    • Contribution no. 2: Simpson numerical integration with variable length of step
    • HENRIKSSON, S. 1961. Contribution no. 2: Simpson numerical integration with variable length of step. BIT Numer. Math. 1, 290.
    • (1961) BIT Numer. Math. , vol.1 , pp. 290
    • Henriksson, S.1
  • 24
    • 0012063613 scopus 로고
    • Fast solution of Vandermonde-like systems involving orthogonal polynomials
    • HIGHAM, N. J. 1988. Fast solution of Vandermonde-like systems involving orthogonal polynomials. IMA J. Numer. Anal. 8, 473-486.
    • (1988) IMA J. Numer. Anal. , vol.8 , pp. 473-486
    • Higham, N.J.1
  • 25
    • 0001939091 scopus 로고
    • Stability analysis of algorithms for solving confluent Vandermonde-like systems
    • HIGHAM, N. J. 1990. Stability analysis of algorithms for solving confluent Vandermonde-like systems. SIAM J. Matrix Anal. Appl. 11, 1, 23-41.
    • (1990) SIAM J. Matrix Anal. Appl. , vol.11 , Issue.1 , pp. 23-41
    • Higham, N.J.1
  • 26
    • 0014797112 scopus 로고
    • Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands
    • HILLSTROM, K. E. 1970. Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands. Comm. ACM 13, 6, 362-365.
    • (1970) Comm. ACM , vol.13 , Issue.6 , pp. 362-365
    • Hillstrom, K.E.1
  • 27
    • 0042900392 scopus 로고
    • 5.15 Comparison of numerical quadrature formulas
    • J. R. Rice, Ed. Academic Press, New York and London
    • KAHANER, D. K. 1971. 5.15 Comparison of numerical quadrature formulas. In Mathematical Software, J. R. Rice, Ed. Academic Press, New York and London, 229-259.
    • (1971) Mathematical Software , pp. 229-259
    • Kahaner, D.K.1
  • 30
    • 77957584935 scopus 로고
    • Algorithm 103: Simpson's rule integrator
    • KUNCIR, G. F. 1962. Algorithm 103: Simpson's rule integrator. Comm. ACM 5, 6, 347.
    • (1962) Comm. ACM , vol.5 , Issue.6 , pp. 347
    • Kuncir, G.F.1
  • 31
    • 0005149275 scopus 로고
    • Sharper error estimates in adaptive quadrature
    • LAURIE, D. P. 1983. Sharper error estimates in adaptive quadrature. BIT 23, 258-261.
    • (1983) BIT , vol.23 , pp. 258-261
    • Laurie, D.P.1
  • 32
    • 0008759632 scopus 로고
    • Stratified sequences of nested quadrature formulas
    • LAURIE, D. P. 1992. Stratified sequences of nested quadrature formulas. Quaestiones Mathematicae 15, 364-384.
    • (1992) Quaestiones Mathematicae , vol.15 , pp. 364-384
    • Laurie, D.P.1
  • 33
    • 84976703355 scopus 로고
    • Algorithm 379: SQUANK (Simpson quadrature used adaptively - noise killed)
    • LYNESS, J. N. 1970. Algorithm 379: SQUANK (Simpson quadrature used adaptively - noise killed). Comm. ACM 13, 4, 260-262.
    • (1970) Comm. ACM , vol.13 , Issue.4 , pp. 260-262
    • Lyness, J.N.1
  • 34
    • 4043113830 scopus 로고
    • A technique for comparing automatic quadrature routines
    • LYNESS, J. N. AND KAGANOVE, J. J. 1977. A technique for comparing automatic quadrature routines. Comput. J. 20, 2, 170-177.
    • (1977) Comput. J. , vol.20 , Issue.2 , pp. 170-177
    • Lyness, J.N.1    Kaganove, J.J.2
  • 35
    • 84976762558 scopus 로고
    • Local versus global strategies for adaptive quadrature
    • MALCOLM, M. A. AND SIMPSON, R. B. 1975. Local versus global strategies for adaptive quadrature. ACM Trans. Math. Softw. 1, 2, 129-146.
    • (1975) ACM Trans. Math. Softw. , vol.1 , Issue.2 , pp. 129-146
    • Malcolm, M.A.1    Simpson, R.B.2
  • 36
    • 4043083845 scopus 로고
    • Algorithm 145: Adaptive numerical integration by Simpson's rule
    • MCKEEMAN, W. M. 1962. Algorithm 145: Adaptive numerical integration by Simpson's rule. Comm. ACM 5, 12, 604.
    • (1962) Comm. ACM , vol.5 , Issue.12 , pp. 604
    • Mckeeman, W.M.1
  • 37
    • 77957598578 scopus 로고
    • Algorithm 198: Adaptive integration and multiple integration
    • MCKEEMAN, W. M. 1963. Algorithm 198: Adaptive integration and multiple integration. Comm. ACM 6, 8, 443-444.
    • (1963) Comm. ACM , vol.6 , Issue.8 , pp. 443-444
    • Mckeeman, W.M.1
  • 38
    • 77957560873 scopus 로고
    • Algorithm 182: Nonrecursive adaptive integration
    • MCKEEMAN, W. M. AND TESLER, L. 1963. Algorithm 182: Nonrecursive adaptive integration. Comm. ACM 6, 6, 315.
    • (1963) Comm. ACM , vol.6 , Issue.6 , pp. 315
    • Mckeeman, W.M.1    Tesler, L.2
  • 39
    • 77957557303 scopus 로고
    • Integration subroutine - Fixed point
    • 701 Note #28, U.S. Naval Ordnance Test Station, China Lake, California
    • MORRIN, H. 1955. Integration subroutine - Fixed point. Tech. rep. 701 Note #28, U.S. Naval Ordnance Test Station, China Lake, California.
    • (1955) Tech. Rep.
    • Morrin, H.1
  • 40
    • 0010678017 scopus 로고
    • Generalised functions and divergent integrals
    • NINHAM, B. W. 1966. Generalised functions and divergent integrals. Numer. Math. 8, 444-457.
    • (1966) Numer. Math. , vol.8 , pp. 444-457
    • Ninham, B.W.1
  • 41
    • 0019264393 scopus 로고
    • Improvements of adaptive Newton-Cotes quadrature methods
    • NINOMIYA, I. 1980. Improvements of adaptive Newton-Cotes quadrature methods. J. Inform. Porc. 3, 3, 162-170.
    • (1980) J. Inform. Porc. , vol.3 , Issue.3 , pp. 162-170
    • Ninomiya, I.1
  • 42
    • 0040800431 scopus 로고
    • Error estimation in Clenshaw-Curtis quadrature formula
    • O'HARA, H. AND SMITH, F. J. 1968. Error estimation in Clenshaw-Curtis quadrature formula. Comput. J. 11, 2, 213-219.
    • (1968) Comput. J. , vol.11 , Issue.2 , pp. 213-219
    • O'hara, H.1    Smith, F.J.2
  • 43
    • 33646246346 scopus 로고
    • The evaluation of definite integrals by interval subdivision
    • O'HARA, H. AND SMITH, F. J. 1969. The evaluation of definite integrals by interval subdivision. Comput. J. 12, 2, 179-182.
    • (1969) Comput. J. , vol.12 , Issue.2 , pp. 179-182
    • O'hara, H.1    Smith, F.J.2
  • 44
    • 0015345467 scopus 로고
    • A doubly-adaptive Clenshaw-Curtis quadrature method
    • OLIVER, J. 1972. A doubly-adaptive Clenshaw-Curtis quadrature method. Comput. J. 15, 2, 141-147.
    • (1972) Comput. J. , vol.15 , Issue.2 , pp. 141-147
    • Oliver, J.1
  • 45
    • 84976825160 scopus 로고
    • Algorithm 468: Algorithm for automatic numerical integration over a finite interval
    • PATTERSON, T. N. L. 1973. Algorithm 468: Algorithm for automatic numerical integration over a finite interval. Comm. ACM 16, 11, 694-699.
    • (1973) Comm. ACM , vol.16 , Issue.11 , pp. 694-699
    • Patterson, T.N.L.1
  • 46
    • 0015659001 scopus 로고
    • An algorithm for automatic integration
    • PIESSENS, R. 1973. An algorithm for automatic integration. Angewandte Inf. 9, 399-401.
    • (1973) Angewandte Inf. , vol.9 , pp. 399-401
    • Piessens, R.1
  • 49
    • 0016435988 scopus 로고
    • A metalgorithm for adaptive quadrature
    • RICE, J. R. 1975. A metalgorithm for adaptive quadrature. J. ACM 22, 1, 61-82.
    • (1975) J. ACM , vol.22 , Issue.1 , pp. 61-82
    • Rice, J.R.1
  • 50
    • 0018523146 scopus 로고
    • A comparison of numerical integration programs
    • ROBINSON, I. 1979. A comparison of numerical integration programs. J. Comput. Appl. Math. 5, 3, 207-223.
    • (1979) J. Comput. Appl. Math. , vol.5 , Issue.3 , pp. 207-223
    • Robinson, I.1
  • 51
    • 84968486121 scopus 로고
    • Exit criteria for Simpson's compound rule
    • ROWLAND, J. H. AND VAROL, Y. L. 1972. Exit criteria for Simpson's compound rule. Math. Comput. 26, 119, 699-703.
    • (1972) Math. Comput. , vol.26 , Issue.119 , pp. 699-703
    • Rowland, J.H.1    Varol, Y.L.2
  • 55
    • 38249026294 scopus 로고
    • On the construction of high-order integration formulae for the adaptive quadrature method
    • SUGIURA, H. AND SAKURAI, T. 1989. On the construction of high-order integration formulae for the adaptive quadrature method. J. Comput. Appl. Math. 28, 367-381.
    • (1989) J. Comput. Appl. Math. , vol.28 , pp. 367-381
    • Sugiura, H.1    Sakurai, T.2
  • 56
    • 77957591783 scopus 로고    scopus 로고
    • THE MATHWORKS, The Mathworks, Natick, MA
    • THE MATHWORKS. 2003. MATLAB 6.5 Release Notes. The Mathworks, Natick, MA.
    • (2003) MATLAB 6.5 Release Notes
  • 57
    • 40749154941 scopus 로고    scopus 로고
    • Is Gauss quadrature better than Clenshaw-Curtis?
    • TREFETHEN, L. N. 2008. Is Gauss quadrature better than Clenshaw-Curtis? SIAM Rev. 50, 1, 67-87.
    • (2008) SIAM Rev. , vol.50 , Issue.1 , pp. 67-87
    • Trefethen, L.N.1
  • 58
    • 0042920792 scopus 로고    scopus 로고
    • A doubly adaptive integration algorithm using stratified rules
    • VENTER, A. AND LAURIE, D. P. 2002. A doubly adaptive integration algorithm using stratified rules. BIT 42, 1, 183-193.
    • (2002) BIT , vol.42 , Issue.1 , pp. 183-193
    • Venter, A.1    Laurie, D.P.2
  • 59
    • 77957583228 scopus 로고
    • Use of the IBM 701 computer for quantum mechanical calculations II. Overlap integral
    • 5257, U.S. Naval Ordnance Test Station, China Lake, CA
    • VILLARS, D. S. 1956. Use of the IBM 701 computer for quantum mechanical calculations II. overlap integral. Tech. rep. 5257, U.S. Naval Ordnance Test Station, China Lake, CA.
    • (1956) Tech. Rep.
    • Villars, D.S.1
  • 60
    • 78751629883 scopus 로고    scopus 로고
    • Towards a general error theory of the trapezoidal rule
    • W. Gautschi and G. Mastroianni and Th.M. Rassias, To appear. Preprint Eds. Springer.
    • WALDVOGEL, J. 2009. Towards a general error theory of the trapezoidal rule. In Approximation and Computation, W. Gautschi and G. Mastroianni and Th.M. Rassias, To appear. Preprint Eds. Springer. http://www.math.ethz.ch/waldvoge/ Projects/nisJoerg.pdf.
    • (2009) Approximation and Computation
    • Waldvogel, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.