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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Pisa :
Scuola Normale Superiore
[20..].
Cham : Springer Nature |
| Ausgabe: | 1st ed. 2011. |
| Schriftenreihe: | Theses (Scuola Normale Superiore)
15 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
L'impression du document génère xvi-199 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Structured Matrix Based Methods for Approximate Polynomial GCD, Texte imprimé, 9788876423802 |