On an efficient inclusion method for finding polynomial zeros (Q492088)
From MaRDI portal
!
WARNING
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 6473780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an efficient inclusion method for finding polynomial zeros |
scientific article; zbMATH DE number 6473780 |
Statements
On an efficient inclusion method for finding polynomial zeros (English)
0 references
19 August 2015
0 references
polynomial zeros
0 references
simultaneous methods
0 references
inclusion methods
0 references
convergence conditions
0 references
circular interval arithmetic
0 references
Halley method
0 references
convergence acceleration
0 references
iterative method
0 references
simple complex zeros
0 references
\(R\)-order of convergence
0 references
two-point correction
0 references
computational efficiency
0 references
Gauss-Seidel procedure
0 references
numerical examples
0 references
0 references
0 references
0.948054313659668
0 references
0.9193010330200196
0 references
0.9096517562866212
0 references
0.9065841436386108
0 references
0.9039591550827026
0 references
