Name
Abstract | ||
|---|---|---|
Two new algorithms used in large-scope solution are put forward to solve nonlinear equations which were not solved by some traditional methods. The initial value was arbitrarily chosen in very large scope. The convergence theorem of the algorithm was presented and proved. The computation is carried out by simple steepest descent rule without evaluation of the derivative evaluation of f. Thus, computation time is saved. The specific examples showed that the proposed method can choose the initial value in very large scope, without the derivative evaluation, and less computation with high precision and rapid convergence. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.4304/jcp.5.4.606-613 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
nonlinear equations, algorithms, convergence, steepest descent rule, high precision, examples | Convergence (routing),Gradient descent,Nonlinear system,Computer science,Algorithm,Rapid convergence,Initial value problem,Computation | Journal |
Volume | Issue | ISSN |
5 | 4 | 1796-203X |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhe-zhao Zeng | 1 | 6 | 4.07 |
| Dongmei Lin | 2 | 18 | 3.98 |
| Lulu Zheng | 3 | 8 | 1.18 |