Extended companion matrix for approximate GCD

Authors:
Paola Boito;Olivier Ruatta
Affiliations:
Université de Limoges - CNRS, Limoges, CEDEX;Université de Limoges - CNRS, Limoges, CEDEX
Venue:
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Year:
2012

Citing 14
Cited 0

Polynomial roots from companion matrix eigenvalues

Mathematics of Computation
Fast Gaussian elimination with partial pivoting for matrices with displacement structure

Mathematics of Computation
Displacement structure: theory and applications

SIAM Review
The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Stable and Efficient Algorithms for Structured Systems of Linear Equations

SIAM Journal on Matrix Analysis and Applications
On approximate GCDs of univariate polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
When are two numerical polynomials relatively prime?

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Polynomials and Linear Control Systems

Polynomials and Linear Control Systems
An iterated eigenvalue algorithm for approximating roots of univariate polynomials

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Relations between roots and coefficients, interpolation and application to system solving

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
A fast solver for linear systems with displacement structure

Numerical Algorithms
QR factoring to compute the GCD of univariate approximate polynomials

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]/(f). In particular, the structure of the null space of the multiplication matrix contains all the essential information about GCD(f, g). Moreover, the multiplication matrix exhibits a displacement structure that allows us to design a fast algorithm for approximate GCD computation with quadratic complexity w.r.t. polynomial degrees.