Adaptive compression of large vectors

DOI10.1090/MCOM/3203MaRDI QIDQ4586617zbMATH OpenOpenAlexFDO

Authors Steffen Börm

Publication date 30 October 2017

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.00222

zbMATH Keywords

\(\mathcal{H}^2\)-matricesadaptive approximationdata-sparse representationerror controlfinite element methodhierarchical vectorsmesh refinementPoisson equation

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Abstract: Numerical algorithms for elliptic partial differential equations frequently employ error estimators and adaptive mesh refinement strategies in order to reduce the computational cost. We can extend these techniques to general vectors by splitting the vectors into a hierarchically organized partition of subsets and using appropriate bases to represent the corresponding parts of the vectors. This leads to the concept of emph{hierarchical vectors}. A hierarchical vector with $m$ subsets and bases of rank $k$ requires $mk$ units of storage, and typical operations like the evaluation of norms and inner products or linear updates can be carried out in $mathcalO(m{k}^2)$ operations. Using an auxiliary basis, the product of a hierarchical vector and an $mathcal{H}^2$-matrix can also be computed in $mathcalO(m{k}^2)$ operations, and if the result admits an approximation with $widetildem$ subsets in the original basis, this approximation can be obtained in $mathcalO((m+widetildem)k^2)$ operations. Since it is possible to compute the corresponding approximation error exactly, sophisticated error control strategies can be used to ensure the optimal compression. Possible applications of hierarchical vectors include the approximation of eigenvectors and the solution of time-dependent problems with moving local irregularities.

Recommendations

• Construction of data-sparse \(\mathcal{H}^2\)-matrices by hierarchical compression
• \(\mathcal{H}^2\)-matrix compression
• Adaptive recompression of \(\mathcal H\)-matrices for BEM
• Compressive Algorithms—Adaptive Solutions of PDEs and Variational Problems
• Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices

Cites work

• A Convergent Adaptive Algorithm for Poisson’s Equation
• A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
• Adaptive wavelet methods for elliptic operator equations: Convergence rates
• An introduction to hierarchical matrices
• Approximation of integral operators by variable-order interpolation
• Construction and arithmetics of \(\mathcal H\)-matrices
• Data Oscillation and Convergence of Adaptive FEM
• Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
• Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates
• Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
• Error Estimates for Adaptive Finite Element Computations
• scientific article; zbMATH DE number 1227077 (Why is no real title available?)
• scientific article; zbMATH DE number 1531793 (Why is no real title available?)
• scientific article; zbMATH DE number 911319 (Why is no real title available?)
• scientific article; zbMATH DE number 6156047 (Why is no real title available?)
• Local mesh refinement in 2 and 3 dimensions
• On residual-based a posteriori error estimation in hp-FEM
• Optimality of a standard adaptive finite element method

Describes a project that uses

Uses Software

• hlib

This page was built for publication: Adaptive compression of large vectors

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