Journal
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING
Volume 352, Issue -, Pages 437-460Publisher
ELSEVIER SCIENCE SA
DOI: 10.1016/j.cma.2019.04.031
Keywords
Isogeometric Analysis; Assembling matrices; Sum factorization
Funding
- European Research Council under the European Union [339643]
- Austrian Science Fund (FWF) [NFN S117-03, P31048]
- European Research Council (ERC) [339643] Funding Source: European Research Council (ERC)
- Austrian Science Fund (FWF) [P31048] Funding Source: Austrian Science Fund (FWF)
Ask authors/readers for more resources
The fast assembling of stiffness and mass matrices is a key issue in Isogeometric Analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one for matrix-free methods, and study the behavior of their computational complexity in terms of the spline order p. Opposed to the standard approach, these algorithms do not apply the idea element-wise, but globally or on macro-elements. If this approach is applied to Gauss quadrature, the computational complexity grows as p(d+2) instead of p(2d+1) as previously achieved. (C) 2019 Elsevier B.Y. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available