Parallel fast isogeometric solvers for explicit dynamics
MetadataShow full item record
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(N/(c^(2/3)t_comm) 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 t_comm 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.
Showing items related by title, author, creator and subject.
Johnson, Sarah E. (2010)Parental time pressure, in terms of actual workload and subjective reports, is high and likely to increase in the future, with ongoing implications for personal wellbeing. The combination of parenting young children and ...
Chai, Qinqin (2013)In this thesis, we develop new computational methods for three classes of dynamic optimization problems: (i) A parameter identification problem for a general nonlinear time-delay system; (ii) an optimal control problem ...
Miller, Karen (2001)While Karl Marx's concept of time has not received the same attention as other elements of his work, it is nonetheless an important aspect of his idea about history. Of those studies which have dealt with this problem, ...