✦ LIBER ✦

QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients

✍ Scribed by Zarowski, C.J.; Xiaoyan Ma; Fairman, F.W.

Book ID: 118690828
Publisher: IEEE
Year: 2000
Tongue: English
Weight: 222 KB
Volume: 48
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.875462

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two methods for the calculation of the d

Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

✍ Joab R. Winkler, Madina Hasan, Xin Lao 📂 Article 📅 2012 🏛 Springer Milan 🌐 English ⚖ 998 KB

Estimation of the Greatest Common Diviso

Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method

✍ Dimitrios Christou; Marilena Mitrouli 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 146 KB

The computation of the Greatest Common Divisor (GCD) of a set of more than two polynomials is a non-generic problem. There are cases where iterative methods of computing the GCD of many polynomials, based on the Euclidean algorithm, fail to produce accurate results, when they are implemented in a so

A method for computing all the zeros of

A method for computing all the zeros of a polynomial with real coefficients

✍ T. L. Freeman 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 635 KB