DocumentCode
1173723
Title
An optimal pivoting order for the solution of sparse systems of equations
Author
Nakhla, M. ; Singhal, K. ; Vlach, J.
Volume
21
Issue
2
fYear
1974
fDate
3/1/1974 12:00:00 AM
Firstpage
222
Lastpage
225
Abstract
Analytic expressions for finding fill-in, the number of nonzero elements that change in value, and the number of "long operations" during each step of the LU decomposition are given. A new optimal pivot ordering algorithm is proposed which leads to a reduction of the overall fill-in and long operation count. Comparison is made with two other known algorithms.
Keywords
Computation and optimization algorithms; Circuit theory; Councils; Matrix decomposition; Microwave theory and techniques; Minimization; Nonlinear equations; Roundoff errors; Sparse matrices;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1974.1083827
Filename
1083827
Link To Document