Structured Matrix Based Methods for Approximate Polynomial Gcd - Paola Boito
-20% with code BOOKS
Shipping in 22-28 days
30-day return policy
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 polynomial GCD problem can be expressed in matrix form: the second part of the book focuses on this point of view ... Full description
You May Also Like
Description
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 polynomial GCD problem can be expressed in matrix form: the second part of the book focuses on this point of view and analyses the structure of the relevant matrices, such as Toeplitz, Toepliz-block and displacement structures. New algorithms for the computation of approximate polynomial GCD are presented, along with extensive numerical tests. The use of matrix structure allows, in particular, to lower the asymptotic computational cost from cubic to quadratic order with respect to polynomial degree.Â
More Information
| Author | Paola Boito |
|---|---|
| Publisher | Scuola Normale Superiore |
| Release year | 2011 |
| Cover type | Softcover |
| EAN | 9788876423802 |