๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Approximate GCDs of Univariate Polynomials

โœ Scribed by N.K. Karmarkar; Y.N. Lakshman

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
403 KB
Volume
26
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 greatest common divisor, one might now try to compute a pair of polynomials with a non-trivial common divisor close to the input polynomials. We consider the problem of finding approximate common divisors in the context of inexactly specified polynomials. We develop efficient algorithms for the so-called nearest common divisor problem and several of its variants.

๐Ÿ“œ SIMILAR VOLUMES

A Note on Approximation by Bernstein Pol
A Note on Approximation by Bernstein Polynomials
โœ T.F. Xie; S.P. Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 161 KB

By establishing an identity for \(S_{n}(x):=\sum_{j=0}^{n}|j / n-x|\left({ }_{j}^{n}\right) x^{j}(1-x)^{n-j}\), the present paper shows that a pointwise asymptotic estimate cannot hold for \(S_{n}(x)\), and, at the same time, obtains a better result than that in Bojanic and Cheng [3]. 1993 Academic

Another Note on Polynomial vs Rational A
Another Note on Polynomial vs Rational Approximation
โœ Boris Shekhtman ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

Let E be a subspace of C(X) and let R(E)= gร‚h: g, h # E ; h>0]. We make a simple, yet intriguing observation: if zero is a best approximation to f from E, then zero is a best approximation to f from R(E ). We also prove that if That extends the results of P. Borwein and S. Zhou who proved it for t