The implicit function theorem for solving systems of nonlinear equations in

DOI10.1080/00207168908803737zbMath0675.65044OpenAlexW2074765826MaRDI QIDQ3830426

T. N. Grapsa, Michael N. Vrahatis

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803737

zbMATH Keywords

convergencecomparison of methodsNewton's methodsuccessive overrelaxationimplicit function theoremtriangular systembisection

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (6)

A dimension-reducing method for solving systems of nonlinear equations in ⋮ A dimension-reducing method for unconstrained optimization ⋮ Solving systems of nonlinear equations In using a rotating hyperplane in ⋮ A new dimension—reducing method for solving systems of nonlinear equations ⋮ A convergence-improving iterative method for computing periodic orbits near bifurcation points ⋮ Improved Newton's method without direct function evaluations

Cites Work

• A rapid generalized method of bisection for solving systems of non-linear equations
• Bisection is optimal
• Maximal convergence intervals and a Gibbs type phenomenon for Newton's approximation procedure
• A bisection method for systems of nonlinear equations
• Nonlinear Difference Equations and Gauss-Seidel Type Iterative Methods
• Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The implicit function theorem for solving systems of nonlinear equations in