No CrossRef data available.
Article contents
A Note on Probabilistic Analysis of a Sparse Matrix Factorization Scheme and Random Graphs
Published online by Cambridge University Press: 27 July 2009
Abstract
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.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 7 , Issue 4 , October 1993 , pp. 465 - 469
- Copyright
- Copyright © Cambridge University Press 1993