Low-rank approximation of parameter-dependent matrices via CUR decomposition

Low-rank approximation of parameter-dependent matrices via CUR decomposition

A low-rank approximation of a parameter-dependent matrix A(t) is an important task in the computational sciences appearing for example in dynamical systems and compression of a series of images. In this work, we introduce AdaCUR, an efficient algorithm for computing a low-rank approximation of param...

Full description

Bibliographic Details
Main Authors:	Park, T, Nakatsukasa, Y
Format:	Journal article
Language:	English
Published:	Society for Industrial and Applied Mathematics 2025

Similar Items

Accuracy and stability of CUR decompositions with oversampling
by: Park, T, et al.
Published: (2024)

Randomized low-rank approximation for symmetric indefinite matrice
by: Taejun, P, et al.
Published: (2023)

CUR Decompositions, Similarity Matrices, and Subspace Clustering
by: Akram Aldroubi, et al.
Published: (2019-01-01)

Fast randomized numerical rank estimation for numerically low-rank matrices
by: Meier, M, et al.
Published: (2024)

Robust Generalized Low Rank Approximations of Matrices.
by: Jiarong Shi, et al.
Published: (2015-01-01)

rCUR: an R package for CUR matrix decomposition
by: Bodor András, et al.
Published: (2012-05-01)

Quantum singular-value decomposition of nonsparse low-rank matrices
by: Rebentrost, Frank, et al.
Published: (2018)

Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
by: Saunderson, James F., et al.
Published: (2013)

Efficient Blind Hyperspectral Unmixing Framework Based on CUR Decomposition (CUR-HU)
by: Muhammad A. A. Abdelgawad, et al.
Published: (2024-02-01)

A low-rank approximation of tensors and the topological group structure of invertible matrices
by: R.N. Gumerov, et al.
Published: (2018-12-01)

Low-Rank Approximation of Difference between Correlation Matrices Using Inner Product
by: Kensuke Tanioka, et al.
Published: (2021-05-01)

Face Identification With Top-Push Constrained Generalized Low-Rank Approximation of Matrices
by: Yuanjian Chen, et al.
Published: (2019-01-01)

On orthogonal tensors and best rank-one approximation ratio
by: Li, Z, et al.
Published: (2018)

Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
by: Batselier, Kim, et al.
Published: (2019)

Energy-Based Adaptive CUR Matrix Decomposition
by: Liwen Xu, et al.
Published: (2023-01-01)

Efficient algorithms for cur and interpolative matrix decompositions
by: Voronin, S, et al.
Published: (2016)

Missing Data Recovery Based on Tensor-CUR Decomposition
by: Lele Wang, et al.
Published: (2018-01-01)

Constant Modulus Algorithms via Low-Rank Approximation
by: Adler, Amir, et al.
Published: (2018)

Tensor Completion via Smooth Rank Function Low-Rank Approximate Regularization
by: Shicheng Yu, et al.
Published: (2023-08-01)

A backward stable algorithm for computing the CS decomposition via the Polar decomposition
by: Gawlik, E, et al.
Published: (2018)

Adaptive System Identification via Low-Rank Tensor Decomposition
by: Christina Auer, et al.
Published: (2021-01-01)

A higher-order generalized singular value decomposition for rank-deficient matrices
by: Kempf, I, et al.
Published: (2023)

Generalized Low-Rank Approximations
by: Srebro, Nathan, et al.
Published: (2004)

Finding a low-rank basis in a matrix subspace
by: Nakatsukasa, Y, et al.
Published: (2016)

Low-rank approximation for underwater drone localization
by: Goo-Jung Park, et al.
Published: (2024-02-01)

CUR decomposition for compression and compressed sensing of large-scale traffic data
by: Mitrovic, Nikola, et al.
Published: (2014)

Hyperspectral Superresolution Reconstruction via Decomposition of Low-Rank and Sparse Tensor
by: Huajing Wu, et al.
Published: (2022-01-01)

Fabric Defect Detection via Low-Rank Decomposition With Gradient Information
by: Boshan Shi, et al.
Published: (2019-01-01)

Sparse and low-rank matrix decompositions
by: Chandrasekaran, Venkat, et al.
Published: (2010)

Ranks of permutative matrices
by: Hu Xiaonan, et al.
Published: (2016-06-01)

Learning-based low-rank approximations
by: Indyk, Piotr
Published: (2021)

Randomized Rank-Revealing QLP for Low-Rank Matrix Decomposition
by: Maboud F. Kaloorazi, et al.
Published: (2023-01-01)

A fast randomized algorithm for computing an approximate null space
by: Park, T, et al.
Published: (2023)

Rational minimax approximation via adaptive barycentric representations
by: Filip, S, et al.
Published: (2018)

On computation of real eigenvalues of matrices via the Adomian decomposition
by: Hooman Fatoorehchi, et al.
Published: (2014-04-01)

Fast Eigenvalue Decomposition of Arrowhead and Diagonal-Plus-Rank-<i>k</i> Matrices of Quaternions
by: Thaniporn Chaysri, et al.
Published: (2024-04-01)

Approximation Algorithms via Contraction Decomposition
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2011)

Efficient enhancement of low-rank tensor completion via thin QR decomposition
by: Yan Wu, et al.
Published: (2024-07-01)

Hyperspectral Super-Resolution Via Joint Regularization of Low-Rank Tensor Decomposition
by: Meng Cao, et al.
Published: (2021-10-01)

Nonnegative Tensor Completion via Low-Rank Tucker Decomposition: Model and Algorithm
by: Bilian Chen, et al.
Published: (2019-01-01)