Načítá se...
Randomized algorithms for the low-rank approximation of matrices
We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application (inter alia) to the evaluation of the singular value decompositions of numerically low-rank matrices. Being probabilistic, the schemes described here...
Uloženo v:
| Hlavní autoři: | , , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
National Academy of Sciences
2007
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2154402/ https://ncbi.nlm.nih.gov/pubmed/18056803 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0709640104 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|