Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation
DOI10.1080/10556788.2012.733004zbMath1282.65052OpenAlexW2047535262MaRDI QIDQ5746686
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.733004
automatic differentiationNewton methodgraph colouringintersection graphsnonlinear equation solverspreconditioner iterative methods
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A secant method for nonlinear least-squares minimization
- Matrix-free preconditioning using partial matrix estimation
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- Iterative solution of linear systems in the 20th century
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Nonsymmetric Preconditioner Updates in Newton–Krylov Methods for Nonlinear Systems
- Testing Unconstrained Optimization Software
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Fast Numerical Solution of the Biharmonic Dirichlet Problem on Rectangles
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation