T. Kailath and A. H. Sayed, Editors
This book is the first to pay special attention to the combined issues of speed and numerical reliability in algorithm development. These two requirements have often been regarded as competitive, so much so that the design of fast and numerically reliable algorithms for large-scale structured systems of linear equations, in many cases, remains a significant open issue. Fast Reliable Algorithms for Matrices with Structure helps bridge this gap by providing the reader with recent contributions written by leading experts in the field.
The authors deal with both the theory and the practice of fast numerical algorithms for large-scale structured linear systems. Each chapter covers in detail different aspects of the most recent trends in the theory of fast algorithms, with emphasis on implementation and application issues. Both direct and iterative methods are covered.
This book is not merely a collection of articles. The editors have gone to considerable lengths to blend the individual papers into a consistent presentation. Each chapter exposes the reader to some of the most recent research while providing enough background material to put the work into proper context.
Engineers with interest in fast computational methods, especially for large-scale design problems in signal processing, estimation, control, system identification, and adaptive systems, will find the book essential. Applied mathematicians, numerical analysts, and computer scientists will want this book in their libraries.
Contributors; Preface; Notation; Chapter 1: Displacement Structure and Array Algorithms, Thomas Kailath; Chapter 2: Stabilized Schur Algorithms, Shivkumar Chandrasekaran and Ali H. Sayed; Chapter 3: Fast Stable Solvers for Structured Linear Systems, Ali H. Sayed and Shivkumar Chandrasekaran; Chapter 4: Stability of Fast Algorithms for Structured Linear Systems, Richard P. Brent; Chapter 5: Iterative Methods for Linear Systems with Matrix Structure, Raymond H. Chan and Michael K. Ng; Chapter 6: Asymptotic Spectral Distribution of Toeplitz-Related Matrices, Paolo Tilli; Chapter 7: Newton's Iteration for Structured Matrices, Victor Y. Pan, Sheryl Branham, Rhys E. Rosholt, and Ai-Long Zheng; Chapter 8: Fast Algorithms with Applications to Markov Chains and Queueing Models, Dario A. Bini and Beatrice Meini; Chapter 9: Tensor Displacement Structures and Polyspectral Matching, Victor S. Grigorascu and Phillip A. Regalia; Chapter 10: Minimal Complexity Realization of Structured Matrices, Patrick Dewilde; Appendix A: Useful Matrix Results, Thomas Kailath and Ali H. Sayed; Appendix B: Elementary Transformations, Thomas Kailath and Ali H. Sayed; Bibliography; Index.
1999 / xvi + 342 pages / Softcover / ISBN-13: 978-0-898714-31-9 / ISBN-10: 0-89871-431-1
List Price $94.00 / Member Price $65.80 / Order Code OT67