Low-rank approximation of parameter-dependent matrices via CUR decomposition
From MaRDI portal
Cites work
- A DEIM induced CUR factorization
- A fast randomized algorithm for the approximation of matrices
- A Hybrid DEIM and Leverage Scores Based Method for CUR Index Selection
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations
- A projector-splitting integrator for dynamical low-rank approximation
- A rank-adaptive robust integrator for dynamical low-rank approximation
- A theory of pseudoskeleton approximations
- Accuracy and stability of CUR decompositions with oversampling
- An accelerated greedy missing point estimation procedure
- An unconventional robust integrator for dynamical low-rank approximation
- CUR matrix decompositions for improved data analysis
- Determinantal point processes in randomized numerical linear algebra
- Discretized dynamical low-rank approximation in the presence of small singular values
- Dynamical low-rank approximation: Applications and numerical experiments
- Dynamical Low‐Rank Approximation
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient algorithms for CUR and interpolative matrix decompositions
- Eigenvalues of a matrix in the streaming model
- Fast Direct Solvers for Elliptic PDEs
- Fast randomized numerical rank estimation for numerically low-rank matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improved analysis of the subsampled randomized Hadamard transform
- Improved bounds for small-sample estimation
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Low-rank approximation and regression in input sparsity time
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Low-rank dynamics
- Low-rank parareal: a low-rank parallel-in-time integrator
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Matrix Analysis
- Matrix approximation and projective clustering via volume sampling
- Near-optimal column-based matrix reconstruction
- Nearly tight oblivious subspace embeddings by trace inequalities
- Nonlinear model reduction via discrete empirical interpolation
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- Optimal CUR matrix decompositions
- OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
- Perspectives on CUR decompositions
- Perturbations of CUR Decompositions
- Practical sketching algorithms for low-rank matrix approximation
- Randomized low-rank approximation of parameter-dependent matrices.
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Rank-adaptive dynamical low-rank integrators for first-order and second-order matrix differential equations
- Rank-adaptive structure-preserving model order reduction of Hamiltonian systems
- Relative-Error CUR Matrix Decompositions
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Sketching as a tool for numerical linear algebra
- Stability of discrete empirical interpolation and gappy proper orthogonal decomposition with randomized and deterministic sampling points
- Sublinear randomized algorithms for skeleton decompositions
- Twice-Ramanujan sparsifiers
- Why Are Big Data Matrices Approximately Low Rank?
Cited in
(2)
This page was built for publication: Low-rank approximation of parameter-dependent matrices via CUR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972300)
