On parallelism and convergence of incomplete LU factorizations
type: Item
instance of: scholarly article
title: On parallelism and convergence of incomplete LU factorizations
zbMATH Open document ID: 0729.65019
DOI: 10.1016/0168-9274(91)90011-N
author: Shun Doi
published in: Applied Numerical Mathematics
publication date: 1991-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 65N22
Mathematics Subject Classification ID: 35J25
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4205863
zbMATH Keywords: parallel computation
zbMATH Keywords: incomplete LU factorization
zbMATH Keywords: mesh-connected computers
zbMATH Keywords: ordering
zbMATH Keywords: convection-diffusion
zbMATH Keywords: numerical experiments
zbMATH Keywords: degree of parallelism
zbMATH Keywords: convergence
zbMATH Keywords: preconditioned conjugate gradients
Wikidata QID: Q114214923
reviewed by: Juan Pedro Milaszewicz
MaRDI profile type: Publication
cites work: On Vectorizing Incomplete Factorization and SSOR Preconditioners
cites work: SOME PARALLEL AND VECTOR IMPLEMENTATIONS OF PRECONDITIONED ITERATIVE METHODS ON CRAY-2
cites work: Q4692656
cites work: The effect of ordering on preconditioned conjugate gradients
cites work: Ordering techniques for the preconditioned conjugate gradient method on parallel computers
cites work: Q4091368
cites work: Parallel concepts in graph theory
cites work: On the Equivalence of Certain Iterative Acceleration Methods
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
cites work: Q3809208
cites work: Multicolor ICCG Methods for Vector Computers
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
cites work: High Performance Preconditioning
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Q5342712
cites work: Q5604166
Recommended article: LU factorization on parallel computers
Recommended article: A parallel algorithm for the general LU factorization
Recommended article: Fine-Grained Parallel Incomplete LU Factorization
Recommended article: Q4214993
Recommended article: Incremental incomplete LU factorizations with applications
Recommended article: Q3976774
Recommended article: Q4251970
Recommended article: A Parallelization Technique Based on Factor Combination and Graph Partitioning for General Incomplete LU Factorization
Recommended article: Q3790540
Recommended article: Analysis of parallel incomplete point factorizations
description: scientific article; zbMATH DE number 4205863