A modified version of the PRESB preconditioner for a class of non-Hermitian complex systems of linear equations
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917665002487808 |
|---|---|
| author | Axelsson, Owe Slakuyeh, Dovod Khojasteh |
| author_facet | Axelsson, Owe Slakuyeh, Dovod Khojasteh |
| contents | We present a modified version of the PRESB preconditioner for two-by-two block system of linear equations with the coefficient matrix $$\textbf{A}=\left(\begin{array}{cc}
F & -G^*
G & F \end{array}\right),$$ where $F\in\mathbb{C}^{n\times n}$ is Hermitian positive definite and $G\in\mathbb{C}^{n\times n}$ is positive semidefinite. Spectral analysis of the preconditioned matrix is analyzed. In each iteration of a Krylov subspace method, like GMRES, for solving the preconditioned system in conjunction with proposed preconditioner two subsystems with Hermitian positive definite coefficient matrix should be solved which can be accomplished exactly using the Cholesky factorization or inexactly utilizing the conjugate gradient method. Application of the proposed preconditioner to the systems arising from finite element discretization of PDE-constrained optimization problems is presented. Numerical results are given to demonstrate the efficiency of the preconditioner. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11184 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A modified version of the PRESB preconditioner for a class of non-Hermitian complex systems of linear equations Axelsson, Owe Slakuyeh, Dovod Khojasteh Numerical Analysis 65F10, 65F50 We present a modified version of the PRESB preconditioner for two-by-two block system of linear equations with the coefficient matrix $$\textbf{A}=\left(\begin{array}{cc} F & -G^* G & F \end{array}\right),$$ where $F\in\mathbb{C}^{n\times n}$ is Hermitian positive definite and $G\in\mathbb{C}^{n\times n}$ is positive semidefinite. Spectral analysis of the preconditioned matrix is analyzed. In each iteration of a Krylov subspace method, like GMRES, for solving the preconditioned system in conjunction with proposed preconditioner two subsystems with Hermitian positive definite coefficient matrix should be solved which can be accomplished exactly using the Cholesky factorization or inexactly utilizing the conjugate gradient method. Application of the proposed preconditioner to the systems arising from finite element discretization of PDE-constrained optimization problems is presented. Numerical results are given to demonstrate the efficiency of the preconditioner. |
| title | A modified version of the PRESB preconditioner for a class of non-Hermitian complex systems of linear equations |
| topic | Numerical Analysis 65F10, 65F50 |
| url | https://arxiv.org/abs/2402.11184 |