Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations

DOI10.1007/BF02240178zbMath0592.65029MaRDI QIDQ1075739

José Mario Martínez

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

numerical experimentslocal convergencequasi-Newton methodsfactorization of matrices

Mathematics Subject Classification ID

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

Related Items

A computational method for optimal L-Q regulation with simultaneous disturbance decoupling ⋮ Improved Newton's method without direct function evaluations ⋮ A class of factorization update algorithm for solving systems of sparse nonlinear equations ⋮ Practical quasi-Newton methods for solving nonlinear systems

Cites Work

• Unnamed Item
• Unnamed Item
• A quasi-Newton method with modification of one column per iteration
• Solution of sparse linear least squares problems using Givens rotations
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
• Direct Secant Updates of Matrix Factorizations
• Über die Realisierung und Konvergenz von Mehrschrittverfahren zur iterativen Lösung nichtlinearer Gleichungen
• Quasi-Newton Methods, Motivation and Theory
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• Überlinear konvergente Mehrschrittverfahren vom Regula falsi‐ und Newton‐Typ
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian