On iterative methods for nonlinear equations (Q864750): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Geometric constructions of iterative functions to solve nonlinear equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995065 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Third-order methods from quadrature formulae for solving systems of nonlinear equations. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a class of quadratically convergent iteration formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical comparison of iterative methods for solving nonlinear equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-step iterative methods for nonlinear equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method for solving nonlinear equations / rank | |||
Normal rank |
Latest revision as of 14:12, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On iterative methods for nonlinear equations |
scientific article |
Statements
On iterative methods for nonlinear equations (English)
0 references
13 February 2007
0 references
Several one step and two steps iterative method, based on the generalization of Newton method, are presented on the paper. As a combination of Newton's method and Kanwar's idea to use Taylor formula to derive a auxiliary equation for more speed approximation the following new iterative method is suggested: If the equation \(f(x)=0\) has single root in an open interval \(D\) and the function \(f\) has continuous first-, second- and third-order derivatives in \(D\), let for a given initial guess \(x_0\) compute \(x_1,x_2,\dots\) using the iterative scheme: \[ z_k=x_k-\alpha\cdot 2f(x_k)/\biggl(f'(x_k)\pm\bigl(f^{\prime 2}(x_k)+4p^2f^2 (x_k)\bigr)^{1/2}\biggr);\;x_{k+1}=z_k-f(z_k)/f'(z_k), \] where the sign \(\pm\) should be chosen so as to make the denominator larges in magnitude. The quadratic convergence of this algorithm is proved and several numerical examples are given.
0 references
nonlinear equations
0 references
Newton method
0 references
predictor--corrector methods
0 references
one-step methods
0 references
two-step methods
0 references
numerical examples
0 references
0 references