The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation

From MaRDI portal
Publication:4389291

DOI10.1137/S1064827595295349zbMath0913.65041MaRDI QIDQ4389291

Thomas F. Coleman, Arun Kumar Verma

Publication date: 12 May 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)




Related Items

Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring, Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes, Matrix-free preconditioning using partial matrix estimation, A generic framework for approximation analysis of greedy algorithms for star bicoloring, Computation of normal form coefficients of cycle bifurcations of maps by algorithmic differentiation, Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds, Graph models and their efficient implementation for sparse Jacobian matrix determination, Some computational aspects of a group theoretic finite element approach to the buckling and postbuckling analyses of plates and shells of revolution, Efficient calculation of Jacobian and adjoint vector products in the wave propagational inverse problem using automatic differentiation, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models, Automatic implementation of material laws: Jacobian calculation in a finite element code with TAPENADE, Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation, DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices, Computing a sparse Jacobian matrix by rows and columns, Optimal direct determination of sparse Jacobian matrices, Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms


Uses Software