An Optimal Pivoting Order for the Solution of Sparse Systems of Equations
- Nakhla, M.S. (Michel S.)
- Singhal, K.
- Vlach, J.
Publication date
January 1974
DOI Publisher
Institute of Electrical and Electronics Engineers (IEEE)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 L U 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
Add to ORKG