Efficient sparse matrix factorization for circuit simulation on vector supercomputers
Ponnuswamy Sadayappan, V. Visvanathan · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1989
An efficient approach to sparse matrix factorization on vector supercomputers is described. The approach is suitable for application domains like circuit simulation that require the repeated direct solution of sparse linear systems of equations with identical zero-nonzero structures. An overlap-scatter data structure is used to represent the sparse matrix, enabling the use of multiple operand access modes to achieve higher performance than earlier proposed approaches. The superior performance of the new solver is demonstrated using a number of matrices derived from circuit simulation runs.>
Cited by 17 works. doi:10.1109/43.44508
Authors
References
- Direct Methods for Sparse Matrices
- Squeezing the most out of an algorithm in CRAY FORTRAN
- Computer Methods for Circuit Analysis and Design
- Algorithms for ASTAP--A network-analysis program
- Storing a sparse table
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- Direct Methods for Sparse Matrices
- Yale Sparse Matrix Package. II. The Nonsymmetric Codes
- MA28: a set of Fortran subroutines for sparse unsymmetric linear equations
- Parallel implementation of multifrontal schemes