✦ LIBER ✦

A PL homotopy for finding all the roots of a polynomial

✍ Scribed by Masakazu Kojima; Hisakazu Nishino; Naohiko Arima

Publisher: Springer-Verlag
Year: 1979
Tongue: English
Weight: 919 KB
Volume: 16
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582093

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method for finding the roots of a poly

A method for finding the roots of a polynomial

✍ Jiří Soukup 📂 Article 📅 1969 🏛 Springer-Verlag 🌐 English ⚖ 273 KB

On the complexity of a PL homotopy algor

On the complexity of a PL homotopy algorithm for zeros of polynomials

✍ Tang'an Gao; Zeke Wang 📂 Article 📅 1993 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 382 KB

Finding the roots of a polynomial on an

Finding the roots of a polynomial on an MIMD multicomputer

✍ Michel Consnard; Pierre Fraigniaud 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 603 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

On the cost of approximating all roots o

On the cost of approximating all roots of a complex polynomial

✍ James Renegar 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 656 KB

Numerical integration error method – a n

Numerical integration error method – a new method for polynomial root-finding

✍ Tomohiro Suzuki; Toshio Suzuki 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 294 KB