Recompression techniques for adaptive cross approximation
The adaptive cross approximation method (ACA) generates low-rank approximations to suitable \(m\times n\) sub-blocks of discrete integral formulations of elliptic boundary value problems. The discretization method by which the sub-blocks are obtained from the integral operator is either the Nyström, the collocation or the Galerkin method. ACA requires \(k(m+n)\), \(k\sim|\log \varepsilon|\) (\(\varepsilon \) represents the approximation accuracy) units of storage and is generated in a purely algebraic manner using only few of matrix entries. Also it is an adaptive algorithm, i.e. the rank of approximation is determined during the approximation. The authors present recompression techniques based on optimized singular value decomposition, Chebyshev approximation and discrete cosine transform. The required amount of storage is brought down to sublinear order \(kk'\), where \(k'\) depends logarithmically on \(\varepsilon \) but is independent of the matrix size. Numerical results support the derived estimates.
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
- Adaptive low-rank approximation of collocation matrices
- Adaptive recompression of \(\mathcal H\)-matrices for BEM
- Approximation of boundary element matrices
- Approximation of integral operators by variable-order interpolation
- Construction and arithmetics of \(\mathcal H\)-matrices
- Construction of data-sparse \(\mathcal{H}^2\)-matrices by hierarchical compression
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Hierarchical LU decomposition-based preconditioners for BEM
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- May the singular integrals in BEM be replaced by zero?
- On the fast matrix multiplication in the boundary element method by panel clustering
- Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
- Adjoint estimation using direct transcription multipliers: compressed trapezoidal method
- Application of multilevel directional adaptive cross approximation technique for electromagnetic problems
- A log-linear time algorithm for the elastodynamic boundary integral equation method
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- On the efficiency of nested GMRES preconditioners for 3D acoustic and elastodynamic \(\mathcal{H}\)-matrix accelerated boundary element methods
- Bi-parametric operator preconditioning
- Block-adaptive cross approximation of discrete integral operators
- Bivariate Hermite interpolation by a limiting case of the cross approximation algorithm
- Approximate solution of linear systems with Laplace-like operators via cross approximation in the frequency domain
- A fast directional boundary element method for wideband multi-domain elastodynamic analysis
- A low-rank approach to the computation of path integrals
- Algorithmic patterns for \(\mathcal {H}\)-matrices on many-core processors
- Application of hierarchical matrices to boundary element methods for elastodynamics based on Green's functions for a horizontally layered halfspace
- Adaptive cross approximation for ill-posed problems
- Matrix valued adaptive cross approximation
- New applications of the adaptive cross approximation in mechanical engineering
- Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
- Constructing nested bases approximations from the entries of non-local operators
- A geometric cross approximation method
- Analysis of electromagnetic non-destructive evaluation modelling using Stratton-Chu formulation-based fast algorithm
- Reduced-rank approximations to the far-field transform in the gridded fast multipole method
- A fast directional algorithm for high-frequency electromagnetic scattering
- Adaptive recompression of \(\mathcal H\)-matrices for BEM
- Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs
- HODLRdD: 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
- HODLR3D: hierarchical matrices for N-body problems in three dimensions
- Uniform \(\mathcal{H}\)-matrix compression with applications to boundary integral equations
- Graph Laplacian-based Bayesian multi-fidelity modeling
- Adaptive cross approximation of multivariate functions
- A comparison study of graph Laplacian computation
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)
