Hierarchical matrix approximation with blockwise constraints
A technique to preserve constraints on a hierarchical matrix approximation is presented. The preservation is done block-wise and it carries over to \(LU\) factorization. It is shown that a particular set of block-wise constraints leads to the preservation of a significantly larger set of global constraints due to the structure of the hierarchical matrix, while maintaining its logarithmic-linear complexity. The block-wise preservation of a small set of piecewise constant vectors leads to the global preservation of the linear space of piecewise constants, which lie in the vicinity of eigenvectors corresponding to small eigenvalues, and this guarantees spectral equivalence. It is pointed out that complexity is reduced compared to the usual matrix approximation with a similar preconditioning effect.
- A class of first order factorization methods
- A fast algorithm for particle simulations
- 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
- Construction and arithmetics of \(\mathcal H\)-matrices
- Efficient solution of nonlinear elliptic problems using hierarchical matrices with Broyden updates
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Hierarchische Matrizen
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- scientific article; zbMATH DE number 52660 (Why is no real title available?)
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices
- Methods of conjugate gradients for solving linear systems
- Mosaic-skeleton approximations
- Multilevel approximation of boundary integral operators
- Nested grids ILU-decomposition (NGILU)
- On the convergence rate of the conjugate gradients in presence of rounding errors
- On the fast matrix multiplication in the boundary element method by panel clustering
- On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices.
- Parallel hierarchical matrix preconditioners for the curl-curl operator
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Tangential frequency filtering decompositions for symmetric matrices
- Approximate inversion of discrete Fourier integral operators
- Stabilized rounded addition of hierarchical matrices
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Efficient block boundaries estimation in block-wise constant matrices: an application to HiC data
- Hierarchical matrix approximation for kernel-based scattered data interpolation
- On the spectral equivalence of hierarchical matrix preconditioners for elliptic problems
- Sparse hierarchical solvers with guaranteed convergence
This page was built for publication: Hierarchical matrix approximation with blockwise constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376862)
