A New Matrix Truncation Method for Improving Approximate Factorisation Preconditioners
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917796773888000 |
|---|---|
| author | Bock, Andreas A. Andersen, Martin S. |
| author_facet | Bock, Andreas A. Andersen, Martin S. |
| contents | In this experimental work, we present a general framework based on the Bregman log determinant divergence for preconditioning Hermitian positive definite linear systems. We explore this divergence as a measure of discrepancy between a preconditioner and a matrix. Given an approximate factorisation of a given matrix, the proposed framework informs the construction of a low-rank approximation of the typically indefinite factorisation error. The resulting preconditioner is therefore a sum of a Hermitian positive definite matrix given by an approximate factorisation plus a low-rank matrix. Notably, the low-rank term is not generally obtained as a truncated singular value decomposition (TSVD). This framework leads to a new truncation where principal directions are not based on the magnitude of the singular values, and we prove that such truncations are minimisers of the aforementioned divergence. We present several numerical examples showing that the proposed preconditioner can reduce the number of PCG iterations compared to a preconditioner constructed using a TSVD for the same rank. We also propose a heuristic to approximate the proposed preconditioner in the case where exact truncations cannot be computed explicitly (e.g. in a large-scale setting) and demonstrate its effectiveness over TSVD-based approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_06417 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A New Matrix Truncation Method for Improving Approximate Factorisation Preconditioners Bock, Andreas A. Andersen, Martin S. Numerical Analysis 15A99, 65F08, 65F30 In this experimental work, we present a general framework based on the Bregman log determinant divergence for preconditioning Hermitian positive definite linear systems. We explore this divergence as a measure of discrepancy between a preconditioner and a matrix. Given an approximate factorisation of a given matrix, the proposed framework informs the construction of a low-rank approximation of the typically indefinite factorisation error. The resulting preconditioner is therefore a sum of a Hermitian positive definite matrix given by an approximate factorisation plus a low-rank matrix. Notably, the low-rank term is not generally obtained as a truncated singular value decomposition (TSVD). This framework leads to a new truncation where principal directions are not based on the magnitude of the singular values, and we prove that such truncations are minimisers of the aforementioned divergence. We present several numerical examples showing that the proposed preconditioner can reduce the number of PCG iterations compared to a preconditioner constructed using a TSVD for the same rank. We also propose a heuristic to approximate the proposed preconditioner in the case where exact truncations cannot be computed explicitly (e.g. in a large-scale setting) and demonstrate its effectiveness over TSVD-based approaches. |
| title | A New Matrix Truncation Method for Improving Approximate Factorisation Preconditioners |
| topic | Numerical Analysis 15A99, 65F08, 65F30 |
| url | https://arxiv.org/abs/2312.06417 |