Title :
On Optimal-Pivoting Algorithms in Sparse Matrices
Author :
Hsueh Hsieh ; Ghausi, M.
fDate :
1/1/1972 12:00:00 AM
Abstract :
This correspondence presents an alternate method for finding the minimum fill-in during each step of elimination for both the GaussJordan elimination and the Gaussian elimination. The correspondence also describes an improvement in sparsity in computer-aided large-network analysis by obtaining the optimal pivot at each step of elimination on sparse matrices. This proposed optimal-pivot ordering appears to lead to an overall minimum for computer storage and arithmetic operation count.
Keywords :
Computer-aided circuit analysis; Computer-aided circuit design; Sparse-matrix methods; Arithmetic; Chebyshev approximation; Circuit synthesis; Computer networks; Filters; Frequency; Network synthesis; Passband; Sparse matrices; Transfer functions;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1972.1083385
