TY - JOUR

T1 - Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers

AU - Woźniak, Maciej

AU - Kuźnik, Krzysztof M.

AU - Paszyński, Maciej R.

AU - Calo, Victor M.

AU - Pardo, D.

N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The work of KK was supported by the Polish National Science Center Grant No. NN 519 447739. The work of MP was supported by the Polish National Science Center Grant Nos. NN 519 447739 and DEC-2011/01/B/ST6/00674. The work of MW was supported by Polish National Science Grant Nos. DEC-2011/01/B/ST6/00674 and 2012/07/B/ST6/01229. The work of DP was partially funded by the Project of the Spanish Ministry of Sciences and Innovation MTM2010-16511, the Laboratory of Mathematics (UFI 11/52), and the Ibero American Project CYTED 2011 (P711RT0278).

PY - 2014/6

Y1 - 2014/6

N2 - In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.

AB - In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.

UR - http://hdl.handle.net/10754/563571

UR - https://linkinghub.elsevier.com/retrieve/pii/S0898122114001503

UR - http://www.scopus.com/inward/record.url?scp=84901240309&partnerID=8YFLogxK

U2 - 10.1016/j.camwa.2014.03.017

DO - 10.1016/j.camwa.2014.03.017

M3 - Article

VL - 67

SP - 1864

EP - 1883

JO - Computers & Mathematics with Applications

JF - Computers & Mathematics with Applications

SN - 0898-1221

IS - 10

ER -