Structured matrix based methods for approximate polynomial GCD

Resource Information

The work Structured matrix based methods for approximate polynomial GCD represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.

Label

Structured matrix based methods for approximate polynomial GCD

Statement of responsibility

Paola Boito

Creator

• Boito, Paola

Subject

• Divisor theory
• Divisor theory
• Divisor theory
• Electronic books
• Electronic bookss
• MATHEMATICS -- Algebra | Elementary
• Mathematics.
• Polynomials
• Polynomials
• Polynomials
• Algebra.

Language

eng

Summary

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

Member of

• CRM series (Pisa, Italy), v. 15
• Tesi (Pisa, Italy), v. 15

Cataloging source

GW5XE

Dewey number

512.9/422

Index

index present

LC call number

QA161.P59

LC item number

B65 2011

Literary form

non fiction

Nature of contents

• dictionaries
• bibliography
• theses

Series statement

• Tesi=
• Theses
• CRM series

Series volume

• 15
• v. 15