Skip to main content
Log in

A Primer on Differentiation

  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

The central idea of differential calculus is that the derivative of a function defines the best local linear approximation to the function near a given point. This basic idea, together with some representation theorems from linear algebra, unifies the various derivatives—gradients, Jacobians, Hessians, and so forth—encountered in engineering and optimization. The basic differentiation rules presented in calculus classes, notably the product and chain rules, allow the computation of the gradients and Hessians needed by optimization algorithms, even when the underlying operators are quite complex. Examples include the solution operators of time-dependent and steady-state partial differential equations. Alternatives to the hand-coding of derivatives are finite differences and automatic differentiation, both of which save programming time at the possible cost of run-time efficiency.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • C. Bischof, A. Carle, G. Corliss, A. Griewank, and P. Hovland, “Adifor: Generating derivative code from fortran programs,” Scientific Programming Vol. 1, pp. 1–29, 1992.

    Google Scholar 

  • J. Dieudonné, Foundations of Modern Analysis, Academic Press: New York, London, 1969.

    Google Scholar 

  • Ralf Giering, Tangent Linear and Adjoint Model Compiler, User Manual 1.4, 1999. URL: http://puddle. mit.edu/~ralf/tamc

  • M. S. Gockenbach, “Understanding code generated by TAMC,” Department of Computational and Applied Mathematics, Rice University, Houston, TX, Technical Report TR00-30, 2000.

    Google Scholar 

  • M. S. Gockenbach, D. R. Reynolds, and W. W. Symes, “Efficient and automatic implementation of the adjoint state method,” in Press. A. Griewank, “Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation,” Optimization Methods and Software, Vol. 1, pp. 35–54, 1992.

    Google Scholar 

  • A. Griewank, D. Juedes, and J. Utke, “ADOL-C, a package for the automatic differentiation of algorithms written in C/C++,” ACM TOMS Vol. 22, pp. 131–167, 1996.

    Google Scholar 

  • Andreas Griewank, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, SIAM: Philadelphia, 2000.

    Google Scholar 

  • Charles W. Groetsch, Elements of Applicable Functional Analysis, Marcel Dekker: New York, 1980.

    Google Scholar 

  • W. W. Symes, J. O. Blanch, and R. Versteeg, “A numerical study of linear inversion in layered viscoacoustic media,” in Comparison of Seismic Inversion Methods on a Single Real Dataset, R. Keys and D. Foster, eds., Society of Exploration Geophysicists, Tulsa, 1998.

    Google Scholar 

  • R. Tapia, “The differentiation and integration of nonlinear operators,” in Nonlinear Functional Analysis and Applications, L. Rall, ed., Academic Press: New York, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gockenbach, M.S. A Primer on Differentiation. Optimization and Engineering 2, 75–129 (2001). https://doi.org/10.1023/A:1011874904403

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011874904403

Navigation