Jacobian-free Newton–Krylov (JFNK) methods are synergistic combinations of Newton-type
methods for superlinearly convergent solution of nonlinear equations and Krylov subspace …

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 …

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 …

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 …

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 …

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 …

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 …

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 …

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 …

This textbook offers theoretical, algorithmic and computational guidelines for solving the
most frequently encountered linear-quadratic optimization problems. It provides an overview …