# Generalized companion matrix for approximate GCD

* Corresponding author
1 DMI
XLIM - XLIM
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 $g$in the quotient ring $\mathbb{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.
keyword :
Document type :
Reports
Domain :

Cited literature [12 references]

https://hal.archives-ouvertes.fr/hal-00564448
Contributor : Olivier Ruatta Connect in order to contact the contributor
Submitted on : Tuesday, February 8, 2011 - 10:42:36 PM
Last modification on : Wednesday, October 20, 2021 - 1:31:17 AM
Long-term archiving on: : Monday, May 9, 2011 - 3:25:10 AM

### Files

Paola8.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00564448, version 1

### Citation

Paola Boito, Olivier Ruatta. Generalized companion matrix for approximate GCD. 2011. ⟨hal-00564448⟩

Record views