Variants of Newton's method for functions of several variables (Q864757)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5125211
Language Label Description Also known as
default for all languages
No label defined
    English
    Variants of Newton's method for functions of several variables
    scientific article; zbMATH DE number 5125211

      Statements

      Variants of Newton's method for functions of several variables (English)
      0 references
      13 February 2007
      0 references
      Newton-like methods are discussed for finding a real solution of a system of nonlinear equations: \(F(x)=0\) in \(\mathbb R^n\). The authors propose a midpoint Newton method: \[ x^{(k+1)} = x^{(k)} - J_F((x^{(k)} + z^{(k)})/2)^{-1}F(x^{(k)}, \quad k=0, 1, \dots. \] Here \(J_F(x)\) is the Jacobian matrix of the function \(F\). \(z^{(k)}\) is defined via a Newton step as \[ z^{(k)} = x^{(k)}-J_F(x^{(k)})^{-1}F(x^{(k)}). \] The midpoint Newton method is proven to be of quadratic covergence and illustrated to be better than the Newton method itself with numerical examples. But it is not compared with the two step Newton method and the cost of evaluation of the function \(F\) and its Jacobian at each iteration step is not considered.
      0 references
      0 references
      Newton method
      0 references
      fixed point iteration
      0 references
      trapezoidal rule
      0 references
      system of nonlinear equations
      0 references
      quadratic covergence
      0 references
      numerical examples
      0 references

      Identifiers