𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computation of Approximate Polynomial GCDs and an Extension

✍ Scribed by Victor Y Pan

Book ID
112252622
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
110 KB
Volume
167
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Approximate GCDs of Univariate Polyno
On Approximate GCDs of Univariate Polynomials
✍ N.K. Karmarkar; Y.N. Lakshman πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 403 KB

In this paper, we consider computations involving polynomials with inexact coefficients, i.e. with bounded coefficient errors. The presence of input errors changes the nature of questions traditionally asked in computer algebra. For instance, given two polynomials, instead of trying to compute their

Structured total least norm and approxim
Structured total least norm and approximate GCDs of inexact polynomials
✍ Joab R. Winkler; John D. Allan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 223 KB

The determination of an approximate greatest common divisor (GCD) of two inexact polynomials f = f (y) and g = g(y) arises in several applications, including signal processing and control. This approximate GCD can be obtained by computing a structured low rank approximation S \* (f, g) of the Sylves