✦ LIBER ✦

Remark on Algorithms to Find Roots of Polynomials

✍ Scribed by Goedecker, S.

Book ID: 115489370
Publisher: Society for Industrial and Applied Mathematics
Year: 1994
Tongue: English
Weight: 622 KB
Volume: 15
Category: Article
ISSN: 1064-8275
DOI: 10.1137/0915064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for finding polynomi

Parallel algorithms for finding polynomial Roots on

✍ Keny T. Lucas; Prasanta K. Jana 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 1016 KB

Algorithms for quaternion polynomial roo

Algorithms for quaternion polynomial root-finding

✍ Kalantari, Bahman 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A remark on roots of polynomials with po

A remark on roots of polynomials with positive coefficients

✍ Horst Brunotte 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 73 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

A parallel algorithm for finding roots o

A parallel algorithm for finding roots of a complex polynomial

✍ Jinsong Cheng 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 503 KB

How to find all roots of complex polynom

How to find all roots of complex polynomials by Newton’s method

✍ John Hubbard; Dierk Schleicher; Scott Sutherland 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 749 KB