Pages that link to "Item:Q4584924"

The following pages link to Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation (Q4584924):

Displaying 32 items.

• Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation (Q413911) (← links)
• Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification (Q2026637) (← links)
• Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation (Q2027783) (← links)
• Randomized block Krylov subspace methods for trace and log-determinant estimators (Q2045172) (← links)
• Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions (Q2093707) (← links)
• Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems (Q2129320) (← links)
• Learning mean-field equations from particle data using WSINDy (Q2167982) (← links)
• Randomized QLP decomposition (Q2176120) (← links)
• (Q4614124) (← links)
• Reliable Krylov-based algorithms for matrix null space and rank (Q4657312) (← links)
• Efficient Algorithms for Eigensystem Realization Using Randomized SVD (Q4997845) (← links)
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024) (← links)
• (Q5075778) (← links)
• Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation (Q5094223) (← links)
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
• Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction (Q5112642) (← links)
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations (Q5137221) (← links)
• Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
• Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction (Q5241244) (← links)
• Compressing Rank-Structured Matrices via Randomized Sampling (Q5739955) (← links)
• A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation (Q5863873) (← links)
• An efficient randomized QLP algorithm for approximating the singular value decomposition (Q6052614) (← links)
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
• Pass-efficient randomized LU algorithms for computing low-rank matrix approximation (Q6073724) (← links)
• An efficient randomized fixed-precision algorithm for tensor singular value decomposition (Q6085323) (← links)
• Randomized Low-Rank Approximation for Symmetric Indefinite Matrices (Q6094751) (← links)
• Fast randomized numerical rank estimation for numerically low-rank matrices (Q6154411) (← links)
• A fast randomized algorithm for computing an approximate null space (Q6161581) (← links)
• RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors (Q6549553) (← links)
• SVD-based algorithms for fully-connected tensor network decomposition (Q6563146) (← links)
• An L-DEIM induced high order tensor interpolatory decomposition (Q6591530) (← links)
• SVD-based algorithms for tensor wheel decomposition (Q6624467) (← links)