Skip to main content

Algorithmic Differencing

  • Chapter
Perspectives on Enclosure Methods

Abstract

An algorithmic representation of a function is a step-by-step specification of its evaluation in terms of known operations and functions, such as a computer program. In addition to function values, the algorithmic representation can be used to compute related quantities such as derivatives of the function. A process similar to automatie (or algorithmic) differentiation will be applied to obtain differences and divided differences of functions. Advantages of this approach are that it often reduces the sometimes catastrophic cancellation errors in computation of differences and divided differences and provides numerical convergence of divided differences to derivatives.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Bischof, A. Carle, G. F. Corliss, and A. Griewank, ADIFOR: Automatie differentiation in a source translator environment, in Proc. of Int. Symp. on Symb. and Alg. Comp. (ISSAC 1992), ACM, New York, 1992, pp. 294–302.

    Google Scholar 

  2. G. Bohlender, C. Ullrich, J. Wolff von Gudenberg, and L. B. Rall, Pascal-SC, A Computer Language for Scientific Computation, Academic Press, New York, 1987.

    MATH  Google Scholar 

  3. C. de Boor, A multivariate divided difference, in Approximation Theory VIII, ed. by C. K. Chui and L. L. Schumaker, World Scientific, Singapore, 1995.

    Google Scholar 

  4. J. Cocke and J. T. Schwartz, Programming Languages and Their Compilers, Preliminary Notes, 2nd Revised Version, Courant Inst. of Math. Sei., New York University, New York, 1970.

    Google Scholar 

  5. G. F. Corliss and L. B. Rall, Adaptive, self-validating quadrature, SIAM J. Sei. Stat. Comput., 8 (1987), pp. 831–847.

    Article  MathSciNet  MATH  Google Scholar 

  6. G. F. Corliss and L. B. Rall, Computing the range of derivatives, in Computer Arithmetic, Scientific Computation and Mathematical Modeling, ed. by E. Kaueher, S. M. Markov, and G. Mayer, J.C. Baltzer AG, Basel, 1991, pp. 195-212.

    Google Scholar 

  7. H. H. Goldstine, A History of Numerical Analysis, Springer-Verlag, New York, 1977.

    MATH  Google Scholar 

  8. A. Griewank, Evaluating Derivatives, Principles and Techniques of Algorithmic Differentiation, SIAM, Philadelphia, 2000.

    MATH  Google Scholar 

  9. W. Kahan and R. J. Fateman, Symbolic computation of divided differences, Unpublished Report, Dept. of Elec. Eng. and Comp. Sei., Univ. of CaliforniaBerkeley, 1985. See http://www.cs.berkeley.edu;-fateman/papers/divdif.pdf.

    Google Scholar 

  10. R. Klatte, U. Kuliseh, M. Neaga, D. Ratz, C. Ullrich, Pascal-XSC, Language Reference with Examples, Springer-Verlag, Berlin-New York, 1992.

    MATH  Google Scholar 

  11. R. Klatte, U. Kuliseh, A. Wiethoff, C. Lawo, M. Rauch, C-XSC, A C++ Class Library for Extended Scientific Computation, Springer-Verlag, Berlin-New York, 1993.

    Google Scholar 

  12. U. W. Kulisch and W. L. Miranker, Computer Arithmetic in Theory and Practice, Academic Press, New York, 1981.

    MATH  Google Scholar 

  13. U. W. Kulisch and W. L. Miranker (Eds.), A New Approach to Scientific Computation, Academic Press, New York, 1983.

    MATH  Google Scholar 

  14. A. C. McCurdy, Accurate Computation of Divided Differences, Ph.D. diss. and Tech. Rep. UCB/ERL M80/28, Univ. of California-Berkeley, 1980.

    Google Scholar 

  15. W. E. Milne, Numerical Calculus, Princeton, 1949.

    Google Scholar 

  16. C. Moler and C. Van Loan, Nineteen dubious ways to compute the exponential of a matrix. SIAM Review 20 (1978), pp. 801–836.

    Article  MathSciNet  MATH  Google Scholar 

  17. R. E. Moore, Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.

    Book  MATH  Google Scholar 

  18. G. Opitz, Steigungsmatrizen, Zeitschrift Angew. Math. Mech. 48 (1964), pp. T52-T54.

    Google Scholar 

  19. R. Paige and S. Koenig, Finite differencing of computable expressions, ACM Trans. Program. Lang. Syst. 4 (1982), pp. 402–454.

    Article  MATH  Google Scholar 

  20. T. W. Reps and L. B. Rall, Computational Divided Differencing and DividedDifference Arithmetics, Tech. Rep. TR-1415, Comp. Sei. Dept., Univ. of Wisconsin-Madison, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Wien

About this chapter

Cite this chapter

Rall, L.B., Reps, T.W. (2001). Algorithmic Differencing. In: Kulisch, U., Lohner, R., Facius, A. (eds) Perspectives on Enclosure Methods. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6282-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6282-8_7

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83590-6

  • Online ISBN: 978-3-7091-6282-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics