A parallel algorithm based on Galerkin theory for block-tridiagonal linear systems (Q883950): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Convergence of two-stage iterative methods for Hermitian positive definite matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A parallel algorithm for block-tridiagonal linear systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5866818 / rank | |||
Normal rank |
Latest revision as of 21:03, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallel algorithm based on Galerkin theory for block-tridiagonal linear systems |
scientific article |
Statements
A parallel algorithm based on Galerkin theory for block-tridiagonal linear systems (English)
0 references
12 June 2007
0 references
The paper is concerned with the design and analysis of a parallel iterative method for solving block-tridiagonal linear systems. The new algorithm is based on the Galerkin theory for constructing the orthogonal vectors appearing in each iteration. Experiments and comparisons with similar algorithms in the literature are also presented.
0 references
parallel algorithm
0 references
block-tridiagonal linear systems
0 references
Galerkin theory
0 references
HP rx2600 cluster
0 references
numerical examples
0 references
comparison of methods
0 references