Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
type: Item
instance of: scholarly article
title: Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
zbMATH Open document ID: 0606.65036
DOI: 10.1016/0377-0427(86)90090-7
author: J. M. Martínez
published in: Journal of Computational and Applied Mathematics
publication date: 1986-01-01T00:00:00Z
review text: The iterative method for calculating a zero point \(x^*\) of \(F:{\mathbb{R}}^ n\to {\mathbb{R}}^ n\) which is studied here consists of a block orthogonal projections method combined with an acceleration step. The first part involves a grouping of components of F into \(F=(F_ 1,...,F_ m)\) with \(F_ i:D\subset {\mathbb{R}}^ n\to R^{n_ i}\) such that \(n_ 1+...+n_ m=n\) and where it is assumed that the rows of the corresponding Jacobians \(J_ i(X^*)\) of \(F_ i\) at \(X^*\) are linearly independent. The block iterative part proceeds as follows. Set \(X_ 0=X^ k\) and for \(i=0,1,...,m-1\) set \[ U_{i+1}=- W_{i+1}[J_{i+1}(X_ i)J_{i+1}(X_ i)^ T]^{-1}F_{i+1}(x_ i) \] and \(x_{i+1}=x_ i+J_{i+1}(X_ i)^ TU_{i-1}\) where the \(W_ i's\) are relaxation parameters. Then \(X^{k+1}=X_ m\). The acceleration step proceeds by setting \(A(X^ k,X^{k+1})=X^ k+\lambda (X^{k+1}-X^ k)\) where \[ \lambda =-\sum^{m}_{i=1}<F_ i(x^ k),U_ i>/\| X^{k+1}-X^ k\|^ 2. \] A local convergence theorem is proved and some numerical examples are given.
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 3980381
zbMATH Keywords: Kaczmarz method
zbMATH Keywords: block orthogonal projections method
zbMATH Keywords: acceleration
zbMATH Keywords: relaxation
zbMATH Keywords: local convergence
zbMATH Keywords: numerical examples
reviewed by: Eugene L. Allgower
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: 0377-0427(86)90090-7
OpenAlex ID: W2058847151
cites work: On the Local and Superlinear Convergence of Quasi-Newton Methods
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Direct Secant Updates of Matrix Factorizations
cites work: Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
cites work: Block-iterative methods for consistent and inconsistent linear equations
cites work: Q5530039
cites work: Q5768822
cites work: Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations
cites work: Q3670445
cites work: A quasi-Newton method with modification of one column per iteration
cites work: The method of successive orthogonal projections for solving nonlinear simultaneous equations
cites work: The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control
cites work: Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
cites work: Q4109207
cites work: Solution of underdetermined nonlinear equations by stationary iteration methods
cites work: Testing Unconstrained Optimization Software
cites work: A Note on Implementing the Householder Transformation
cites work: Q5652137
cites work: An Error Analysis of a Method for Solving Matrix Equations
cites work: Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
cites work: An Interval Arithmetic Approach for the Construction of an Almost Globally Convergent Method for the Solution of the Nonlinear Poisson Equation on the Unit Square
cites work: On Newton-Iterative Methods for the Solution of Systems of Nonlinear Equations
cites work: Three dimensional x-projection method (with acceleration techniques) for solving systems of linear equations
description: scientific article; zbMATH DE number 3980381