BOUNDS ON BLOCK DIAGONAL PRECONDITIONING
作者:
MARKYAN-MING CHANG,
MARTINH. SCHULTZ,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1993)
卷期:
Volume 1,
issue 2
页码: 141-164
ISSN:1063-7192
年代: 1993
DOI:10.1080/10637199308915437
出版商: Taylor & Francis Group
关键词: Block diagonal PCG;condition number bound;parallel asymptotic time;optimal number of processors
数据来源: Taylor
摘要:
We consider the preconditioned conjugate gradient (PCG) method for solving the linear equations derived from difference approximations to the Laplace operator on 1D line, 2D square or 3D cube domains. If the preconditioner is a block diagonal matrix obtained from cutting the original domain by lines or planes, we can End an upper bound for the condition number of the preconditioned system. For several different parallel machine models, we derive the optimal number of processors to achieve the best asymptotic run time.
点击下载:
PDF (302KB)
返 回