Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
We consider the problem of choosing low-rank factorizations in data sparse matrix approximations for preconditioning large-scale symmetric positive definite (SPD) matrices. These approximations are memory-efficient schemes that rely on hierarchical matrix partitioning and compression of certain sub-...
Saved in:
| Published in: | SIAM journal on matrix analysis and applications Vol. 39; no. 4; pp. 1701 - 1725 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics
01.01.2018
|
| Subjects: | |
| ISSN: | 0895-4798, 1095-7162 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!