On Brown's and Newton's methods with convexity hypotheses

DOI10.1016/S0377-0427(02)00489-2zbMath1029.65052OpenAlexW2007245887MaRDI QIDQ1863678

Juan Pedro Milaszewicz

Publication date: 12 March 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(02)00489-2

zbMATH Keywords

Newton methodsystems of nonlinear equationsBrown analytic iterationsBrown methodChandrasekhar's equationdiscretised Newton iterations

Mathematics Subject Classification ID

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

Related Items

On Brown's method with convexity hypotheses. ⋮ Jacobian smoothing Brown's method for NCP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of Brown's and Newton's method in the monotone case
• Comparison theorems for a third order method
• Comparison theorems for monotone Newton-Fourier iterations and applications in functional elimination
• Monotone discrete Newton iterations and elimination
• Elimination and fixed point iterations
• The Jacobian matrix and global univalence of mappings
• Monotonicity of Brown's Method
• Ein Konvergenzsatz für Verfahren vomBrown-Brent-Typ
• Monotone Iterations for Nonlinear Equations with Application to Gauss-Seidel Methods
• A Quadratically Convergent Newton-Like Method Based Upon Gaussian Elimination
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations