Abstract
In this paper, we consider a quasi-Newton iteration for solving a nonlinear equation F(x) = Ax + g(x) = 0 in Rn, where A is a symmetric positive definite matrix and g is a bounded continuous function. We discuss the PCG method with various preconditioners to solve the linear equation at each step of the iteration, estimate their condition numbers, and compare their computing time for a numerical example.
Original language | English |
---|---|
Pages (from-to) | 61-75 |
Number of pages | 15 |
Journal | Journal of Computational and Applied Mathematics |
Volume | 38 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 23 Dec 1991 |
Externally published | Yes |
Keywords
- Newton-like method
- nonlinear equations
- PCG method
ASJC Scopus subject areas
- Applied Mathematics
- Computational Mathematics
- Numerical Analysis