Estimation of singular values of very large matrices using random sampling

Computers and Mathematics with Applications

Volumn 42, Issue 10-11, 2001, Pages 1331-1352

  Kobayashi, M ^a   Dupret, G ^a,b   King, O ^a,c   Samukawa, H ^a  

^a IBM JAPAN LTD   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Artificial neural networks; Random sampling; Randomized algorithms; Singular value decomposition; SVD

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA MINING; ESTIMATION; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; NEURAL NETWORKS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

RANDOM SAMPLING; RANDOMIZED ALGORITHMS; SINGULAR VALUE DECOMPOSITION;

MATRIX ALGEBRA;

EID: 0035500334     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(01)00244-9     Document Type: Article

References (36)

1. On the early history of the singular value decomposition
2. Using linear algebra for intelligent information retrieval
3. Information retrieval and ranking on the web: Benchmarking studies I
4. Information retrieval and ranking on the web: Benchmarking studies II
5. Multi-perspective retrieval, ranking and visualization of web data
6. A fast Monte-Carlo test for primality
7. Probabilistic algorithms
8. An introduction to randomized algorithms
9. An introduction to neural computing
10. Nonlinear neural networks: Principles, mechanisms and architectures
11. Spatiotemporal analysis and forecasting: Identical units artificial neural network
12. A principal axis transformation for non-Hermitian matrices
13. Indexing by latent semantic analysis
14. Improving the retrieval of information from external sources
15. Clustering algorithms
16. Fernando's solution to Wilkinson's problem: An application of double factorization
17. The Lanczos algorithm with selective orthogonalization