Jacobian-free Newton–Krylov methods: a survey of approaches and applications
DA Knoll, DE Keyes - Journal of Computational Physics, 2004 - Elsevier
Jacobian-free Newton–Krylov (JFNK) methods are synergistic combinations of Newton-type
methods for superlinearly convergent solution of nonlinear equations and Krylov subspace …
methods for superlinearly convergent solution of nonlinear equations and Krylov subspace …
Recent computational developments in Krylov subspace methods for linear systems
V Simoncini, DB Szyld - Numerical Linear Algebra with …, 2007 - Wiley Online Library
Many advances in the development of Krylov subspace methods for the iterative solution of
linear systems during the last decade and a half are reviewed. These new developments …
linear systems during the last decade and a half are reviewed. These new developments …
Mixed precision algorithms in numerical linear algebra
Today's floating-point arithmetic landscape is broader than ever. While scientific computing
has traditionally used single precision and double precision floating-point arithmetics, half …
has traditionally used single precision and double precision floating-point arithmetics, half …
Choosing the forcing terms in an inexact Newton method
SC Eisenstat, HF Walker - SIAM Journal on Scientific Computing, 1996 - SIAM
An inexact Newton method is a generalization of Newton's method for solving
F(x)=0,F:R^n→R^n in which, at the k th iteration, the step s_k from the current approximate …
F(x)=0,F:R^n→R^n in which, at the k th iteration, the step s_k from the current approximate …
Parallel preconditioning with sparse approximate inverses
A parallel preconditioner is presented for the solution of general sparse linear systems of
equations. A sparse approximate inverse is computed explicitly and then applied as a …
equations. A sparse approximate inverse is computed explicitly and then applied as a …
[图书][B] Methods for solving systems of nonlinear equations
WC Rheinboldt - 1998 - SIAM
After SIAM's editors asked me to prepare a second edition of this monograph, it became
clear to me that the book needed to become more self-contained and that the inclusion of …
clear to me that the book needed to become more self-contained and that the inclusion of …
Stiffness matrix calculation of rolling element bearings using a finite element/contact mechanics model
Current theoretical bearing models differ in their stiffness estimates because of different
model assumptions. In this study, a finite element/contact mechanics model is developed for …
model assumptions. In this study, a finite element/contact mechanics model is developed for …
NITSOL: A Newton iterative solver for nonlinear systems
M Pernice, HF Walker - SIAM Journal on Scientific Computing, 1998 - SIAM
We introduce a well-developed Newton iterative (truncated Newton) algorithm for solving
large-scale nonlinear systems. The framework is an inexact Newton method globalized by …
large-scale nonlinear systems. The framework is an inexact Newton method globalized by …
Accelerating scientific computations with mixed precision algorithms
On modern architectures, the performance of 32-bit operations is often at least twice as fast
as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating …
as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating …
[图书][B] Algorithms for linear-quadratic optimization
V Sima - 2021 - books.google.com
This textbook offers theoretical, algorithmic and computational guidelines for solving the
most frequently encountered linear-quadratic optimization problems. It provides an overview …
most frequently encountered linear-quadratic optimization problems. It provides an overview …