Fast intersection methods for the solution of some nonlinear systems of equations
From MaRDI portal
Summary: We give a fast method to solve numerically some systems of nonlinear equations. This method applies basically to all systems which can be put in the form \(U\circ V(X)=Y\), where \(U\) and \(V\) are two possibly nonlinear operators. It uses a modification of Newton's algorithm, in the sense that one projects alternatively onto two subsets. But, here, these subsets are not subspaces any more, but manifolds in an Euclidean space.
Recommendations
- A fast algorithm to solve systems of nonlinear equations
- Accelerated iterative methods for finding solutions of a system of nonlinear equations
- On iterative methods with accelerated convergence for solving systems of nonlinear equations
- On Accelerated Iterative Methods for the Solution of Systems of Linear Equations
- scientific article; zbMATH DE number 432978
- scientific article; zbMATH DE number 4209465
- Some new efficient multipoint iterative methods for solving nonlinear systems of equations
- Fast finite methods for a system of linear inequalities
- scientific article; zbMATH DE number 1524336
- A rapid generalized method of bisection for solving systems of non-linear equations
This page was built for publication: Fast intersection methods for the solution of some nonlinear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570879)
