dc.contributor.author Wozniak, M. dc.contributor.author Paszynski, M. dc.contributor.author Pardo, D. dc.contributor.author Dalcin, L. dc.contributor.author Calo, V.M. dc.date.accessioned 2016-06-13T13:11:52Z dc.date.available 2016-06-13T13:11:52Z dc.date.issued 2015-12-31 dc.identifier.issn 0045-7825 dc.identifier.uri http://hdl.handle.net/20.500.11824/100 dc.description.abstract This paper derives theoretical estimates of the computational cost for isogeometric multi-frontal direct solver executed on parallel distributed memory machines. We show theoretically that for the $C^{p-1}$ global continuity of the isogeometric solution, both the computational cost and the communication cost of a direct solver are of order $\mathcal{O}(log(N)p^2)$ for the one dimensional $(1D)$ case, $\mathcal{O}(Np^2)$ for the two dimensional $(2D)$ case, and $\mathcal{O}(N^{4/3}p^2)$ for the three dimensional $(3D)$ case, where $N$ is the number of degrees of freedom and p is the polynomial order of the B-spline basis functions. The theoretical estimates are verified by numerical experiments performed with three parallel multi-frontal direct solvers: MUMPS, PaStiX and SuperLU, available through PETIGA toolkit built on top of PETSc. Numerical results confirm these theoretical estimates both in terms of $p$ and $N$. For a given problem size, the strong efficiency rapidly decreases as the number of processors increases, becoming about $20%$ for $256$ processors for a $3D$ example with $128^3$ unknowns and linear B-splines with $C^0$ global continuity, and $15%$ for a $3D$ example with $643$ unknowns and quartic B-splines with $C^3$ global continuity. At the same time, one cannot arbitrarily increase the problem size, since the memory required by higher order continuity spaces is large, quickly consuming all the available memory resources even in the parallel distributed memory version. Numerical results also suggest that the use of distributed parallel machines is highly beneficial when solving higher order continuity spaces, although the number of processors that one can efficiently employ is somehow limited. dc.format application/pdf dc.language.iso eng en_US dc.rights Reconocimiento-NoComercial-CompartirIgual 3.0 España en_US dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/es/ en_US dc.subject Communication cost dc.subject Computational cost dc.subject Isogeometric analysis dc.subject Multi-frontal direct solver dc.subject Parallel distributed memory machine dc.title Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines en_US dc.type info:eu-repo/semantics/conferenceObject en_US dc.identifier.doi 10.1016/j.cma.2014.11.020 dc.relation.publisherversion http://www.sciencedirect.com/science/article/pii/S0045782514004460 dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/731063 en_US dc.rights.accessRights info:eu-repo/semantics/openAccess en_US dc.type.hasVersion info:eu-repo/semantics/acceptedVersion en_US dc.journal.title Computer Methods in Applied Mechanics and Engineering en_US
﻿

### This item appears in the following Collection(s)

Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España