Skip to main content

Complexity of Gradients, Jacobians, and Hessians

SA

  • Reference work entry

Article Outline

Keywords

‘Numerical’ Differentiation Methods

‘Analytical’ Differentiation Methods

Two-Stranded Chain Scenario

Computational Model

Indefinite Integral Scenario

Lack of Smoothness

Predictability of Complexities

Goal-Oriented Differentiation

The Computational Graph

Forward Mode

Bauer's Formula

Reverse Mode

Second Order Adjoints

Overheads

Worst-Case Optimality

Expensive ≡ Redundant?

Preaccumulation and Combinatorics

Summary

See also

References

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Bauer FL (1974) Computational graphs and rounding error. SIAM J Numer Anal 11:87–96

    Article  MATH  MathSciNet  Google Scholar 

  2. Berz M, Bischof Ch, Corliss G, Griewank A (eds) (1996) Computational differentiation: Techniques, applications, and tools. SIAM, Philadelphia

    MATH  Google Scholar 

  3. Bischof Ch, Carle A, Corliss G, Griewank A, Hovland P (1992) ADIFOR: Generating derivative codes from Fortran programs. Scientif Program 1:1–29

    Google Scholar 

  4. Coleman TF, Morée JJ (1984) Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J Numer Anal 20:187–209

    Article  MathSciNet  Google Scholar 

  5. Coleman TF, Verma A (1996) Structure and efficient Jacobian calculation. In: Berz M, Bischof Ch, Corliss G, Griewank A (eds) Computational Differentiation: Techniques, Applications, and Tools. SIAM, Philadelphia, pp 149–159

    Google Scholar 

  6. Curtis AR, Powell MJD, Reid JK (1974) On the estimation of sparse Jacobian matrices. J Inst Math Appl 13:117–119

    MATH  Google Scholar 

  7. Griewank A (1991) The chain rule revisited in scientific computing, I–II. SIAM News

    Google Scholar 

  8. Griewank A (1992) Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optim Methods Softw 1:35–54

    Article  Google Scholar 

  9. Griewank A (2000) Evaluating derivatives, principles and techniques of algorithmic differentiation. Frontiers in Appl Math, vol 19. SIAM, Philadelphia

    MATH  Google Scholar 

  10. Griewank A, Corliss GF (eds) (1991) Automatic differentiation of algorithms: Theory, implementation, and application. SIAM, Philadelphia

    MATH  Google Scholar 

  11. Griewank A, Reese S (1991) On the calculation of Jacobian matrices by the Markowitz rule. In: Griewank A and Corliss GF (eds) Automatic Differentiation of Algorithms: Theory, Implementation, and Application. SIAM, Philadelphia, pp 126–135

    Google Scholar 

  12. Newsam GN, Ramsdell JD (1983) Estimation of sparse Jacobian matrices. SIAM J Alg Discrete Meth 4:404–417

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Griewank, A. (2008). Complexity of Gradients, Jacobians, and Hessians . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_78

Download citation

Publish with us

Policies and ethics