2022/08/03 by Perfect Y. Gidisu, Gidisu, Perfect Y., Michiel E. Hochstenbach +1
Computer Science · Engineering · Physics and Astronomy · #Electromagnetic Scattering and Analysis #Electromagnetic Simulation and Numerical Methods #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.2208.02213
openalex publication_date 2022/08/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We present 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 concept of the maximum volume of submatrices and a rank-revealing QR factorization. We also present a version of the block DEIM procedures, which allows for adaptive choice of block size. The results of the experiments indicate that the block DEIM algorithms exhibit comparable accuracy for low-rank matrix approximation compared to the standard DEIM procedure. However, the block DEIM algorithms also demonstrate potential computational advantages, showcasing increased efficiency in terms of computational time.