Fast Algorithms and Scientific Computing
The following papers relate to designing fast algorithms,
based on exploiting matrix structure. The structures considered may be
used to approximate unstructured matrices to any given precision and also
arise naturally in the study of ODEs and PDEs.
The bulk of this research has resulted from the joint work of
Shivkumar Chandrasekaran at U.C. Santa Barbara (Department
of Electrical and Computer Engineering)
and Ming Gu at U.C. Berkeley (Department of Mathematics).
links
- Fast Algorithms for Spectral Collocation with Non-Periodic Boundary Conditions
pdf
- SuperFast Sparse Solvers (Presentation given at MNTS 2004)
pdf
- Superfast Nested Dissection
pdf
- A Fast and Stable Adaptive Solver for Hierarchically Semi-Separable
Representations pdf
- Fast and Stable Algorithms for Hierarchically Semiseperable
Representations pdf
- Fast and Stable Algorithms for Banded Plus Semiseperable Systems
of Linear Equations pdf
- Fast Stable Solvers for Sequentially Semiseperable Linear
Systems of Equations pdf