Hierarchical matrix arithmetic with accumulated updates
From MaRDI portal
Abstract: Hierarchical matrices can be used to construct efficient preconditioners for partial differential and integral equations by taking advantage of low-rank structures in triangular factorizations and inverses of the corresponding stiffness matrices. The setup phase of these preconditioners relies heavily on low-rank updates that are responsible for a large part of the algorithm's total run-time, particularly for matrices resulting from three-dimensional problems. This article presents a new algorithm that significantly reduces the number of low-rank updates and can reduce the setup time by 50 percent or more.
Recommendations
- Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates
- Hierarchical matrices: algorithms and analysis
- Efficient update of hierarchical matrices in the case of adaptive discretisation schemes.
- Hierarchical Coded Matrix Multiplication
- Computational Science - ICCS 2004
- Construction and complexity of hierarchical matrices
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- An introduction to hierarchical matrices
- Hierarchische Matrizen
- On the complexity of some hierarchical structured matrix algorithms
Cites work
- H-matrix approximation for the operator exponential with applications
- \(\mathcal H^2\)-matrix arithmetics in linear complexity
- \(\mathcal {H}\)-matrix approximability of the inverses of FEM matrices
- A fast algorithm for particle simulations
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Approximation of boundary element matrices
- Approximation of integral operators by Green quadrature and nested cross approximation
- Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Data-sparse approximation to the operator-valued functions of elliptic operator
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L^-coefficients
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- H-matrix Preconditioners in Convection-Dominated Problems
- Hierarchical matrices: algorithms and analysis
- Hybrid cross approximation of integral operators
- Low rank solution of data-sparse Sylvester equations
- Low-rank approximation of integral operators by interpolation
- On the fast matrix multiplication in the boundary element method by panel clustering
- On the numerical solution of two-point boundary value problems
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
- Rapid solution of integral equations of classical potential theory
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- The eigenvalue problem for the 2D Laplacian in \({\mathcal H}\)-matrix arithmetic and application to the heat and wave equation
- Variable order panel clustering
Cited in
(3)
This page was built for publication: Hierarchical matrix arithmetic with accumulated updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163778)
