论文信息 - A Note on Probabilistic Analysis of a Sparse Matrix Factorization Scheme and Random Graphs

A Note on Probabilistic Analysis of a Sparse Matrix Factorization Scheme and Random Graphs

Known results in random graph theory lead easily to a quantitative result on the number of multiplications needed in a matrix factorization algorithm, under the assumption that non-zero entries are randomly distributed.

David Aldous

[1] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[2] Joseph W. H. Liu,et al. The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[3] Béla Bollobás,et al. Random Graphs , 1985 .

[4] D. Rose,et al. Generalized nested dissection , 1977 .