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...
| Κύριος συγγραφέας: | |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Pisa :
Edizioni della Normale,
2011.
|
| Σειρά: | Tesi/Theses ;
15 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
