Methods for solving systems of nonlinear equations

by Rheinboldt, Werner C.

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Methods for solving systems of nonlinear equations / Werner C. Rheinboldt.

Edition Statements

Publication Date:1998.
Edition:2nd ed

Publication Statements

Publisher(s):Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
Place of Publication:Philadelphia, Pa
Language:eng
Publication Date:1998.

Notes

Preface to the Second edition -- Preface to the First edition -- Chapter 1: Introduction. Problem overview; Notation and background -- Chapter 2: Model problems. Discretization of operator equations; Minimization; Discrete problems -- Chapter 3: Iterative processes and rates of convergence. Characterization of iterative processes; Rates of convergence; Evaluation of convergence rates; On efficiency and accuracy -- Chapter 4: Methods of Newton type. The linearization concept; Methods of Newton form; Discretized Newton methods; Attraction basins -- Chapter 5: Methods of Secant type. General Secant methods; Consistent approximations; Update methods -- Chapter 6: Combinations of processes. The use of classical linear methods; Nonlinear SOR methods; Residual convergence controls; Inexact Newton methods -- Chapter 7: Parametrized systems of equations. Submanifolds of Rn; Continuation using ODEs; Continuation with local parametrizations; Simplicial approximations of manifolds -- Chapter 8: Unconstrained minimization methods. Admissible step length algorithms; Gradient related methods; Collectively gradient related directions; Trust region methods -- Chapter 9: Nonlinear generalizations of several matrix classes. Basic function classes; Properties of the function classes; Convergence of iterative processes -- Chapter 10: Outlook at further methods. Higher order methods; Piecewise-linear methods; Further minimization methods -- Bibliography -- Index.

This second edition provides much-needed updates to the original volume. Like the first edition, it emphasizes the ideas behind the algorithms as well as their theoretical foundations and properties, rather than focusing strictly on computational details; at the same time, this new version is now largely self-contained and includes essential proofs. Additions have been made to almost every chapter, including an introduction to the theory of inexact Newton methods, a basic theory of continuation methods in the setting of differentiable manifolds, and an expanded discussion of minimization methods. New information on parametrized equations and continuation incorporates research since the first edition.