for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry ...

New to eBooks.com?

Learn more

Structured Matrix Based Methods for Approximate Polynomial GCD

Structured Matrix Based Methods for Approximate Polynomial GCD by Paola Boito
Add to cart
US$ 24.95
(If any tax is payable it will be calculated and shown at checkout.)
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.
Scuola Normale Superiore; March 2012
207 pages; ISBN 9788876423819
Read online, or download in secure PDF format
Title: Structured Matrix Based Methods for Approximate Polynomial GCD
Author: Paola Boito
 
Buy, download and read Structured Matrix Based Methods for Approximate Polynomial GCD (eBook) by Paola Boito today!