Structured matrices and polynomials : unified superfast algorithms
Author(s)
Bibliographic Information
Structured matrices and polynomials : unified superfast algorithms
Birkhäuser , Springer, c2001
Available at 7 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [243]-270) and index
Description and Table of Contents
Description
This user-friendly, engaging textbook makes the material accessible to graduate students and new researchers who wish to study the rapidly exploding area of computations with structured matrices and polynomials. The book goes beyond research frontiers and, apart from very recent research articles, includes previously unpublished results.
Table of Contents
Preface * Glossary of Mathematical Notation * 1. Computations with Structured Matrices: Introduction * 2. Toeplitz/Hankel Matrix Structure and Polynomial Computations * 3. Matrix Structures of Vandermonde and Cauchy Types and Polynomial and Rational Computations * 4. Structured Matrices and Displacement Operators * 5. Unified Superfast Divide-and-Conquer Algorithms for Structured Matrices * 6. Newton-Structured Numerical Iteration * 7. Newton Algebraic Iteration and Newton-Structured Algebraic Iteration * Conclusion * Bibliography * Index
by "Nielsen BookData"