On parallelism and convergence of incomplete LU factorizations (Q806951)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4205863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On parallelism and convergence of incomplete LU factorizations |
scientific article; zbMATH DE number 4205863 |
Statements
On parallelism and convergence of incomplete LU factorizations (English)
0 references
1991
0 references
This paper contains numerical experiments whose aim is to determine how the degree of parallelism affects the convergence speed of preconditioned conjugate gradients, when applied to solve linear systems that arise from five point discretization of two-dimensional elliptic problems. One of the main conclusions is that certain orderings of the nodes that are better suited for parallelization lead to poorer convergence.
0 references
parallel computation
0 references
incomplete LU factorization
0 references
mesh-connected computers
0 references
ordering
0 references
convection-diffusion
0 references
numerical experiments
0 references
degree of parallelism
0 references
convergence
0 references
preconditioned conjugate gradients
0 references
0 references
0 references
0 references
0 references
0.92933995
0 references
0.9246551
0 references
0.9241973
0 references
0.9068398
0 references
0.90107346
0 references
0.89706534
0 references
