Parallel marching Poisson solvers (Q1065515)
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 marching Poisson solvers |
scientific article; zbMATH DE number 3924020
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel marching Poisson solvers |
scientific article; zbMATH DE number 3924020 |
Statements
Parallel marching Poisson solvers (English)
0 references
1985
0 references
The Poisson equation in a rectangle yields a block tridiagonal linear system with identical N by N diagonal blocks A and -I on codiagonals. The marching algorithm consists in vector recursions involving the matrix A. An orthogonal transformation diagonalizing A is known analytically. The algorithm translated to transformed vectors leads itself to efficient parallel realizations on MIMD and SIMD machines.
0 references
MIMD computer
0 references
SIMD computer
0 references
parallel algorithms
0 references
Poisson solvers
0 references
Poisson equation
0 references
marching algorithm
0 references
