✦ LIBER ✦

Polynomial root finding by means of continuation

✍ Scribed by P. Tilli

Book ID: 110625368
Publisher: Springer Vienna
Year: 1997
Tongue: English
Weight: 867 KB
Volume: 59
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02684414

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding roots by deflated polynomial app

Finding roots by deflated polynomial approximation

✍ T.N. Lucas 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 689 KB

A numerical technique is presented which evaluates the roots of polynomials with real coeficients. Features of the method include no complex arithmetic requirements, no need to guess at initial quadratic factor estimates, multiple or nearly equal roots being easily dealt with and a high degree of fl

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

Polynomial Root-Finding Methods Whose Ba

Polynomial Root-Finding Methods Whose Basins of

✍ Bahman Kalantari 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 563 KB

Polynomial root computation by means of

Polynomial root computation by means of the LR algorithm

✍ Luca Gemignani 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 654 KB

Method for finding multiple roots of pol

Method for finding multiple roots of polynomials

✍ Chang-Dau Yan; Wei-Hua Chieng 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 851 KB

Conventional numerical methods for finding multiple roots of polynomials are inaccurate. The accuracy is unsatisfactory because the derivatives of the polynomial in the intermediate steps of the associated root-finding procedures are eliminated. Engineering applications require that this problem be

Finding roots of polynomials over finite

Finding roots of polynomials over finite fields

✍ Fedorenko, S.V.; Trifonov, P.V. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 250 KB