MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides (Q1718184)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides |
scientific article; zbMATH DE number 7016237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides |
scientific article; zbMATH DE number 7016237 |
Statements
MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides (English)
0 references
8 February 2019
0 references
Summary: We consider the MINRES seed projection method for solving multiple right-hand side linear systems \(A X = B\), where \(A \in \mathbb{R}^{n \times n}\) is a nonsingular symmetric matrix, \(B \in \mathbb{R}^{n \times p}\). In general, GMRES seed projection method is one of the effective methods for solving multiple right-hand side linear systems. However, when the coefficient matrix is symmetric, the efficiency of this method would be weak. MINRES seed projection method for solving symmetric systems with multiple right-hand sides is proposed in this paper, and the residual estimation is analyzed. The numerical examples show the efficiency of this method.
0 references
0 references
0 references
0 references
0 references
0 references
0.8689978122711182
0 references
0.8653099536895752
0 references
0.8545790910720825
0 references
0.8054070472717285
0 references
0.7971823215484619
0 references