Polynomials defined on Rings with FLINT has gcd/xgcd method function well implemented, and internally uses half-gcd algorithm as well for fast calculation. However, if the modulus exceeds 2^63 - 1, ...

Abstract: In this paper, a new characterisation of the approximate GCD of many polynomials is given that also allows the evaluation of accuracy of the corresponding ‘approximate GCD computation’. This ...

Abstract: The paper presents a new numerical method for the computation of the greatest common divisor (GCD) of an m-set of polynomials of R[s], P/sub m,d/, of maximal degree d. It is based on a ...

This issue is to keep track of making improvements to gcd calculations with sparse polynomials. Currently sparse polynomial gcd is slow particularly when there are many generators. You can read more ...

Structured low-rank approximation (SLRA) is a mathematical framework that seeks to approximate a given data matrix by another matrix of lower rank while preserving intrinsic structural properties.

SIAM Journal on Numerical Analysis, Vol. 36, No. 4 (May - Jun., 1999), pp. 1022-1029 (8 pages) An algorithm for the calculation of the maximum modulus of a complex polynomial on the unit disc is ...

The goal of this paper is to obtain some comparison inequalities for a linear operator between polynomials in the plane. The polynomials under study have constraints on their zeros and the estimates ...