On convergence of EVHSS iteration method for solving generalized saddle-point linear systems (Q1726426): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:42, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On convergence of EVHSS iteration method for solving generalized saddle-point linear systems |
scientific article |
Statements
On convergence of EVHSS iteration method for solving generalized saddle-point linear systems (English)
0 references
20 February 2019
0 references
Based on \textit{J.-L. Zhang}'s publication [Numer. Linear Algebra Appl. 25, No. 4, e2166, 14 p. (2018; Zbl 06945801)], the author proves that the iteration method is convergent unconditionally to the unique solution of the linear system \[ Ax=\left ( \begin{matrix} B&E \\ -E^{\ast} &C \\ \end{matrix} \right ) \left ( \begin{matrix} y \\ z \\ \end{matrix} \right )=\left ( \begin{matrix} f \\ g \\ \end{matrix} \right )=b, \] where \(B\) and \(C\) are Hermitian positive semidefinite matrices, and \(E\) is a rectangular matrix. With a precise technique for the spectral radius \(\rho\) of the iteration matrix the bound \(\rho<1\) is proven.
0 references
generalized saddle-point linear system
0 references
matrix splitting iteration
0 references
convergence
0 references