A fast adaptive solver for hierarchically semiseparable representations
From MaRDI portal
Publication:862042
DOI10.1007/s10092-005-0103-3zbMath1168.65330MaRDI 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
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Preparing sparse solvers for exascale computing, Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction, An algebraic multifrontal preconditioner that exploits the low‐rank property, Compressing Rank-Structured Matrices via Randomized Sampling, Preconditioners for hierarchical matrices based on their extended sparse form, Singular matrices whose Moore-Penrose inverse is tridiagonal, 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, Fast construction of hierarchical matrix representation from matrix-vector multiplication, Fast and accurate numerical methods for solving elliptic difference equations defined on lattices, A fast direct solver for a class of elliptic partial differential equations, Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids, Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates, An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries, A robust inner-outer hierarchically semi-separable preconditioner, Fast algorithms for hierarchically semiseparable matrices, On the Impact of Reordering in a Hierarchical Semi-Separable Compression Solver for Fractional Diffusion Problems