✦ LIBER ✦

Computing the real roots of a polynomial by the exclusion algorithm

✍ Scribed by Jean-Pierre Dedieu; Jean-Claude Yakoubsohn

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 945 KB
Volume: 4
Category: Article
ISSN: 1017-1398
DOI: 10.1007/bf02142738

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The fastest exact algorithms for the iso

The fastest exact algorithms for the isolation of the real roots of a polynomial equation

✍ A. G. Akritas 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 825 KB

Calculation of the real roots of polynom

Calculation of the real roots of polynomials

✍ G.S. Ganshin 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 220 KB

On the real roots of Euler polynomials

✍ Hubert Delange 📂 Article 📅 1988 🏛 Springer Vienna 🌐 English ⚖ 864 KB

An algorithm for computing the eigenstru

An algorithm for computing the eigenstructure of a regular matrix polynomial

✍ Wen-Wei Lin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 665 KB

Finding roots of a real polynomial simul

Finding roots of a real polynomial simultaneously by means of Bairstow's method

✍ W. S. Luk 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 311 KB

Finding polynomial roots: A fast algorit

Finding polynomial roots: A fast algorithm convergent on the complex plane

✍ Ivanisov, Andrey V. ;Polishchuk, Vadim K. 📂 Article 📅 1985 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 351 KB 👁 1 views

An algorithm is suggested which performs fast calculations of all the roots of a polynomial with maximal computer accuracy using, as the only primary information, the coefficients and the degree of the polynomial. The algorithm combines global as well as local convergences, i.e. it ensures a rapid h