Structured matrix based methods for approximate polynomial GCD [electronic resource] / Paola Boito.
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...
Saved in:
Online Access: |
Full Text (via Springer) |
---|---|
Main Author: | |
Format: | Electronic eBook |
Language: | English |
Published: |
Pisa :
Edizioni della Normale,
©2011.
|
Series: | Tesi (Pisa, Italy) ;
v. 15. CRM series (Pisa, Italy) ; v. 15. |
Subjects: |
Internet
Full Text (via Springer)Online
Call Number: |
QA161.P59 B65 2011
|
---|---|
QA161.P59 B65 2011 | Available |