Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros |
scientific article; zbMATH DE number 2082613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros |
scientific article; zbMATH DE number 2082613 |
Statements
Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (English)
0 references
6 August 2004
0 references
A new iteration method for finding simultaneously all zeros of a real polynomial with only real zeros is proposed. The asymptotic convergence is superlinear under reasonable assumptions. A recursion algorithm by which Vieta equations can be produced automatically by computer is proposed. Some numerical experiments are presented for finding simultaneously all zeros of polynomials having only real zeros, simple zeros, multiple zeros and/or clusters zeros.
0 references
polynomial zero
0 references
Broyden's method
0 references
simultaneous approximation of real zeros
0 references
Vieta's method
0 references
superlinear convergence
0 references
0 references
