30% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Aberth Method: Root- finding algorithm, Polynomial, Fundamental theorem of algebra, Durand-Kerner method, MPSolve, Properties of polynomial roots, Univariate -

English
2026-03-11
€127.50 €182.14

-30% with code BOOKS

In stock at our supplier

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

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, each polynomial of degree n is identical to a product of n linear polynomials. The fundamental theorem in itself does not offer an efficient numerical procedure to compute those roots. Numerical algorithms that approximate all roots at once are the Weierstrass method and the Aberth Ehrlich method.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131704024
Write Your Own Review
You're reviewing: Aberth Method: Root- finding algorithm, Polynomial, Fundamental theorem of algebra, Durand-Kerner method, MPSolve, Properties of polynomial roots, Univariate
Your Rating:

Goodreads Reviews

€127.50 €182.14