Cargando…
Structured matrix based methods for approximate polynomial GCD
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. The first part of this book reviews the main results that have been proposed so far in the literature. As usual with polynomial computations, the poly...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2011
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-88-7642-381-9 http://cds.cern.ch/record/2023643 |