.png){kind=icon}
返回
Fast parallel direct solvers for coarse grid problems
.png){kind=icon}
OA
AI
DOI：10.1006/jpdc.2000.1676.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We have developed a fast direct solver for parallel solution of coarse grid problems, Ax = b, such as arise when domain decomposition or multigrid methods are applied to elliptic partial differential equations in d space dimensions. The approach is based on a (quasi-) sparse factorization of the inverse of A. If A is n x n and the number of processors is P, the algorithm requires O(n(gamma)Y log P) time for communication and O(n(1+gamma)/P) time for computation, where gamma drop [GRAPHICS] The method is particularly suited to leading-edge multicomputer systems having thousands of processors. It achieves minimal message startup costs and substantially reduced message volume and arithmetic complexity compared with competing methods, which require O(n log P) time for communication and O(n(1+gamma)) or O(n(2)/P) lime for computation. Timings on the Intel Paragon and ASCI-Red machines reflect these complexity estimates. (C) 2001 Academic Press.
Keyword:
direct solver
sparse factorization
nested dissection
parallel computing
coarse grid problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
A New Polyhalogenated Monoterpene from the Red Alga Plocamium angustum来自红藻Plocamium angustum的新的多卤代单萜
PREAI
分享收藏
分享收藏
查看更多内容