Solving an advection‐diffusion problem on the connection machine
作者:
Martin Berggren,
期刊:
Concurrency: Practice and Experience
(WILEY Available online 1994)
卷期:
Volume 6,
issue 1
页码: 55-68
ISSN:1040-3108
年代: 1994
DOI:10.1002/cpe.4330060104
出版商: John Wiley&Sons, Ltd
数据来源: WILEY
摘要:
AbstractAn algorithm is presented that solves a linear advection‐diffusion problem using a least‐squares formulation and a conjugate gradient method to solve the corresponding minimization problem. An implementation in CM‐Fortran on a Thinking Machines CM‐2 is compared with a serial implementation on an IBM RS6000. The maximum speed‐up obtained is a factor of 70. For fine grids, the CPU time scales almost ideally when the number of processors is increased from 409
点击下载:
PDF
(557KB)
返 回