A fast adaptive solver for hierarchically semiseparable representations
From MaRDI portal
Publication:862042
DOI10.1007/s10092-005-0103-3zbMath1168.65330OpenAlexW1998187832MaRDI QIDQ862042
Publication date: 2 February 2007
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-005-0103-3
Related Items (17)
Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids ⋮ Fast and accurate numerical methods for solving elliptic difference equations defined on lattices ⋮ Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates ⋮ Singular matrices whose Moore-Penrose inverse is tridiagonal ⋮ A fast direct solver for a class of elliptic partial differential equations ⋮ A hybrid stochastic interpolation and compression method for kernel matrices ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries ⋮ On the Impact of Reordering in a Hierarchical Semi-Separable Compression Solver for Fractional Diffusion Problems ⋮ An algebraic multifrontal preconditioner that exploits the low‐rank property ⋮ Compressing Rank-Structured Matrices via Randomized Sampling ⋮ Fast construction of hierarchical matrix representation from matrix-vector multiplication ⋮ Preconditioners for hierarchical matrices based on their extended sparse form ⋮ Fast algorithms for hierarchically semiseparable matrices ⋮ Preparing sparse solvers for exascale computing ⋮ Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction ⋮ A robust inner-outer hierarchically semi-separable preconditioner
This page was built for publication: A fast adaptive solver for hierarchically semiseparable representations
