2018
DOI: 10.1016/j.cma.2018.01.052
|View full text |Cite
|
Sign up to set email alerts
|

Improved conditioning of isogeometric analysis matrices for trimmed geometries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
28
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 37 publications
(28 citation statements)
references
References 35 publications
0
28
0
Order By: Relevance
“…where h u refers to the average knot span size of the initial level 0 of the basis and c e is a user-defined constant. According to [11], a good choice for this constant is c e = p /2. Local refinement along trimming curves is performed by adding hierarchical www.gamm-proceedings.com levels until the related extrapolation length d ( ) e complies with condition (11).…”
Section: Enhanced Control By Local Refinementmentioning
confidence: 99%
See 1 more Smart Citation
“…where h u refers to the average knot span size of the initial level 0 of the basis and c e is a user-defined constant. According to [11], a good choice for this constant is c e = p /2. Local refinement along trimming curves is performed by adding hierarchical www.gamm-proceedings.com levels until the related extrapolation length d ( ) e complies with condition (11).…”
Section: Enhanced Control By Local Refinementmentioning
confidence: 99%
“…According to [11], a good choice for this constant is c e = p /2. Local refinement along trimming curves is performed by adding hierarchical www.gamm-proceedings.com levels until the related extrapolation length d ( ) e complies with condition (11). For a detailed discussion the interested reader is referred to [11].…”
Section: Enhanced Control By Local Refinementmentioning
confidence: 99%
“…A similar framework was first studied in [34,5,35] for hierarchical B-splines defined on a rectangular planar grid, where no surface parametrization is used and local refinement is performed using a priori knowledge of the features of the problem. More recently, in [42,22], the use of truncated hierarchical B-splines in the context of the Laplace problem and linear elasticity was studied, where the emphasis is put on the issues of stability of the basis and bad conditioning of the system matrix caused by trimming and no real error indicator is employed. Lastly in [43], a fourth-order PDE, namely the Biharmonic problem, formulated on implicit domains was analyzed, where again no error-driven adaptive simulation is performed but refinement is steered a priori towards geometric features of interest.…”
Section: Introductionmentioning
confidence: 99%
“…Without dedicated treatments, the severe ill-conditioning of linear systems derived from immersed finite element methods generally forestalls convergence of iterative solution procedures. Multiple resolutions for these conditioning problems have been proposed, the most prominent of which are the ghost penalty, e.g., [4,5,37], constraining, extending, or aggregation of basis functions, e.g., [13,[38][39][40][41][42][43][44][45][46], and preconditioning, which is discussed in detail below.…”
Section: Introductionmentioning
confidence: 99%