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

Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

โœ Scribed by N. Karcanias; S. Fatouros; M. Mitrouli; G.H. Halikias


Book ID
108077027
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
789 KB
Volume
51
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The calculation of the degree of an appr
โœ 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

Estimation of the Greatest Common Diviso
โœ 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

Jacobi Polynomials, Weighted Sobolev Spa
โœ Serge Nicaise ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 332 KB

In this paper, we give some polynomial approximation results in a class of weighted Sobolev spaces, which are related to the Jacobi operator. We further give some embeddings of those weighted Sobolev spaces into usual ones and into spaces of continuous functions, in order to use the above approximat