DocumentCode
1173728
Title
Pivoting-order computation method for large random sparse systems
Author
Hsieh, Hsueh Y.
Volume
21
Issue
2
fYear
1974
fDate
3/1/1974 12:00:00 AM
Firstpage
225
Lastpage
230
Abstract
During each step of Gaussian elimination (GE), if ties occur for a minimum fill-in algorithm, an additional criterion is required to search for the most probable optimum pivot. Theoretical justifications for this criterion are developed. Practical rules for searching for these pivots as well as their implementation and computation results are presented for both the deterministic and probabilistic algorithms.
Keywords
Computation and optimization algorithms; Sparse-matrix methods; Algorithm design and analysis; Application software; Arithmetic; Circuit synthesis; Circuit theory; Design automation; Electronic circuits; Equations; Matrix decomposition; Sparse matrices;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1974.1083828
Filename
1083828
Link To Document