Linear-time CUR approximation of BEM matrices

DOI10.1016/J.CAM.2019.112528zbMATH Open1431.65022OpenAlexW2896273714WikidataQ126998189 ScholiaQ126998189MaRDI QIDQ2292005FDOQ2292005

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

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

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)

Cites Work

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

Cited In (3)

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

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)