A procedure for obtaining a family of iterative formulas for finding zeros of functions (Q2853214)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6217168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A procedure for obtaining a family of iterative formulas for finding zeros of functions |
scientific article; zbMATH DE number 6217168 |
Statements
18 October 2013
0 references
simple zero
0 references
Laguerre method
0 references
cubic convergence
0 references
nonlinear equations
0 references
iterative method
0 references
0.9219072
0 references
0.8975167
0 references
0.89047754
0 references
0.8886666
0 references
0.8823852
0 references
A procedure for obtaining a family of iterative formulas for finding zeros of functions (English)
0 references
A family of iterative formulas for finding zeros of functions is presented. All the methods from this family are cubically convergent for a simple zero. The Laguerre method belongs to this family of iterative formulas. It is also explained the superior behavior of the Laguerre method, starting from the point \(x_k\) where \(| x_k| \) is large.
0 references
