Linear-time CUR approximation of BEM matrices

DOI10.1016/J.CAM.2019.112528MaRDI QIDQ2292005zbMATH OpenOpenAlexWikidataFDO

Authors Alan Ayala, Xavier Claeys, Laura Grigori

Publication date 31 January 2020

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01893036/file/RR-9208.pdf

zbMATH Keywords

linear-time algorithmsadaptive cross approximation (ACA)BEM matricesCUR approximation

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Boundary element methods for boundary value problems involving PDEs (65N38) Orthogonalization in numerical linear algebra (65F25) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• A geometric mapping cross approximation method
• A DEIM induced CUR factorization
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• A geometric cross approximation method
• Approximation of boundary element matrices

Cites work

• scientific article; zbMATH DE number 3141674 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 5485566 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A fast algorithm for particle simulations
• ALORA: affine low-rank approximations
• Accuracy and Stability of Numerical Algorithms
• An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
• An improved approximation algorithm for the column subset selection problem
• Approximation of boundary element matrices
• Bounds on singular values revealed by QR factorizations
• CUR matrix decompositions for improved data analysis
• Communication avoiding rank revealing QR factorization with column pivoting
• Communication-optimal parallel and sequential QR and LU factorizations
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Efficient algorithms for CUR and interpolative matrix decompositions
• Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
• Exponential inapproximability of selecting a maximum volume sub-matrix
• Far-field compression for fast kernel summation methods in high dimensions
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Hierarchical matrices: algorithms and analysis
• How to find a good submatrix
• Literature survey on low rank approximation of matrices
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• Matrix approximation and projective clustering via volume sampling
• Numerical Approximation Methods for Elliptic Boundary Value Problems
• Pseudo-skeleton approximations with better accuracy estimates
• Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• Sublinear randomized algorithms for skeleton decompositions
• The black-box fast multipole method
• The maximal-volume concept in approximation by low-rank matrices

Cited in

(3)

• BESLE: boundary element software for 3D linear elasticity
• Randomized recompression of \(\mathcal {H}\)-matrices for BEM
• Hybrid CUR-type decomposition of tensors in the Tucker format

Describes a project that uses

Uses Software

• hlib
• mctoolbox

This page was built for publication: Linear-time CUR approximation of BEM matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292005)