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

Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation Autor Yu, Wenjian, Gu, Yu, Li, Yaohang

Získat plný text

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions Autor Halko, N., Martinsson, P. G., Tropp, J. A.

“…Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data…”
Získat plný text

Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds Autor Witten, Rafi, Candès, Emmanuel

“…The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense…”
Získat plný text

A Randomized Algorithm for Tensor Singular Value Decomposition Using an Arbitrary Number of Passes Autor Ahmadi-Asl, Salman, Phan, Anh-Huy, Cichocki, Andrzej

“…Efficient and fast computation of a tensor singular value decomposition (t-SVD) with a few passes over the underlying data tensor is crucial because of its…”
Získat plný text