Cargando…

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Boito, Paola (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Pisa : Scuola Normale Superiore : Imprint: Edizioni della Normale, 2011.
Edición:1st ed. 2011.
Colección:Theses (Scuola Normale Superiore), 15
Temas:
Acceso en línea:Texto Completo