Parallel implicit methods of alternating directions (Q1975092)
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: Parallel implicit methods of alternating directions |
scientific article; zbMATH DE number 1427845
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel implicit methods of alternating directions |
scientific article; zbMATH DE number 1427845 |
Statements
Parallel implicit methods of alternating directions (English)
0 references
5 April 2000
0 references
The paper is devoted to the description of parallel algorithms for solving two-dimensional and three-dimensional difference boundary value problems that use computer systems with a rectangular array of processors with shared memory. The implicit alternating irection methods employing the block method of cyclic reduction without backward sweep are used for solving three-diagonal ``one-dimensional'' systems. The efficiency of parallelizing is investigated with allowance made for communication overheads. To improve the performance, a two-dimensional bicyclic-network architecture is suggested.
0 references
difference method
0 references
implicit alternating-direction methods
0 references
parallel algorithm
0 references
cyclic reduction
0 references
performance
0 references
bicyclic-network architecture
0 references
0.95324796
0 references
0.93646276
0 references
0.93395835
0 references
0.93381405
0 references
0.9177447
0 references
0.9123824
0 references
