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: | |
|---|---|
| Autor corporatiu: | |
| Format: | Electronic Resource |
| Idioma: | anglès |
| Publicat: |
Pisa
Edizioni della Normale
2011.
|
| Col·lecció: | Tesi/Theses
15 |
| Matèries: | |
| Accés en línia: | Available for University of the Philippines Diliman via SpringerLink. Click here to access |