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
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 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
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