An iterative method of alternating type for systems with special block matrices
From MaRDI portal
(Redirected from Publication:808616)
The author discusses an iterative method for solving systems of linear algebraic equations of the type \[ \begin{pmatrix} A&D^ T&0 \\ D&B&E^ T \\ 0&E&C \end{pmatrix} \begin{pmatrix} x \\ y \\ z \end{pmatrix} = \begin{pmatrix} f \\ g \\ h \end{pmatrix} \] where A, B and C are symmetric matrices. The proposed algorithm yields a sequence of vectors \(y_ n\) converging to the y-component of the exact solution of (1). The algorithm is illustrated by a numerical example.
Recommendations
- On a generalization of a certain iterative method for the solution of special systems of linear algebraic equations
- On some versions of incomplete block-matrix factorization iterative methods
- scientific article; zbMATH DE number 24473
- Iterative decomposition methods for solving systems of equations with a block-tridiagonal matrix
- scientific article; zbMATH DE number 3930229
Cites work
- A relaxation procedure for domain decomposition methods using finite elements
- An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- scientific article; zbMATH DE number 193145 (Why is no real title available?)
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures
Cited in
(2)
This page was built for publication: An iterative method of alternating type for systems with special block matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808616)
