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: | Electronic eBook |
| Language: | English |
| Published: |
Pisa :
Edizioni della Normale,
2011.
|
| Series: | Tesi/Theses ;
15 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Internet
Full Text via HEAL-LinkΒΚΠ - Πατρα: ALFd
| Call Number: |
330.01 BAU |
|---|---|
| Copy 1 | Available |
ΒΚΠ - Πατρα: BSC
| Call Number: |
330.01 BAU |
|---|---|
| Copy 2 | Available |
| Copy 3 | Available |
