Get Free Shipping on orders over $79
Structured Matrix Based Methods for Approximate Polynomial GCD - Paola Boito

Structured Matrix Based Methods for Approximate Polynomial GCD

By: Paola Boito

eText | 13 March 2012

At a Glance

eText


$29.99

or 4 interest-free payments of $7.50 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

More in Algebra

Enriques Surfaces I - François Cossec

eTEXT

Finite Groups I - Bertram Huppert

eTEXT

$349.00

The Monodromy Group - Henryk ?o??dek

eTEXT

(Generalized) Fuzzy Matrices and Relations - Herbert Toth

eBOOK

RRP $227.07

$204.99

10%
OFF