Name
Abstract | ||
|---|---|---|
In this paper, we consider the matrices approximated in ${\mathscr{H}}^{2}$ format. The direct solution, as well as the preconditioning of systems with such matrices, is a challenging problem. We propose a non-extensive sparse factorization of the ${\mathscr{H}}^{2}$ matrix that allows to substitute direct ${\mathscr{H}}^{2}$ solution with the solution of the system with an equivalent sparse matrix of the same size. The sparse factorization is constructed of parameters of the ${\mathscr{H}}^{2}$ matrix. In the numerical experiments, we show the consistency of this approach in comparison with the other approximate block low-rank hierarchical solvers, such as HODLR [3], H2Lib [5], and IFMM [11]. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10444-020-09794-y | Advances in Computational Mathematics |
Keywords | DocType | Volume |
matrix, Sparse factorization, Preconditioning, 65F05, 15A23, 65R20, 65F50 | Journal | 46 |
Issue | ISSN | Citations |
4 | 1019-7168 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daria A. Sushnikova | 1 | 0 | 0.34 |
| Ivan V. Oseledets | 2 | 306 | 41.96 |