A SOR iterative algorithm for the finite difference and the finite element methods that is efficient and parallelizable (Q1804235): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q300567 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Costică Moroşanu / rank | |||
Normal rank | |||
Revision as of 18:17, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SOR iterative algorithm for the finite difference and the finite element methods that is efficient and parallelizable |
scientific article |
Statements
A SOR iterative algorithm for the finite difference and the finite element methods that is efficient and parallelizable (English)
0 references
24 October 1995
0 references
An efficient and simple parallel successive overrelaxation (SOR) iterative algorithm is presented for finite difference and finite element methods. Based on domain subdividing and computing sequence reordering, this algorithm is proven to be efficient and simple to implement.
0 references
parallel computation
0 references
domain decomposition
0 references
successive overrelaxation
0 references
iterative algorithm
0 references
finite difference
0 references
finite element
0 references
