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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bauer FL (1974) Computational graphs and rounding error. SIAM J Numer Anal 11:87–96
Berz M, Bischof Ch, Corliss G, Griewank A (eds) (1996) Computational differentiation: Techniques, applications, and tools. SIAM, Philadelphia
Bischof Ch, Carle A, Corliss G, Griewank A, Hovland P (1992) ADIFOR: Generating derivative codes from Fortran programs. Scientif Program 1:1–29
Coleman TF, Morée JJ (1984) Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J Numer Anal 20:187–209
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
Curtis AR, Powell MJD, Reid JK (1974) On the estimation of sparse Jacobian matrices. J Inst Math Appl 13:117–119
Griewank A (1991) The chain rule revisited in scientific computing, I–II. SIAM News
Griewank A (1992) Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optim Methods Softw 1:35–54
Griewank A (2000) Evaluating derivatives, principles and techniques of algorithmic differentiation. Frontiers in Appl Math, vol 19. SIAM, Philadelphia
Griewank A, Corliss GF (eds) (1991) Automatic differentiation of algorithms: Theory, implementation, and application. SIAM, Philadelphia
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
Newsam GN, Ramsdell JD (1983) Estimation of sparse Jacobian matrices. SIAM J Alg Discrete Meth 4:404–417
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-0-387-74759-0_78
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering