Implementing Brown's method for systems of nonlinear equations with dense banded Jacobian
From MaRDI portal
Publication:1114338
An implementation of \textit{K. M. Brown}'s method [SIAM J. Numer. Analysis 6, 560-569 (1969; Zbl 0245.65023)] for systems of nonlinear equations with dense banded Jacobian is shown. The algorithm requires essentially the same number of operations for one iteration step as the Gaussian elimination does, when used for dense banded linear systems.
Recommendations
- A method of solving systems of nonlinear equations of large dimension with banded Jacobian matrix
- Inexact Block Jacobi--Broyden Methods for Solving Nonlinear Systems of Equations
- Efficient Jarratt-like methods for solving systems of nonlinear equations
- A modified Brown algorithm for solving singular nonlinear systems with rank defects
- Jacobian computation-free Newton's method for systems of nonlinear equations
- Implementation and comparison of brown algorithm with analytical partial derivatives for boundary value problems
- scientific article; zbMATH DE number 5501512
- Frozen Jacobian iterative method for solving systems of nonlinear equations application to nonlinear IVPs and BVPs
- Solving nonlinear equations with a direct Broyden method and its acceleration
- scientific article; zbMATH DE number 3921850
Cites work
Cited in
(5)- Comparison of Brown's and Newton's method in the monotone case
- Newton-like method for nonlinear banded block diagonal system
- Brown-Broyden update algorithm
- A method of solving systems of nonlinear equations of large dimension with banded Jacobian matrix
- Implementation and comparison of brown algorithm with analytical partial derivatives for boundary value problems
This page was built for publication: Implementing Brown's method for systems of nonlinear equations with dense banded Jacobian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114338)