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

Maciej Woźniak, Krzysztof M. Kuźnik, Maciej R. Paszyński, Victor M. Calo, D. Pardo

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

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.
Original languageEnglish (US)
Pages (from-to)1864-1883
Number of pages20
JournalComputers & Mathematics with Applications
Volume67
Issue number10
DOIs
StatePublished - Jun 2014

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers'. Together they form a unique fingerprint.

Cite this