Partial tensor decomposition for decoupling isogeometric Galerkin discretizations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Methods in Applied Mechanics and Engineering Year : 2018

Partial tensor decomposition for decoupling isogeometric Galerkin discretizations

Abstract

System matrix assembly for isogeometric (i.e., spline-based) discretizations of partial differential equations is more challenging than for classical finite elements, due to the increased polynomial degrees and the larger (and hence more overlapping) supports of the basis functions. The global tensor-product structure of the discrete spaces employed in isogeometric analysis can be exploited to accelerate the computations, using sum factorization, precomputed look-up tables, and tensor decomposition. We generalize the third approach by considering partial tensor decompositions. We show that the resulting new method preserves the global discretization error and that its computational complexity compares favorably to the existing approaches. Moreover, the numerical realization simplifies considerably since it relies on standard techniques from numerical linear algebra.
Fichier principal
Vignette du fichier
Partialtensordecomp3d.pdf (1.1 Mo) Télécharger le fichier
Vignette du fichier
vignette.png (292.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

hal-02271800 , version 1 (27-08-2019)

Identifiers

Cite

Felix Scholz, Angelos Mantzaflaris, Bert Jüttler. Partial tensor decomposition for decoupling isogeometric Galerkin discretizations. Computer Methods in Applied Mechanics and Engineering, 2018, 336, pp.485-506. ⟨10.1016/j.cma.2018.03.026⟩. ⟨hal-02271800⟩
57 View
127 Download

Altmetric

Share

Gmail Facebook X LinkedIn More