Logo - springer
Slogan - springer

Birkhäuser - Birkhäuser Mathematics - Scuola Normale Superiore | Structured Matrix Based Methods for Approximate Polynomial GCD

Structured Matrix Based Methods for Approximate Polynomial GCD

Boito, Paola

2011, 250p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$19.95

(net) price for USA

ISBN 978-88-7642-381-9

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$24.95

(net) price for USA

ISBN 978-88-7642-380-2

free shipping for individuals worldwide

online orders shipping within 2-3 days.


add to marked items

  • About this book

  • Topics situated at the crossroads between two fields of increasing interest to the mathematical community: symbolic-numeric polynomial computation and structured numerical linear algebra
  • Survey of the main tools and techniques used in either domain
  • State-of-the-art methods that exploit matrix structure to improve the performance of polynomial computations
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. 

Content Level » Research

Keywords » displacement structured matrices - polynomial computation - structured numerical linear algebra

Related subjects » Scuola Normale Superiore

Table of contents 

i. Introduction.- ii. Notation.- 1. Approximate polynomial GCD.- 2. Structured and resultant matrices.- 3. The Euclidean algorithm.- 4. Matrix factorization and approximate GCDs.- 5. Optimization approach.- 6. New factorization-based methods.- 7. A fast GCD algorithm.- 8. Numerical tests.- 9. Generalizations and further work.- 10. Appendix A: Distances and norms.- 11. Appendix B: Special matrices.- 12. Bibliography.- 13. Index.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algebra.