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...
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 |
Ejemplares similares
-
Shape-Preserving Approximation by Real and Complex Polynomials
por: Gal, Sorin G.
Publicado: (2008) -
Solving Polynomial Equations Foundations, Algorithms, and Applications /
Publicado: (2005) -
Diophantine Approximation Festschrift for Wolfgang Schmidt /
Publicado: (2008) -
Algorithms for Quadratic Matrix and Vector Equations
por: Poloni, Federico
Publicado: (2011) -
Mixed Hodge Structures
por: Peters, Chris A.M, et al.
Publicado: (2008)