JOURNAL ARTICLE
Constructing Elimination Trees for Sparse Unsymmetric Matrices
Year: 2013 Journal: SIAM Journal on Matrix Analysis and Applications Vol: 34 (2)Pages: 345-354 Publisher: Society for Industrial and Applied Mathematics
Abstract
International audience
Keywords:
Diagonal Mathematics Algorithm Matrix (chemical analysis) Sparse matrix Combinatorics Tree (set theory) Time complexity Discrete mathematics Geometry
Metrics
4
Cited By
0.62
FWCI (Field Weighted Citation Impact)
13
Refs
0.73
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
VLSI and FPGA Design Techniques
Physical Sciences → Engineering → Electrical and Electronic Engineering
Graph Theory and Algorithms
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Error Correcting Code Techniques
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
Stanley C. EisenstatJoseph W. H. Liu
Journal: SIAM Journal on Matrix Analysis and Applications Year: 2008 Vol: 29 (4)Pages: 1363-1381
JOURNAL ARTICLE
The Theory of Elimination Trees for Sparse Unsymmetric Matrices
Stanley C. EisenstatJoseph W. H. Liu
Journal: SIAM Journal on Matrix Analysis and Applications Year: 2005 Vol: 26 (3)Pages: 686-705
BOOK-CHAPTER
A Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices
Lecture notes in computer science Year: 2012 Pages: 183-193
JOURNAL ARTICLE
Elimination Structures for Unsymmetric Sparse $LU$ Factors
John R. GilbertJoseph W. H. Liu
Journal: SIAM Journal on Matrix Analysis and Applications Year: 1993 Vol: 14 (2)Pages: 334-352
JOURNAL ARTICLE
Evaluation of Orderings for Unsymmetric Sparse Matrices
A. M. ErismanRoger G. GrimesJohn G. LewisWilliam G. PooleHorst D. Simon
Journal: SIAM Journal on Scientific and Statistical Computing Year: 1987 Vol: 8 (4)Pages: 600-624