skip to main content
article
Free Access

Computing multivariable Taylor series to arbitrary order

Published:08 June 1995Publication History
Skip Abstract Section

Abstract

Automatic differentiation, manipulating numerical vectors of coefficients, is the efficient way to compute multivariable Taylor series. This does not require symbolic differentiation or numerical approximation but uses exact formulas applied to numerical arrays. Arrays of Taylor series coefficients of any elementary function can be built-up, as the array for each component (combination or function) is a combination of its argument arrays. The functions TIMES and EXP display the algorithmic ideas that enable all of the other standard functions. We study the interesting recursive formulas for these combinations, the resulting algorithms, and the implementation in APL. To handle all coefficients in n variables up to order m, the arrays are hyper-pyramid data structures, considered conceptually as n-dimensional but implemented as one-dimensional arrays. Unlike previous work, this implementation does not require huge arrays for binomial coefficients and indirect referencing. This APL*PLUS III implementation loops through one nested reference array and takes sub-arrays from another for a practical solution to this problem that can make tremendous demands on time and space.

References

  1. 1 Berz, M. Differential algebraic description of beam dynamics to very high orders. Particle Accelerators, 24 (2), 1989, 109-124.Google ScholarGoogle Scholar
  2. 2 Bischof, C., Corliss, G., and Griewank, A. Structured second- and higher-order derivatives through univariate Taylor series. Optimization Methods and Software, 2, 1993, 211-232.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3 Christianson, B. Reverse accumulation and accurate rounding error estimates for Taylor series coefficients. Optimization Methods and Software, 1 (1), 1992, 81-94.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4 Juedes, D.W. A taxonomy of automatic differentiation tools. Automatic Differentiation of A Igorithms, Edited by Griewank and Corliss, SIAM, Philadelphia, 1991.Google ScholarGoogle Scholar
  5. 5 Kalman, D. and Lindell, R. A recursive approach to multivariate automatic differentiation. Preprint.Google ScholarGoogle Scholar
  6. 6 Moore, R.E. Methods and applications of interval analysis. SIAM Studies in Applied Mathematics, 2, SIAM, Philadelphia, Pa., 1979, 24-31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Neidinger, R.D. Automatic differentiation and APL. College Mathematics J., 20 (3), May 1989, 238-251.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8 Neidinger, R.D. An APL approach to differential calculus yields a powerful tool. A PL89 Proceedings, A PL Quote Quad, 19, 1989, 285-288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Neidinger, R.D. Differential equations are recurrence relations in APL. A PL92 Proceedings, A PL Quote Quad, 23 (1), July 1992, 165-174. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Neidinger, R.D. An efficient method for the numerical evaluation of partial derivatives of arbitrary order. A CM Transactions on Mathematical Software, 18 (2), June 1992, 159- 173. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Computing multivariable Taylor series to arbitrary order

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader