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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Pisa :
Edizioni della Normale,
2011.
|
| Series: | Tesi/Theses ;
15. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Internet
Connect to the full text of this electronic bookAvailable Online
| Call Number: |
QA150-272 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA150-272 | Available | |