Algorithms for sparse Gaussian elimination with partial pivoting

Authors:
Andrew H Sherman
Affiliations:
Department of Computer Sciences, Painter 328, The University of Texas at Austin, Austin, TX
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1978

Citing 3
Cited 2

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting (abstract)

ACM SIGNUM Newsletter

Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4]

ACM Transactions on Mathematical Software (TOMS)
Efficient rule-based haplotyping algorithms for pedigree data

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology

Quantified Score

Hi-index	0.00

Visualization

Abstract