Abstract
This article presents methods for practical computation of verified bounds for Taylor coefficients of analytic functions. These bounds are constructed from Cauchy's estimate and from some of its modifications. Interval arithmetic is used to obtain rigorous results.
- Alefeld, G. and Herzberger, J. 1983. Introduction to Interval Computations. Academic Press, New York.Google Scholar
- Braune, K. 1988. Standard functions for real and complex point and interval arguments with dynamic accuracy. Comput. Suppl. 6, 159--184.Google Scholar
- Braune, K. and Krämer, W. 1987. High-accuracy standard functions for real and complex intervals. In Computerarithmetic: Scientific Computation and Programming Languages, E. Kaucher, U. Kulisch, and C. Ullrich, Eds. Teubner, Stuttgart, Germany, 81--114.Google Scholar
- Caprani, O. and Madsen, K. 1980. Mean value forms in interval analysis. Computing 24, 147--154.Google Scholar
- Casado, L. G., Garcia, I., and Csendes, T. 2000. A new multisection technique in interval methods for global optimization. Computing 65, 263--269. Google Scholar
- Csendes, T. and Ratz, D. 1997. Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal. 34, 922--938. Google Scholar
- Free Software Foundation. 1991. GNU General Public License, Version 2. http://www.gnu.org/ licenses/licenses.html.Google Scholar
- Geddes, K. O. and Mason, J. C. 1975. Polynomial approximation by projections on the unit circle. SIAM J. Numer. Anal. 12, 111--120.Google Scholar
- Griewank, A. 2000. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, Philadelphia, Pa. Google Scholar
- Hairer, E., Nørsett, S. P., and Wanner, G. 1993. Solving Ordinary Differential Equations I, 2nd ed. Springer, Berlin, Germany. Google Scholar
- Hansen, E. R. 1992. Global Optimization using Interval Analysis. Dekker, New York.Google Scholar
- Henrici, P. 1974. Applied and Computational Complex Analysis, Vol. I. Wiley, New York. Google Scholar
- Jaulin, L., Kieffer, M., Didrit, O., and Walter, E. 2001. Applied Interval Analysis. Springer, London, England.Google Scholar
- Kearfott, R. B. 1996. Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht, Netherlands.Google Scholar
- Klatte, R., Kulisch, U., Lawo, C., Rauch, M., and Wiethoff, A. 1993. C-XSC: A C++ Class Library for Extended Scientific Computing. Springer, Berlin, Germany. Google Scholar
- Klatte, R., Kulisch, U., Neaga, M., Ratz, D., and Ullrich, C. 1992. PASCAL-XSC---Language Reference with Examples. Springer, Berlin, Germany. Google Scholar
- Krämer, W. 1988. Inverse standard functions for real and complex point and interval arguments with dynamic accuracy. Comput. Suppl. 6, 185--212.Google Scholar
- Kulisch, U. and Miranker, W. L. 1981. Computer Arithmetic in Theory and Practice. Academic Press, New York. Google Scholar
- Lerch, M., Tischler, G., and Wolff von Gudenberg, J. 2001a. filib++---Interval library specification and reference manual. Tech. Rep. 279, Universität Würzburg, Germany.Google Scholar
- Lerch, M., Tischler, G., Wolff von Gudenberg, J., Hofschuster, W., and Krämer, W. 2001b. The interval library filib++ 2.0. Design, features and sample programs. Preprint 2001/4, Universität Wuppertal, Wissenschaftliches Rechnen/Softwaretechnologie, Germany.Google Scholar
- Moore, R. E. 1966. Interval Analysis. Prentice Hall, Englewood Cliffs, N.J.Google Scholar
- Neher, M. 1997. Enclosing power series solutions of ODEs. ZAMM 77, S2, S635--S636.Google Scholar
- Neher, M. 2001a. Geometric series bounds for the local errors of Taylor methods for linear n-th order ODEs. In Symbolic Algebraic Methods and Verification Methods, G. Alefeld, J. Rohn, S. Rump, and T. Yamamoto, Eds. Springer, Wien, Austria, 183--193.Google Scholar
- Neher, M. 2001b. The mean value form for complex analytic functions. Computing 67, 255--268. Google Scholar
- Neher, M. 2001c. Validated bounds for Taylor coefficients of analytic functions. Rel. Comput. 7, 307--319.Google Scholar
- Neher, M. 2003a. A complex mean value form for curves. Preprint 03/4, Fakultät für Mathematik, Universität Karlsruhe, Germany.Google Scholar
- Neher, M. 2003b. Improved validated bounds for Taylor coefficients and for Taylor remainder series. J. Comput. Appl. Math. 152, 393--404. Google Scholar
- Neumaier, A. 1990. Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, England.Google Scholar
- Rall, L. B. 1981. Automatic Differentiation: Techniques and Applications. Lecture Notes in Computer Science, vol. 120. Springer, Berlin, Germany.Google Scholar
- Ratschek, H. and Rokne, J. 1984. Computer Methods for the Range of Functions. Ellis Horwood Ltd. Chichester, England.Google Scholar
- Ratschek, H. and Rokne, J. 1988. New Computer Methods for Global Optimization. Ellis Horwood Ltd. Chichester, England. Google Scholar
- Ratz, D. 1996. Improved techniques for gap-treating and box-splitting in interval Newton Gauss-Seidel steps for optimization with validation. ZAMM 76, Suppl. 1, 323--326.Google Scholar
- Rump, S. 1999. INTLAB---INTerval LABoratory. In Developments in Reliable Computing, T. Csendes, Ed. Kluwer, Dordrecht, Netherlands. 77--104.Google Scholar
- Sakurai, T. and Sugiura, H. 2000. On factorization of analytic functions and its verification. Rel. Comput. 6, 459--470.Google Scholar
- Walsh, J. L. 1935. Approximation by Polynomials in the Complex Domain. Gauthier-Villars, Paris, France.Google Scholar
- Walter, W. V. 1993. Fortran-XSC: A portable Fortran 90 module library for accurate and reliable scientific computing. In Validation Numerics---Theory and Applications, R. Albrecht, G. Alefeld, and H. J. Stetter, Eds. Comput. Suppl. 9, 265--285.Google Scholar
Index Terms
ACETAF: A software package for computing validated bounds for Taylor coefficients of analytic functions
Recommendations
Sharp Error Bounds for Jacobi Expansions and Gegenbauer--Gauss Quadrature of Analytic Functions
This paper provides a rigorous and delicate analysis for exponential decay of Jacobi polynomial expansions of analytic functions associated with the Bernstein ellipse. Using an argument that can recover the best estimate for the Chebyshev expansion, we ...
A verified method for bounding clusters of zeros of analytic functions
Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)In this paper, we propose a verified method for bounding clusters of zeros of analytic functions. Our method gives a disk that contains a cluster of m zeros of an analytic function f(z). Complex circular arithmetic is used to perform a validated ...
On tensor product approximation of analytic functions
We prove sharp, two-sided bounds on sums of the form k N 0 d D a ( T ) exp ( - j = 1 d a j k j ) , where D a ( T ) : = { k N 0 d : j = 1 d a j k j T } and a R + d . These sums appear in the error analysis of tensor product approximation, interpolation ...
Comments