Sharpened PCG Iteration Bound for High-Contrast Heterogeneous Scalar Elliptic PDEs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912712986984448 |
|---|---|
| author | Soliman, Philip Cumaru, Filipe Heinlein, Alexander |
| author_facet | Soliman, Philip Cumaru, Filipe Heinlein, Alexander |
| contents | A new iteration bound for the preconditioned conjugate gradient (PCG) method is presented that more accurately captures convergence for systems with clustered eigenspectra, where the classical condition number-based bound is too pessimistic. By using the edge eigenvalues of each cluster in the spectral distribution, the bound is shown to be orders of magnitude sharper than the classical bound for certain examples. Its effectiveness is demonstrated on a high-contrast elliptic PDE preconditioned with a two-level overlapping Schwarz preconditioner, where the performance of different (algebraic) coarse spaces is successfully distinguished. A key contribution of this work is the observation that, for certain high-contrast problems, simpler coarse spaces can be made competitive in terms of PCG convergence. Conversely, more complex preconditioners are not always required. Finally, it is shown that the bound can be estimated effectively from Ritz values computed during early PCG iterations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12726 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sharpened PCG Iteration Bound for High-Contrast Heterogeneous Scalar Elliptic PDEs Soliman, Philip Cumaru, Filipe Heinlein, Alexander Numerical Analysis A new iteration bound for the preconditioned conjugate gradient (PCG) method is presented that more accurately captures convergence for systems with clustered eigenspectra, where the classical condition number-based bound is too pessimistic. By using the edge eigenvalues of each cluster in the spectral distribution, the bound is shown to be orders of magnitude sharper than the classical bound for certain examples. Its effectiveness is demonstrated on a high-contrast elliptic PDE preconditioned with a two-level overlapping Schwarz preconditioner, where the performance of different (algebraic) coarse spaces is successfully distinguished. A key contribution of this work is the observation that, for certain high-contrast problems, simpler coarse spaces can be made competitive in terms of PCG convergence. Conversely, more complex preconditioners are not always required. Finally, it is shown that the bound can be estimated effectively from Ritz values computed during early PCG iterations. |
| title | Sharpened PCG Iteration Bound for High-Contrast Heterogeneous Scalar Elliptic PDEs |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2511.12726 |