Aberth Method: Root- finding algorithm, Polynomial, Fundamental theorem of algebra, Durand-Kerner method, MPSolve, Properties of polynomial roots, Univariate -
-30% with code BOOKS
Shipping in 15-21 days
30-day return policy
High Quality Content by WIKIPEDIA articles! The Aberth method, or Aberth Ehrlich method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm for simultaneous approximation of all the roots of a univariate polynomial. The fundamental theorem of algebra states that for each polynomial with complex coefficients there are as many roots as the degree of the polynomial. More specifically, ... Full description
You May Also Like
Description
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786131704024 |