Parametric iterative methods of second-order for solving nonlinear equation (Q2489458)

From MaRDI portal
Revision as of 12:19, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parametric iterative methods of second-order for solving nonlinear equation
scientific article

    Statements

    Parametric iterative methods of second-order for solving nonlinear equation (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    This paper is concerned with two three-parametric methods without derivatives for solving a nonlinear equation. The authors, by using the Lyapunov method of dynamic system, present iterative formulae that converge to a simple root \(x^*\) lying in the interval \([a,b]\) of the equation \(f(x)=0\). These formulae depend on the parameters \(\mu,\alpha \) and \(\beta \), where \(\mu f(x) + f^\prime (x) \neq 0\), do not need to compute derivatives and have a larger range of convergence than the Newton method. The numerical results, given at the end of the paper, show that the main iterative formula \[ x_ {n+1}=x_n-\frac {(\alpha -\beta )f^2(x_n)} {\mu (\alpha -\beta )f^2(x_n)+f\left (x_n+\alpha f(x_n)\right )-f\left (x_n+\beta f(x_n)\right )}, \] or the corresponding exponential type iterative method, compared with the Newton method, have a faster rate of convergence and high precision by choosing suitable parameter values and starting point \(x_0\).
    0 references
    Iterative method
    0 references
    Nonlinear equations
    0 references
    Lyapunouv method
    0 references
    Newton method
    0 references
    three-parametric methods
    0 references
    numerical results
    0 references

    Identifiers