Parallel Fast Isogeometric Solvers for Explicit Dynamics
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 s...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
2017
|
| Online Access: | http://www.cai.sk/ojs/index.php/cai/article/view/2017_2_423 http://hdl.handle.net/20.500.11937/58428 |
| _version_ | 1848760257052934144 |
|---|---|
| author | Wozniak, M. Los, M. Paszynski, M. Dalcin, L. Calo, Victor |
| author_facet | Wozniak, M. Los, M. Paszynski, M. Dalcin, L. Calo, Victor |
| author_sort | Wozniak, M. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T10:12:54Z |
| format | Journal Article |
| id | curtin-20.500.11937-58428 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:12:54Z |
| publishDate | 2017 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-584282018-02-13T07:58:23Z Parallel Fast Isogeometric Solvers for Explicit Dynamics Wozniak, M. Los, M. Paszynski, M. Dalcin, L. Calo, Victor 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. 2017 Journal Article http://hdl.handle.net/20.500.11937/58428 10.4149/cai_2017_2_423 http://www.cai.sk/ojs/index.php/cai/article/view/2017_2_423 restricted |
| spellingShingle | Wozniak, M. Los, M. Paszynski, M. Dalcin, L. Calo, Victor Parallel Fast Isogeometric Solvers for Explicit Dynamics |
| title | Parallel Fast Isogeometric Solvers for Explicit Dynamics |
| title_full | Parallel Fast Isogeometric Solvers for Explicit Dynamics |
| title_fullStr | Parallel Fast Isogeometric Solvers for Explicit Dynamics |
| title_full_unstemmed | Parallel Fast Isogeometric Solvers for Explicit Dynamics |
| title_short | Parallel Fast Isogeometric Solvers for Explicit Dynamics |
| title_sort | parallel fast isogeometric solvers for explicit dynamics |
| url | http://www.cai.sk/ojs/index.php/cai/article/view/2017_2_423 http://hdl.handle.net/20.500.11937/58428 |