Block Discrete Empirical Interpolation Methods

08/03/2022
by   Perfect Y. Gidisu, et al.
0

We present two block variants of the discrete empirical interpolation method (DEIM); as a particular application, we will consider a CUR factorization. The block DEIM algorithms are based on the rank-revealing QR factorization and the concept of the maximum volume of submatrices. We also present a version of the block DEIM procedures, which allows for adaptive choice of block size. Experiments demonstrate that the block DEIM algorithms may provide a better low-rank approximation, and may also be computationally more efficient than the standard DEIM procedure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2023

Butterfly factorization by algorithmic identification of rank-one blocks

Many matrices associated with fast transforms posess a certain low-rank ...
research
05/03/2015

Structured Block Basis Factorization for Scalable Kernel Matrix Evaluation

Kernel matrices are popular in machine learning and scientific computing...
research
09/13/2021

ℋ-inverses for RBF interpolation

We consider the interpolation problem for a class of radial basis functi...
research
02/21/2018

Direct Learning to Rank and Rerank

Learning-to-rank techniques have proven to be extremely useful for prior...
research
02/26/2023

Large-Block Modular Addition Checksum Algorithms

Checksum algorithms are widely employed due to their use of a simple alg...
research
08/12/2022

Parallel QR Factorization of Block Low-Rank Matrices

We present two new algorithms for Householder QR factorization of Block ...
research
05/01/2023

Robust Low-Tubal-rank tensor recovery Using Discrete Empirical Interpolation Method with Optimized Slice/Feature Selection

In this paper, we extend the Discrete Empirical Interpolation Method (DE...

Please sign up or login with your details

Forgot password? Click here to reset