Towards a fast implementation of spectral nested dissection
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- The Role of Elimination Trees in Sparse FactorizationSIAM Journal on Matrix Analysis and Applications, 1990
- A Fast Algorithm for Reordering Sparse Matrices for Parallel FactorizationSIAM Journal on Scientific and Statistical Computing, 1989
- The Minimum Degree Ordering with ConstraintsSIAM Journal on Scientific and Statistical Computing, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Progress in Sparse Matrix Methods for Large Linear Systems On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- On estimating the largest eigenvalue with the Lanczos algorithmMathematics of Computation, 1982
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973