Jacobian computation-free Newton's method for systems of nonlinear equations.
We propose a modification to Newton’s method for solving nonlinear equations,namely a Jacobian Computation-free Newton’s Method . Unlike the classical Newton’s method, the proposed modification neither requires to compute and store the Jacobian matrix,nor to solve a system of linear equations in ea...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en English |
| Published: |
Euclidean Press, LLC
2010
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/15342/1/Jacobian%20computation-free%20Newton%27s%20method%20for%20systems%20of%20nonlinear%20equations..pdf http://psasir.upm.edu.my/id/eprint/15342/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We propose a modification to Newton’s method for solving nonlinear equations,namely a Jacobian Computation-free Newton’s Method . Unlike the classical Newton’s
method, the proposed modification neither requires to compute and store the Jacobian matrix,nor to solve a system of linear equations in each iteration. This is made possible by approximating the Jacobian inverse to a diagonal matrix without computing the Jacobian. The
proposed method turns out to be significantly cheaper than Newton’s method, much faster than fixed Newton and is suitable for small, medium or large scale nonlinear equations with a dense or sparse Jacobian. After proving the convergence of the reported algorithm, numerical
experiments are reported to illustrate the promise of this method. |
|---|