Multiple vector-Jacobian products are cheap

Applied Numerical Mathematics

Volumn 30, Issue 2, 1999, Pages 367-377

  Walther, Andrea ^a   Griewank, Andreas ^a   Best, André ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; ITERATIVE METHODS; LINEAR SYSTEMS; NONLINEAR SYSTEMS; PROBLEM SOLVING;

COMPUTATIONAL DIFFERENTIATION; ITERATIVE EQUATION SOLVING; MULTIPLE VECTOR JACOBIAN PRODUCTS;

VECTORS;

EID: 0033149742     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00120-2     Document Type: Article

References (16)

1. ATHLET Programmers Manual, ATHLET Users Manual (Gesellschaft für Anlagen- und Reaktorsicherheit mbH, Garching, 1995).
2. B. Averick, R.G. Carter and J.J. Moré, The MINPACK-2 Test Problem Collection (Argonne National Laboratory, MCS-P153-0692, 1992).
3. C. Bischof, A. Carle, G. Corliss, A. Griewank and P. Hovland, ADIFOR: Generating derivative codes from Fortran programs, Scientific Programming 1 (1992) 11-29.
4. C. Broyden, Block conjugate gradient methods, Optimization Methods Software 2 (1994) 1-18.
5. A.R. Curtis, M.J.D. Powell and J.K. Reid, On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl. 13 (1974) 117-120.
6. S.C. Eisenstat and H.F. Walker, Choosing the forcing terms in an inexact Newton method, SIAM J. Sci. Comput. 17 (1996) 16-22.
7. A. Griewank, The local convergence of Broyden's method on Lipschitzian problems in Hilbert spaces, SIAM J. Numer. Anal. 24 (1987) 684-705.
8. A. Griewank, Some bounds on the complexity of gradients, Jacobians, and Hessians, in: P.M. Pardalos, ed., Complexity in Nonlinear Optimization (World Scientific, 1993) 128-161.
9. A. Griewank, D. Juedes and J. Utke, ADOL-C: A package for the automatic differentiation of algorithms written in C/C++, TOMS 22 (1996) 131-167.
10. M. Iri, History of automatic differentiation and rounding estimation, in: A. Griewank and G. Corliss, eds., Automatic Differentiation of Algorithms: Theory, Implementation, and Application (SIAM, Philadelphia, PA, 1991) 1-16.
11. G. Landgraf, K.-H. Modler and M. Ziegenhorn, Forming of shells, VDI Berichte 894 (1991) 293-306.
12. U. Meier Yang, A Family of Preconditioned Iterative Solvers for Sparse Linear Systems, Ph.D. Thesis UIUCDCS-R-95-1904, University of Illinois, Urbana-Champaign, Urbana, IL (1995).
13. G.N. Newsam and J.D. Ramsdell, Estimation of sparse Jacobian matrices, SIAM J. Algebra Discrete Methods 4 (1983) 404-417.
14. N. Rostaing, S. Dalmas and A. Galligo, Automatic differentiation in ODYSSEE, in: M. Berz, C. Bischof, G. Corliss and A. Griewank, eds., Computational Differentiation -techniques, Applications, and Tools (SIAM, Philadelphia, PA, 1996) 558-568.
15. W. Schönauer, Scientific Computing on Vector Computers (North-Holland, Amsterdam, 1987).
16. R. Weiss, Parameter-free iterative linear solvers, Math. Res. 97 (1996).