Name
Abstract | ||
|---|---|---|
Inspired by some implicit–explicit linear multistep schemes and additive Runge–Kutta methods, we develop a novel split Newton iterative algorithm for the numerical solution of nonlinear equations. The proposed method improves computational efficiency by reducing the computational cost of the Jacobian matrix. Consistency and global convergence of the new method are also maintained. To test its effectiveness, we apply the method to nonlinear reaction–diffusion equations, such as Burger’s–Huxley equation and fisher’s equation. Numerical examples suggest that the involved iterative method is much faster than the classical Newton’s method on a given time interval. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.amc.2010.07.026 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Split Newton iterative,Consistency,Convergence,Computational efficiency,Nonlinear reaction–diffusion equations | Mathematical optimization,Quasi-Newton method,Nonlinear system,Jacobian matrix and determinant,Iterative method,Mathematical analysis,Newton's method in optimization,Local convergence,Mathematics,Steffensen's method,Newton's method | Journal |
Volume | Issue | ISSN |
217 | 5 | 0096-3003 |
Citations | PageRank | References |
6 | 0.48 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dongfang Li | 1 | 106 | 15.34 |
| Chengjian Zhang | 2 | 185 | 29.75 |