We derive a CUR matrix factorization based on the Discrete Empirical Interpolation Method (DEIM). For a given matrix A, such a factorization provides a low rank approximate decomposition of the form A ≈ CUR, where C and R are subsets of the columns and rows of A, and U is constructed to make CUR a good approximation. Given a low-rank singular value decomposition A ≈ VSWT, the DEIM procedure uses V and W to select the columns and rows of A that form C and R. Through an error analysis applicable to a general class of CUR factorizations, we show that the accuracy tracks the optimal approximation error within a factor that depends on the conditioning of submatrices of V and W. For large-scale problems, V and W can be approximated using an incre...
This paper presents a new approach to construct more efficient reduced-order models for nonlinear pa...
A standard algorithm for computing the QR factorization of a matrix A is Householder triangularizati...
In this paper we present an algorithm for computing a low rank approximation of a sparse matrix base...
We derive a CUR matrix factorization based on the Discrete Empirical Interpolation Method (DEIM). Fo...
We present two block variants of the discrete empirical interpolation method (DEIM); as a particular...
The manuscript describes efficient algorithms for the computation of the CUR and ID decompositions. ...
The discrete empirical interpolation method (DEIM) may be used as an index selection strategy for fo...
We propose a generalized CUR (GCUR) decomposition for matrix pairs (A,B). Given matrices A and B wit...
Low-rank approximations which are computed from selected rows and columns of a given data matrix hav...
We propose a restricted SVD based CUR (RSVD-CUR) decomposition for matrix triplets $(A, B, G)$. Give...
The CUR matrix decomposition and the Nyström approximation are two important low-rank matrix approx...
CUR matrix decomposition is a randomized algorithm that can efficiently compute the low rank approxi...
Principal components analysis and, more generally, the Singular Value Decomposition are fundamental ...
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate ...
CUR matrix decomposition computes the low rank approximation of a given matrix by using the actual r...
This paper presents a new approach to construct more efficient reduced-order models for nonlinear pa...
A standard algorithm for computing the QR factorization of a matrix A is Householder triangularizati...
In this paper we present an algorithm for computing a low rank approximation of a sparse matrix base...
We derive a CUR matrix factorization based on the Discrete Empirical Interpolation Method (DEIM). Fo...
We present two block variants of the discrete empirical interpolation method (DEIM); as a particular...
The manuscript describes efficient algorithms for the computation of the CUR and ID decompositions. ...
The discrete empirical interpolation method (DEIM) may be used as an index selection strategy for fo...
We propose a generalized CUR (GCUR) decomposition for matrix pairs (A,B). Given matrices A and B wit...
Low-rank approximations which are computed from selected rows and columns of a given data matrix hav...
We propose a restricted SVD based CUR (RSVD-CUR) decomposition for matrix triplets $(A, B, G)$. Give...
The CUR matrix decomposition and the Nyström approximation are two important low-rank matrix approx...
CUR matrix decomposition is a randomized algorithm that can efficiently compute the low rank approxi...
Principal components analysis and, more generally, the Singular Value Decomposition are fundamental ...
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate ...
CUR matrix decomposition computes the low rank approximation of a given matrix by using the actual r...
This paper presents a new approach to construct more efficient reduced-order models for nonlinear pa...
A standard algorithm for computing the QR factorization of a matrix A is Householder triangularizati...
In this paper we present an algorithm for computing a low rank approximation of a sparse matrix base...