Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download


https://hal.inria.fr/hal-02271800
Contributor : Angelos Mantzaflaris <>
Submitted on : Tuesday, August 27, 2019 - 11:24:01 AM
Last modification on : Thursday, November 26, 2020 - 3:50:03 PM

Files

Partialtensordecomp3d.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

73

Files downloads

447