.png){kind=icon}
.png){kind=icon}
Return
Sum factorization techniques in Isogeometric Analysis
.png){kind=icon}
OA
AI
DOI：10.1016/j.cma.2019.04.031.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Isogeometric Analysis
Assembling matrices
Sum factorization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W