Fast Reliable Algorithms for Matrices with Structure

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.