✦ LIBER ✦

An approximate method of finding the greatest of the moduli of the roots of a polynomial

✍ Scribed by S.A. Ivanov; A.Ya. Lepin; E.I. Lepina

Publisher: Elsevier Science
Year: 1976
Weight: 111 KB
Volume: 16
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(76)90117-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iteration method of finding the best

An iteration method of finding the best approximation polynomial

✍ A.A. Korneichuk; N.Yu. Shirikova 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 225 KB

A method of finding the roots of polynom

A method of finding the roots of polynomials which converge for any initial approximation

✍ A.V. Ivanisov; V.K. Polishchuk 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 674 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

Estimate of the moduli of the roots of p

Estimate of the moduli of the roots of polynomials

✍ T.T. Tonkov 📂 Article 📅 1964 🏛 Elsevier Science ⚖ 89 KB

The calculation of the degree of an appr

The calculation of the degree of an approximate greatest common divisor of two polynomials

✍ Joab R. Winkler; Xin Lao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 438 KB

The calculation of the degree of an approximate greatest common divisor (AGCD) of two inexact polynomials f (y) and g(y) is a non-trivial computation because it reduces to the estimation of the rank loss of a resultant matrix R( f , g). This computation is usually performed by placing a threshold on

On the greatest zero of an orthogonal po

On the greatest zero of an orthogonal polynomial

✍ Géza Freud 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 335 KB