Matrix generation in isogeometric analysis by low rank tensor approximation

24Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It has been observed that the task of matrix assembly in Isogeometric Analysis (IGA) is more challenging than in the case of traditional finite element methods. The additional difficulties associated with IGA are caused by the increased degree and the larger supports of the functions that occur in the integrals defining the matrix elements. Recently we introduced an interpolation-based approach that approximately transforms the integrands into piecewise polynomials and uses look-up tables to evaluate their integrals [17,18]. The present paper relies on this earlier work and proposes to use tensor methods to accelerate the assembly process further. More precisely, we show how to represent the matrices that occur in IGA as sums of a small number of Kronecker products of auxiliary matrices that are defined by univariate integrals. This representation, which is based on a low-rank tensor approximation of certain parts of the integrands, makes it possible to achieve a significant speedup of the assembly process without compromising the overall accuracy of the simulation.

Cite

CITATION STYLE

APA

Mantzaflaris, A., Jüttler, B., Khoromskij, B. N., & Langer, U. (2015). Matrix generation in isogeometric analysis by low rank tensor approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9213, pp. 321–340). Springer Verlag. https://doi.org/10.1007/978-3-319-22804-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free