Name
Title | ||
|---|---|---|
Some Modified Newton-Type Methods with Order of Convergence Varied from Two to Six under Weak Conditions |
Abstract | ||
|---|---|---|
We present some modified Newton-type methods for solving nonlinear equations. These algorithms are free from second derivatives and permit f'(x) = 0 in some iteration points. The convergent analysis demonstrates that the order of convergence and the efficiency index of the present methods are better than that of the classical Newton's method. Some numerical examples are given to illustrate their efficiency and performance. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/CSO.2009.284 | CSO (2) |
Keywords | Field | DocType |
convergent analysis,classical newton,iteration point,weak conditions,newton's method,modified newton-type methods,newton method,convergence analysis,iterative method,nonlinear equations,efficiency index,modified newton-type method,present method,convergence of numerical methods,nonlinear differential equations,order of convergence,nonlinear equation,second derivative,nonlinear differential equation,numerical example,mathematics,indexes,iterative methods,helium,iteration method,convergence,data mining,information science,sun,newton s method,probability density function | Convergence (routing),Mathematical optimization,Nonlinear system,Second derivative,Iterative method,Mathematical analysis,Local convergence,Rate of convergence,Probability density function,Mathematics,Newton's method | Conference |
Volume | ISBN | Citations |
2 | 978-0-7695-3605-7 | 3 |
PageRank | References | Authors |
0.48 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Fang | 1 | 4 | 3.22 |
| Guoping He | 2 | 91 | 13.59 |
| Yunhong Hu | 3 | 28 | 3.66 |
| Li Sun | 4 | 64 | 3.99 |