A probabilistic approach to optimal pivoting and prediction of fill-in for random sparse matrices
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
Probability, Random Variables, and Stochastic Processes.
1984 • 16,636 citations
Probability, Random Variables, and Stochastic Processes
1966 • 2,118 citations
Direct solutions of sparse network equations by optimally ordered triangular factorization
1967 • 806 citations
The Elimination form of the Inverse and its Application to Linear Programming
1957 • 513 citations
The Sparse Tableau Approach to Network Analysis and Design
1971 • 341 citations
Techniques for Exploiting the Sparsity or the Network Admittance Matrix
1963 • 118 citations
An Optimal Ordering of Electronic Circuit Equations for a Sparse Matrix Solution
1971 • 87 citations
On the Product Form of Inverses of Sparse Matrices
1966 • 32 citations
The Product Form of Inverses of Sparse Matrices and Graph Theory
1967 • 32 citations
Some Results on Sparse Matrices
1970 • 15 citations
Effective Ordering of Sparse Matrices Arising from Nonlinear Electrical Networks
1971 • 14 citations
On Optimal-Pivoting Algorithms in Sparse Matrices
1972 • 14 citations
The Gaussian elimination and sparse systems
1968 • 11 citations