Recompression techniques for adaptive cross approximation
DOI10.1216/JIE-2009-21-3-331zbMATH Open1180.65162OpenAlexW2088961409MaRDI QIDQ732338FDOQ732338
Authors: Mario Bebendorf, Stefan Kunis 
Publication date: 9 October 2009
Published in: Journal of Integral Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1216/jie-2009-21-3-331
Recommendations
numerical resultssingular value decompositionalgorithmGalerkin methodadaptive cross approximationelliptic boundary value problemshierarchical matricesintegral equation methodcollocationdiscrete cosine transformChebyshev approximationNyström method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Boundary value problems for second-order elliptic equations (35J25) Boundary element methods for boundary value problems involving PDEs (65N38)
Cites Work
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Adaptive low-rank approximation of collocation matrices
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- A theory of pseudoskeleton approximations
- Approximation of boundary element matrices
- Title not available (Why is that?)
- On the fast matrix multiplication in the boundary element method by panel clustering
- Construction and arithmetics of \(\mathcal H\)-matrices
- Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation of integral operators by variable-order interpolation
- Construction of data-sparse \(\mathcal{H}^2\)-matrices by hierarchical compression
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Adaptive recompression of \(\mathcal H\)-matrices for BEM
- Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
- Hierarchical LU decomposition-based preconditioners for BEM
- May the singular integrals in BEM be replaced by zero?
Cited In (26)
- Matrix valued adaptive cross approximation
- New applications of the adaptive cross approximation in mechanical engineering
- Approximate solution of linear systems with Laplace-like operators via cross approximation in the frequency domain
- Adaptive cross approximation for ill-posed problems
- Reduced-rank approximations to the far-field transform in the gridded fast multipole method
- A geometric cross approximation method
- A fast directional algorithm for high-frequency electromagnetic scattering
- Analysis of electromagnetic non-destructive evaluation modelling using Stratton-Chu formulation-based fast algorithm
- Block-adaptive cross approximation of discrete integral operators
- Constructing nested bases approximations from the entries of non-local operators
- On the efficiency of nested GMRES preconditioners for 3D acoustic and elastodynamic \(\mathcal{H}\)-matrix accelerated boundary element methods
- Adjoint estimation using direct transcription multipliers: compressed trapezoidal method
- Adaptive cross approximation of multivariate functions
- Bi-parametric operator preconditioning
- Application of multilevel directional adaptive cross approximation technique for electromagnetic problems
- A low-rank approach to the computation of path integrals
- Application of hierarchical matrices to boundary element methods for elastodynamics based on Green's functions for a horizontally layered halfspace
- A log-linear time algorithm for the elastodynamic boundary integral equation method
- Algorithmic patterns for \(\mathcal {H}\)-matrices on many-core processors
- HODLR3D: hierarchical matrices for \(N\)-body problems in three dimensions
- A fast directional boundary element method for wideband multi-domain elastodynamic analysis
- Adaptive recompression of \(\mathcal H\)-matrices for BEM
- Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
- Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- HODLR\(d\)D: a new black-box fast algorithm for \(N\)-body problems in \(d\)-dimensions with guaranteed error bounds. Applications to integral equations and support vector machines
This page was built for publication: Recompression techniques for adaptive cross approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732338)
