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...

Full description

Bibliographic Details

Main Author:	Boito, Paola
Corporate Author:	SpringerLink (Online service)
Resource Type:	Electronic Resource
Language:	English
Published:	Pisa Edizioni della Normale 2011.
Series:	Tesi/Theses 15
Subjects:	Mathematics. Polynomials. Electronic books.
Online Access:	Available for University of the Philippines Diliman via SpringerLink. Click here to access