A parallel projection method for overdetermined nonlinear systems of equations
The paper studies an issue of finding an approximate solution to a system \(F(x) = 0\), where \(F: \mathbb{R}^ n \to \mathbb{R}^ m\), \(m \geq n\), is a nonlinear map. Assume that the components of \(F\) are divided into \(N\) blocks and \(J_ i(x) = F_ i'(x)\) be the Jacobian matrix of the \(i\)-th block. If \(V_ i(x) = \{y \in \mathbb{R}^ n| y = {\underset {z}{\text{Argmin}}}\| F_ i(x) + J_ i(x)(z-x)\|_ 2\}\), \(\text{dist}(y,V_ i(x)) = \inf\{\| y-z\|_ 2| z \in V_ i(x)\}\), \(\lambda_ 1,\dots,\lambda_ N > 0\) be such that \(\sum^ N_{i=1}\lambda_ i = 1\) then it is shown that the problem of solving the overdetermined system can be reduced to a minimization problem \[ \varphi(x):{\underset {y}{\text{Minimize}}} \sum^ N_{i=1}\lambda_ i[\text{dist}(y_ ,V_ i(x))]^ 2 \] and a solution is called a weighted least square distance solution (WLSD solution). Algorithms for computing a WLSD solution are presented and numerical examples as well as a comparison to results from a Gauss-Newton method are discussed.
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- A method for the solution of certain non-linear problems in least squares
- A Newton-Raphson method for the solution of systems of equations
- A simultaneous projections method for linear inequalities
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An algorithm for solving nonlinear least-squares problems with a new curvilinear search
- An algorithm for solving sparse nonlinear least squares problems
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- Estimation techniques for distributed parameter systems
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3901927 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- Least-Change Secant Update Methods for Underdetermined Systems
- Numerical methods for inverse problems in three-dimensional geophysical modeling
- Numerical Methods for Large Sparse Linear Least Squares Problems
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Solution of sparse linear least squares problems using Givens rotations
- A projection method for solving nonsymmetric linear systems on multiprocessors
- Parallel projection methods and the resolution of ill-posed problems
- Quasi-Newton methods with derivatives
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- scientific article; zbMATH DE number 1305269 (Why is no real title available?)
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- scientific article; zbMATH DE number 796448 (Why is no real title available?)
- Two-subspace projection method for coherent overdetermined systems
This page was built for publication: A parallel projection method for overdetermined nonlinear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208707)
