Výsledky vyhledávání - "pass-efficient algorithm"

Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation

Autoři: Yu, Wenjian Gu, Yu Li, Yaohang

Zdroj: SIAM Journal on Matrix Analysis and Applications. 39:1339-1359

Témata: FOS: Computer and information sciences, Randomized algorithm, Computer Sciences, Theory and Algorithms, Pass-efficient algorithm, Low-rank matrix approximation, Numerical Analysis (math.NA), 01 natural sciences, Fixed-precision problem, 15A18, 65F30, 65F15, 68W20, 60B20, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Adaptive rank determination, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Distributed, Parallel, and Cluster Computing (cs.DC), 0101 mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1606.09402
http://arxiv.org/abs/1606.09402
http://doi.org/10.1137/17M1141977
https://dblp.uni-trier.de/db/journals/siammax/siammax39.html#YuGL18
https://doi.org/10.1137/17M1141977
https://epubs.siam.org/doi/pdf/10.1137/17M1141977
https://digitalcommons.odu.edu/mathstat_fac_pubs/190/

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

Autoři: Halko, N. Martinsson, P. G. Tropp, J. A.

Zdroj: SIAM Review. 53:217-288

Témata: Johnsonâ€' Lindenstrauss lemma, dimension reduction, principal component analysis, interpolative decomposition, Probability (math.PR), singular value decomposition, random matrix, Numerical Analysis (math.NA), eigenvalue decomposition, rank-revealing QR factorization, 01 natural sciences, matrix approximation, randomized algorithm, pass-efficient algorithm, parallel algorithm, streaming algorithm, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, Mathematics - Probability

Přístupová URL adresa: https://authors.library.caltech.edu/27399/1/Halko2011p16112SIAM_Review.pdf
http://arxiv.org/abs/0909.4061

Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions

Autoři: N. Halko P. G. Martinsson The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: N. Halko P. G. Martinsson The Pennsylvania State University CiteSeerX Archives

Zdroj: http://users.cms.caltech.edu/~jtropp/papers/HMT11-Finding-Structure-SIREV.pdf.

Témata: Key words. dimension reduction, eigenvalue decomposition, interpolative decomposition, Johnson– Lindenstrauss lemma, matrix approximation, parallel algorithm, pass-efficient algorithm, principal component analysis, randomized algorithm, random matrix, rank-rev

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.2800

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.2800
http://users.cms.caltech.edu/~jtropp/papers/HMT11-Finding-Structure-SIREV.pdf