Least-Change Secant Update Methods for Underdetermined Systems
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 27 (5), 1227-1262
- https://doi.org/10.1137/0727071
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A hybrid algorithm for solving sparse nonlinear systems of equationsMathematics of Computation, 1988
- A homotopy for solving polynomial systemsApplied Mathematics and Computation, 1986
- A transformation to avoid solutions at infinity for polynomial systemsApplied Mathematics and Computation, 1986
- Convergence Theorems for Least-Change Secant Update MethodsSIAM Journal on Numerical Analysis, 1981
- Numerical integration of the Davidenko equationPublished by Springer Science and Business Media LLC ,1981
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of EquationsSIAM Review, 1980
- Least Change Secant Updates for Quasi-Newton MethodsSIAM Review, 1979
- Convergence Results for Schubert’s Method for Solving Sparse Nonlinear EquationsSIAM Journal on Numerical Analysis, 1979
- Toward a Unified Convergence Theory for Newton-Like MethodsPublished by Elsevier BV ,1971
- A modified newton-raphson method for the solution of systems of equationsIsrael Journal of Mathematics, 1965