Convergence by nondiscrete mathematical induction of a two step secant's method (Q2477966)

From MaRDI portal
Revision as of 03:33, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q175020)
scientific article
Language Label Description Also known as
English
Convergence by nondiscrete mathematical induction of a two step secant's method
scientific article

    Statements

    Convergence by nondiscrete mathematical induction of a two step secant's method (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2008
    0 references
    The paper focuses on the semi-local convergence of a two-step secant's iterative scheme on a Banach space, using the nondiscrete mathematical induction method. The first part represents the background concerning the two-step Steffensen's method for locally approximating the unique solution \(x^*\) of the nonlinear equation: \[ f(x)=0, \] \(f\) being a continuous operator defined on a closed convex domain \(D\) of a Banach space \(E_1\) with values in a Banach space \(E_2.\) The algorithm of the above numerical method is given by: \[ \begin{aligned} y_{n+1}&=x_n-[x_n,x_n+\alpha_n(y_n-x_n);f]^{-1}f(x_n)\\ x_{n+1}&=y_{n+1}-[x_n,x_n+\alpha_n(y_n-x_n);f]^{-1}f(y_{n+1}),\quad n\geq 0 \end{aligned} \] and generates two sequences, converging to \(x^*,\) \(\alpha_n\) being a parameter which improves the convergence of the scheme. The second part concerns the method of nondiscrete mathematical induction, presenting the generalization of the induction theorem. The third part is devoted to the convergence analysis. Applying the above method, the authors give sufficient conditions for the convergence.
    0 references
    nonlinear operator equations
    0 references
    iterative methods
    0 references
    nondiscrete mathematical induction
    0 references
    semi-local convergence
    0 references
    two-step secant's iterative scheme
    0 references
    Banach space
    0 references
    two-step Steffensen's method
    0 references
    algorithm
    0 references

    Identifiers