Pages that link to "Item:Q3624872"
From MaRDI portal
The following pages link to Relative-Error $CUR$ Matrix Decompositions (Q3624872):
Displaying 50 items.
- CUR matrix decompositions for improved data analysis (Q134075) (← links)
- Fast quantum algorithms for least squares regression and statistic leverage scores (Q507434) (← links)
- Faster least squares approximation (Q623334) (← links)
- Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma (Q639988) (← links)
- Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
- Generalizing the column-row matrix decomposition to multi-way arrays (Q977471) (← links)
- Random projections for the nonnegative least-squares problem (Q1030739) (← links)
- Pseudo-skeleton approximations with better accuracy estimates (Q1675666) (← links)
- Randomized LU decomposition (Q1690696) (← links)
- Random sampling of bandlimited signals on graphs (Q1690709) (← links)
- Regression-aware decompositions (Q1736216) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
- Geometric component analysis and its applications to data analysis (Q2036489) (← links)
- An extended DEIM algorithm for subset selection and class identification (Q2051261) (← links)
- Hybrid CUR-type decomposition of tensors in the Tucker format (Q2114105) (← links)
- Spectral estimation from simulations via sketching (Q2133499) (← links)
- An efficient, memory-saving approach for the Loewner framework (Q2144964) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Perspectives on CUR decompositions (Q2300772) (← links)
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← links)
- Efficient algorithms for CUR and interpolative matrix decompositions (Q2363512) (← links)
- Optimal subsampling for softmax regression (Q2423180) (← links)
- Relaxed leverage sampling for low-rank matrix completion (Q2628266) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Randomized generalized singular value decomposition (Q2667344) (← links)
- Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases (Q2683419) (← links)
- Generalized pseudoskeleton decompositions (Q2689153) (← links)
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition (Q2699387) (← links)
- Summarization and Search Over Geometric Spaces (Q2807067) (← links)
- A DEIM Induced CUR Factorization (Q2810324) (← links)
- The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation (Q2818274) (← links)
- Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← links)
- 6 The Loewner framework for system identification and reduction (Q3384276) (← links)
- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores (Q3452567) (← links)
- (Q4558165) (← links)
- (Q4558476) (← links)
- (Q4558555) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- Literature survey on low rank approximation of matrices (Q4603753) (← links)
