.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
direct solver
sparse factorization
nested dissection
parallel computing
coarse grid problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available