Graph grammar based parallel direct solver for 1D and 2D isogeometric finite element method
MetadataShow full item record
In this paper we present a multi-frontal direct solver algorithm for one and two dimensional isogeometric finite element method. The solver algorithm is tested on heat transfer model problem. The algorithm is partitioned into basic undividable tasks calling graph grammar productions, responsible for generation of the merging and elimination pattern, as well as processing multiple frontal matrices during the computation process. The productions are scheduled into nodes of the GPU graphic card and executed in concurrent. The paper is concluded with numerical results concerning the execution of the solver algorithm on GeForce GTX 260 device in one dimension, delivering O(logN) execution time for linear, quadratic, cubic and higher order B-splines, as well as on NVidia Tesla C2070 device in two dimension, delivering O(NlogN) computational cost for linear, quadratic and cubic B-splines.
Showing items related by title, author, creator and subject.
Paszynska, A.; Jopek, K.; Banas, K.; Paszynski, M.; Gurgul, P.; Lenerth, A.; Nguyen, D.; Pingali, K.; Dalcin, L.; Calo, Victor (2015)This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. ...
Grammar-based multi-frontal solver for one dimensional isogeometric analysis with multiple right-hand-sidesKuznik, K.; Paszynski, M.; Calo, Victor (2013)This paper introduces a grammar-based model for developing a multi-thread multi-frontal parallel direct solver for onedimensional isogeometric finite element method. The model includes the integration of B-splines for ...
Dynamic programming algorithm for generation of optimal elimination trees for multi-frontal direct solver over h-refined gridsAbouEisha, H.; Moshkov, M.; Calo, Victor; Paszynski, M.; Goik, D.; Jopek, K. (2014)In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal ...