Block classical Gram–Schmidt-based block updating in low-rank matrix approximation
From MaRDI portal
Publication:5742723
DOI10.3906/mat-1707-14zbMath1424.65049OpenAlexW2883682751MaRDI QIDQ5742723
Cenker Biçer, Fahrettin Horasan, Fatih Varçin, Hasan Erbay
Publication date: 8 May 2019
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1707-14
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Low-rank revealing \(UTV\) decompositions
- Latent semantic indexing: A probabilistic analysis
- Reorthogonalized block classical Gram-Schmidt
- Fast low-rank modifications of the thin singular value decomposition
- Improved Gram-Schmidt type downdating methods
- Modifiable low-rank approximation to a matrix
- Authoritative sources in a hyperlinked environment
- A set of level 3 basic linear algebra subprograms
- Understanding Search Engines
- Accuracy and Stability of Numerical Algorithms
- Using Linear Algebra for Intelligent Information Retrieval
- Block Gram–Schmidt Orthogonalization
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- The Rotation of Eigenvectors by a Perturbation. III
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Block classical Gram–Schmidt-based block updating in low-rank matrix approximation