Bultheel A., van Barel M.
Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padé tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algorithms for structured problems and shows how they deal with singular situations.Links are made with more applied subjects such as linear system theory and signal processing, and with more advanced topics and recent results such as general bi-orthogonal polynomials, minimal Padé approximation, polynomial root location problems in the complex plane, very general rational interpolation problems, and the lifting scheme for wavelet transform computation. The text serves as a supplement to existing books on structured linear algebra problems, rational approximation and orthogonal polynomials. |
Table of contents : sdarticle……Page 1 sdarticle2……Page 7 sdarticle3……Page 10 sdarticle4……Page 69 sdarticle5……Page 107 sdarticle6……Page 142 sdarticle7……Page 237 sdarticle8……Page 277 sdarticle9……Page 356 sdarticle10……Page 389 sdarticle11……Page 416 sdarticle12……Page 437 sdarticle13……Page 438 |
Reviews
There are no reviews yet.