An MPI implementation of the BLACS

2002 ◽  
Author(s):  
V. Deshpande ◽  
W. Sawyer
Keyword(s):  
Mpi Implementation

scholarly journals Performance Analysis, PVM and MPI Implementation of a DSCF Hartree Fock Program

2000 ◽  
Vol 8 (1) ◽  
pp. 19 ◽  
Author(s):  
Siegfried Hoefinger ◽  
Othmar Steinhauser ◽  
Peter Zinterhof
Keyword(s):  
Performance Analysis ◽  
Hartree Fock ◽  
Mpi Implementation

scholarly journals A Nonlocal Laplacian-Based Model for Bituminous Surfacing Crack Recovery and its MPI Implementation

2020 ◽  
Vol 62 (6-7) ◽  
pp. 1007-1033
Author(s):  
Noémie Debroux ◽  
Carole Le Guyader ◽  
Luminita A. Vese
Keyword(s):  
Mpi Implementation

A note on the fast direct method for discrete elliptic problems

2019 ◽  
Vol 34 (6) ◽  
pp. 317-326
Author(s):  
Sergei A. Goreinov
Keyword(s):  
Direct Method ◽  
3D Structure ◽  
Kronecker Products ◽  
System Matrix ◽  
Diffusion Term ◽  
Multigrid Algorithm ◽  
3D Data ◽  
Order Of Magnitude ◽  
Mpi Implementation ◽  
Discretized Problem

Abstract We consider a method due to P. Vassilevski and Yu. A. Kuznetsov [4, 10] for solving linear systems with matrices of low Kronecker rank such that all factors in Kronecker products are banded. Most important examples of such matrices arise from discretized div K grad operator with diffusion term k1(x)k2(y)k3(z). Several practical issues are addressed: an MPI implementation with distribution of data along processor grid inheriting Cartesian 3D structure of discretized problem; implicit deflation of the known nullspace of the system matrix; links with two-grid framework of multigrid algorithm which allow one to remove the requirement of Kronecker structure in one or two of axes. Numerical experiments show the efficiency of 3D data distribution having the scalability analogous to (structured) HYPRE solvers yet the absolute timings being an order of magnitude lower, on the range from 10 to 104 cores.

Sign in / Sign up

Export Citation Format

Share Document