A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
From MaRDI portal
Publication:1841975
DOI10.1016/S0377-0427(00)00486-6zbMath0977.65036OpenAlexW1971285640MaRDI QIDQ1841975
Boris N. Khoromskij, Wolfgang Hackbusch
Publication date: 18 February 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00486-6
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)
Related Items
A note on the nullity theorem ⋮ Caccioppoli-type estimates and \(\mathcal{H}\)-matrix approximations to inverses for FEM-BEM couplings ⋮ A fast direct solver for nonlocal operators in wavelet coordinates ⋮ Existence of $\mathcal {H}$-matrix approximants to the inverses of BEM matrices: The simple-layer operator ⋮ A fast block low-rank dense solver with applications to finite-element matrices ⋮ Rapid Solution of Minimal Riesz Energy Problems ⋮ Data-sparse approximation to the operator-valued functions of elliptic operator ⋮ An ACA-SBM for some 2D steady-state heat conduction problems ⋮ \({\mathcal{H}} \)-matrix approximability of inverses of FEM matrices for the time-harmonic Maxwell equations ⋮ A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices ⋮ Optimized cycle basis in volume integral formulations for large scale eddy-current problems ⋮ \(\mathcal H\)-matrix accelerated second moment analysis for potentials with rough correlation ⋮ Hierarchical matrix approximation for the uncertainty quantification of potentials on random domains ⋮ Fast algorithms for large dense matrices with applications to biofluids ⋮ Approximate iterations for structured matrices ⋮ Hierarchical Kronecker tensor-product approximations ⋮ Hierarchical matrix techniques for a domain decomposition algorithm ⋮ Covariance regularity and \(\mathcal {H}\)-matrix approximation for rough random fields ⋮ Data-sparse approximation to a class of operator-valued functions ⋮ The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems ⋮ Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation ⋮ Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems ⋮ \(\mathcal H^2\)-matrices -- multilevel methods for the approximation of integral operators. ⋮ A Multiscale Neural Network Based on Hierarchical Matrices ⋮ \({\mathscr{H}} \)-matrix approximability of inverses of discretizations of the fractional Laplacian ⋮ Hierarchical matrix approximation to Green's function via boundary concentrated FEM ⋮ A multiscale neural network based on hierarchical nested bases ⋮ A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates ⋮ Wideband nested cross approximation for Helmholtz problems ⋮ \(\mathcal H^2\)-matrix approximation of integral operators by interpolation ⋮ Hierarchical Orthogonal Factorization: Sparse Square Matrices ⋮ $\mathcal{H}$-Matrix Based Second Moment Analysis for Rough Random Fields and Finite Element Discretizations
Cites Work
- On the fast matrix multiplication in the boundary element method by panel clustering
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- On the efficient use of the Galerkin-method to solve Fredholm integral equations
- A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
- Integral equations. Theory and numerical treatment
- Wavelet approximation methods for pseudodifferential equations. II: Matrix compression and fast solution
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Wavelet approximations for first kind boundary integral equations on polygons
- Unnamed Item
- Unnamed Item
