Paper Info
Title
Parallel Fast Isogeometric Solvers for Explicit Dynamics.
Abstract
This paper presents a parallel implementation of the fast isogeometric solvers for explicit dynamics for solving non-stationary time-dependent problems. The algorithm is described in pseudo-code. We present theoretical estimates of the computational and communication complexities for a single time step of the parallel algorithm. The computational complexity is O(p(6)N/c t(comp)) and communication complexity is O(p(6)N/c(2/3) t(comp)) where p denotes the polynomial order of B-spline basis with CP-1 global continuity, N denotes the number of elements and c is number of processors forming a cube, t(comp) refers to the execution time of a single operation, and tcomn, refers to the time of sending a single datum. We compare theoretical estimates with numerical experiments performed on the LONESTAR Linux cluster from Texas Advanced Computing Center, using 1 000 processors. We apply the method to solve nonlinear flows in highly heterogeneous porous media.
Year
DOI
Venue
2017
10.4149/cai_2017_2_423
COMPUTING AND INFORMATICS
Keywords
Field
DocType
Isogeometric finite element method,alternating direction solver,fast parallel solver,non-stationary problems,nonlinear flows in highly-heterogeneous porous media
Geodetic datum,Nonlinear system,Polynomial,Parallel algorithm,Computer science,Parallel computing,Theoretical computer science,Communication complexity,Computer cluster,Cube,Computational complexity theory
Journal
Volume
Issue
ISSN
36
2
1335-9150
Citations 
PageRank 
References 
2
0.47
0
Authors
5
Name
Order
Citations
PageRank
M. Wozniak1277.48
Marcin Los2184.56
Maciej Paszynski319336.89
Lisandro Dalcín412818.25
Victor M. Calo519138.14