A new O(n log n) scheduling heuristic for parallel decomposition of sparse matrices

Publisher Website

10 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

https://doi.org/10.1109/iccd.1991.139985

Abstract

No abstract available

Keywords

This publication has 2 references indexed in Scilit:

Efficient sparse matrix factorization for circuit simulation on vector supercomputers
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
Optimal parallel triangulation of a sparse matrix
IEEE Transactions on Circuits and Systems, 1979