Plugin Buffa Lions Magenes

On local renement in Isogeometric analysis
Annalisa Bua
IMATI E. Magenes - Pavia Consiglio Nazionale delle Ricerche
ERC Starting Grant: GeoPDEs n. 205004
Laboratoire JLL - Paris

A. Bua (IMATI-CNR Italy) Journes Lions-Magenes e 1 / 31
Isogeometric Analysis: basics Construction of approximation spaces Approximation properties
IGA: local renement via T-splines Why it is non trivial On the denition of T-splines Reduced Regularity T-splines Analysis Suitable T-splines Construction of a projection and approximation properties
A. Bua (IMATI-CNR Italy)
Journes Lions-Magenes e
2 / 31
Part I IsoGeometric Analysis: basics
3 / 31
What is IGA?
Hughes, Cottrell, Bazilevs, CMAME, 2005
IGA: compute the solution of PDEs with NURBS/Splines on NURBS geometries.
4 / 31
What is IGA?
IGA: compute the solution of PDEs with NURBS/Splines on NURBS geometries. Non Uniform Rational B-Splines F() =
i
Ci Ri ()
4 / 31
What is IGA?
IGA: compute the solution of PDEs with NURBS/Splines on NURBS geometries.
4 / 31
Not so easy...
Today for IGA to work, we need a geometry described in terms of patches, and each patch have to have a trivariate NURBS description.
5 / 31
Not so easy...
Today for IGA to work, we need a geometry described in terms of patches, and each patch have to have a trivariate NURBS description. CADs descriptions are based on trimmed NURBS patches and are often leaking CAD systems do not have trivariate representations of geometries NURBS and B-splines have a tensor product structure...
5 / 31
Not so easy...
Today for IGA to work, we need a geometry described in terms of patches, and each patch have to have a trivariate NURBS description. CADs descriptions are based on trimmed NURBS patches and are often leaking CAD systems do not have trivariate representations of geometries NURBS and B-splines have a tensor product structure... But,
5 / 31
Not so easy...
Today for IGA to work, we need a geometry described in terms of patches, and each patch have to have a trivariate NURBS description. CADs descriptions are based on trimmed NURBS patches and are often leaking CAD systems do not have trivariate representations of geometries NURBS and B-splines have a tensor product structure... But, IGA is a big step towards interoperability:
Analysis-aware modeling (E. Cohen et al. 2010 ) Trivariate representation is possible for targeted applications (biomedical, rubber industry, car industry...) Use of local rened splines for both modeling and analysis: T-splines, LR splines, Hierarchical splines ...
5 / 31
Not so easy...
Today for IGA to work, we need a geometry described in terms of patches, and each patch have to have a trivariate NURBS description. CADs descriptions are based on trimmed NURBS patches and are often leaking CAD systems do not have trivariate representations of geometries NURBS and B-splines have a tensor product structure... But, IGA is a big step towards interoperability:
Analysis-aware modeling (E. Cohen et al. 2010 ) Trivariate representation is possible for targeted applications (biomedical, rubber industry, car industry...) Use of local rened splines for both modeling and analysis: T-splines, LR splines, Hierarchical splines ...
The use of Splines and NURBS in Analysis is a powerful tool.

B-splines k-renement
C0 Same approximation capability for moderate p !

A. Bua (IMATI-CNR Italy) Journes Lions-Magenes e
C p1
6 / 31
Isogeometric analysis: basics

parametric domain F physical domain
{Bi }i=1,...,N0
push forward of {Bi }i=1,...,N0
The geometry and its parametrization F is given by CAD
7 / 31

{Bi }i=1,...,N0
The geometry and its parametrization F is given by CAD F= Ci Bi
7 / 31

{Bi }i=1,...,N0
The geometry and P parametrization F is given by CAD its F= Ci Bi or F =

P Ci Bi wi Bi
or F = generalized B-spline
7 / 31

{Bi }i=1,...,N1
The geometry and its parametrization F is given by CAD The discrete space on is the push-forward of Spline/NURBS on the parametric domain.
7 / 31

{Bi }i=1,...,N2
The geometry and its parametrization F is given by CAD The discrete space on is the push-forward of Spline/NURBS on the parametric domain.
7 / 31

{Bi }i=1,...,N2
The geometry and its parametrization F is given by CAD The discrete space on is the push-forward of Spline/NURBS on the parametric domain. The geometry and its parametrization F does not change during mesh renement
Multipatch domains
If geometries are described by mappings of several patches.
F1
1
F2
F3
Patch interfaces are normally treated just imposing C 0 . . . C p/2 regularity domain decomposition type structure
Single patch versus multipatch geometry
single patch:
multi-patch:
Courtesy by T.J.R Hughes et al.
9 / 31
Basic approximation properties

Basilevs Beirao-da-Veiga et al 2006, Beirao-da-Veiga B. Rivas Sangalli et al 2010
Let Sh /Nh denote the space of mapped splines/NURBS of degree less or equal to p in each space direction and global regularity C ( p 1)
10 / 31

Let Sh /Nh denote the space of mapped splines/NURBS of degree less or equal to p in each space direction and global regularity C ( p 1) Approximation properties in Sobolev spaces There exist two operators S : H () Sh and N : H () Nh such that for all u H (), t < p + 1 u S u where h is the mesh size.
Hs
+ u N u
Hs
< Ch
10 / 31

Let Sh /Nh denote the space of mapped splines/NURBS of degree less or equal to p in each space direction and global regularity C ( p 1) Approximation properties in Sobolev spaces There exist two operators S : H () Sh and N : H () Nh such that for all u H (), t < p + 1 u S u where h is the mesh size. C (p )(
s) ... Hs
+ u N u
Hs
< Ch
true under the restriction
p1 . 2
10 / 31

Let Sh /Nh denote the space of mapped splines/NURBS of degree less or equal to p in each space direction and global regularity C ( p 1) Approximation properties in Sobolev spaces There exist two operators S : H () Sh and N : H () Nh such that for all u H (), t < p + 1 u S u where h is the mesh size. C (p )(
s) ... Hs
+ u N u
Hs
< Ch
true under the restriction
p1 . 2
Indeed, this means a gain for higher regularity in terms of degrees of freedoms.
Spline basis are not interpolatory, of course S is constructed by dual functionals. E.g., cubic splines: i = [si2 , si1 , si , si4 , si5 ] The 1D projector is S u =
i
Bi (i ) spline i (i ) dual
i (Bj ) = ij
i (u)Bi (s).
11 / 31
Spline basis are not interpolatory, of course S is constructed by dual functionals. E.g., cubic splines: i = [si2 , si1 , si , si4 , si5 ] The 1D projector is S u =
i
Bi (i ) spline i (i ) dual
i (Bj ) = ij
i (u)Bi (s).
The NURBS projector is also constructed in a similar way.

2d
11 / 31
Part II Isogeometric Analysis: local renement via T-splines
12 / 31
T-splines
Sederberg, et al, 2003, Sederberg, Cardon, Finnigan, North, Zheng, Lyche, 2004
13 / 31
T-splines
13 / 31
T-splines
13 / 31
Figure 2: Car door typically, a large number of NURBS control points serve no purpose other than to satisfy topological constraints. They carry no Figure 2 shows anoth signicant geometric information. In Figure 1.a, all the red NURBS Sederberg, et al, 2003, Sederberg, Cardon, Finnigan, North, Zheng, Lyche, 2004 points in a NURBS are control points are, in this sense, superuous. model is geometrically only 1/3 as many contr
T-splines
Figure 1: Head modeled (a) as a NURBS with 4712 control points Sederberg et al 2004 and (b) as a T-spline with 1109 control points. The red NURBS control points are superuous.
Figure 3: NURB
Superuous control not merely because they but also because they c as can be seen by comp Figure 3.a with that of can waste dozens of ho 13 points NURBS control / 31
T-splines
Sederberg, et al, 2003, Sederberg, Cardon, Finnigan, North, Zheng, Lyche, 2004 ref Renement strategy which ensures Sh Sh Possible diculties:
Linear independance Possible severe ll-in of the T-mesh Expensive (cycle on many elements) and not local There is no well dened de-renement strategy
T-splines promises are:

ecient local renement trimmed NURBS to T-splines conversion easier volume meshing patch gluing
a. B-spline surfaces
b. T-splines
T-splines by in idea, that we c splines are the plained in 5. T two or more B 6. NURCCs ar inition 13 /cubi of 31
T-splines
T-meshes can be very general partitions:
14 / 31
Linear dependence on patological T-meshes

Buffa, Cho, Sangalli, CMAME, 2010
We have: 1 = 2 + 1 3 !!! 3
15 / 31
Linear independance for fairly general meshes

16 / 31

16 / 31

But a general result is missing for general T-meshes.
16 / 31
Severe ll-in - the worse case scenario
Want to rene the gray quads
by split them in 4
17 / 31
Severe ll-in - the worse case scenario
C 2 basis functions
The red edges are there to ensure embedding!
18 / 31
Severe ll-in : second renement step
C 2 basis functions
The red edges are there to ensure embedding!
19 / 31
Severe Fill-in ... or not?

Fill-in of the T-mesh for C 2 cubic splines
M.R. Dorfel, B. Juttler, et al. 2009
20 / 31
Severe Fill-in ... or not?

Fill-in of the T-mesh for C 2 cubic splines Local behaviour for C1 cubic splines
M.R. Dorfel, B. Juttler, et al. 2009
Buffa, Cho, Kumar 2011
20 / 31
ination ination DD DEGREE CASE: M M M E ODD DEGREE CASE: M T-splines Reduced regularity anchor at aat a2011of M M vertex one anchor B. Cho Kumar vertex of T-spline associated with the anchor one T-spline associated with the anchor
Given a T-mesh, we construct C 1 cubic T-splines, by counting all knots 2 times.
M, p =p3= 3 M,
M, M, p =p3= 3
ICES, ICES, Austin TX,2011 2011 / 187 / 18 Austin TX, Jan. Jan. 7
Cho (Math. Dept.)Dept.) rkbin Cho (Math.
Characterization of T-splines Characterization of T-splines
21 / 31
ination E ODD DEGREE CASE: ination M M DD DEGREE CASE: M M Reduced regularity T-splines one anchoraat a2011of M M anchor at vertex B. Cho Kumar vertex of one T-spline associated with the anchor T-spline associated with the anchor
( + 1)2 T-splines attached to each vertex v on M, which are denoted v 2 by k 1 k ( construct C 1 cubic T-splines, by counting all knots 2 GivenBa ,T-mesh, we + 1)
times.
M, p =p3= 3 M,
M, M, p =p3= 3
rkbin Cho (Math. Cho (Math. Dept.)Dept.)
21 / 31
ination E ODD DEGREE CASE: ination M M DD DEGREE CASE: M M Reduced regularity T-splines one anchoraat a2011of M M anchor at vertex B. Cho Kumar vertex of one T-spline associated with the anchor T-spline associated with the anchor
( + 1)2 T-splines attached to each vertex v on M, which are denoted v 2 by k 1 k ( construct C 1 cubic T-splines, by counting all knots 2 GivenBa ,T-mesh, we + 1)
times.
M, p =p3= 3 M, For degree p odd, C (p+1) times... 2

p1 2
T-splines are constructed by repeating the knots

M, M, p =p3= 3
rkbin Cho (Math. Cho (Math. Dept.)Dept.)
21 / 31
Regular T-meshes
Idea: Restrict the class of reasonable T-meshes. We construct one-bay T-junction extensions:
one-bay
22 / 31
Regular T-meshes
one-bay
Denition We say that a T-mesh is regular if (closed) bay extensions do not intersect.
22 / 31
Regular T-meshes
Denition We say that a T-mesh is regular if (closed) bay extensions do not intersect.
22 / 31
Regular T-meshes
A lot can be proved for reduced regularity splines... Characterization in terms of piecewise polynomials : if p is odd and bay extensions are away from the boundary S(p, M) = C (p, M) = {u C (p1)/2 : u|Q Qp Q M} Topological characterization of the embedding : M1 M2 and M1 M2 S(p, M1 ) S(p, M2 )
23 / 31
Regular T-meshes
A lot can be proved for reduced regularity splines... Characterization in terms of piecewise polynomials : if p is odd and bay extensions are away from the boundary S(p, M) = C (p, M) = {u C (p1)/2 : u|Q Qp Q M} Topological characterization of the embedding : M1 M2 and M1 M2 S(p, M1 ) S(p, M2 ) So, looking at the mesh, we know if the spaces are embedded and if they contain the polynomials we want !
23 / 31
Renement Algorithm
1. Start with a tensor product mesh 2. Mark elements for renement and rene 3. Detect intersections of bay extensions 4. Add to the mesh one of intersecting extensions and go back to 3. The algorithm stays local and seems to work well.
24 / 31
Run of the algorithm

Worse case scenario:
S(p, M0 )
S(p, M1 )
S(p, M2 )
S(p, M3 )
25 / 31
Run of the algorithm

Worse case scenario:
(d) The second T-mesh (a) The starting T-mesh (b) Initial solution
S(p, M0 )
Convection diusion problem:
(d) The second T-mesh The(e) Rened solut (g) third T-mesh (a) The starting T-mesh (b) Initial solution with 1806 DOF (c) E DOF
S(p, M1 )
S(p, M2 )
S(p, M3 )
25 / 31
Back to regular splines

Before summer this year... X. Li, M. Scott, T. Hughes have introduced Analysis suitable (AS) T-meshes for cubic T-splines
(a) A T-mesh M.
26 / 31

(a) A T-mesh M.
(b) Extensions on M.
26 / 31

(a) A T-mesh M.
(b) Extensions on M.
Denition An AS T-mesh is one on which no horizontal T-junction extension intersects a vertical T-junction extension AS T-splines are dened on AS T-meshes

An AS T-mesh M Denition An AS T-mesh is one on which no horizontal T-junction extension intersects a vertical T-junction extension AS T-splines are dened on AS T-meshes
Analysis-Suitable (AS) T-splines

Li et al. (2011, CAGD), Scott et al., Li et al. (Tech. rep., 2011)
27 / 31

Properties of AS T-splines: Positivity.
27 / 31

Properties of AS T-splines: Positivity. Linear independence.
27 / 31

Properties of AS T-splines: Positivity. Linear independence. Relatively local renement (numerics)
27 / 31

Properties of AS T-splines: Positivity. Linear independence. Relatively local renement (numerics) Partition of unity. = ane invariance.
27 / 31

Properties of AS T-splines: Positivity. Linear independence. Relatively local renement (numerics) Partition of unity. = ane invariance. Positivity and Partition of unity = convex hull.
27 / 31

Properties of AS T-splines: Positivity. Linear independence. Relatively local renement (numerics) Partition of unity. = ane invariance. Positivity and Partition of unity = convex hull. All proofs are based on topological properties of the mesh... what about function spaces? Characterization in terms of piecewise polynomials Projections and approximation properties
27 / 31
A property of AS T-splines
Beirao-da-Veiga, B., Cho, Sangalli 2011
Given a AS T-mesh M, we say that two T-splines partially overlap if their knot vectors come from a common knot vector at least in one direction.
28 / 31
Given a AS T-mesh M, we say that two T-splines partially overlap if their knot vectors come from a common knot vector at least in one direction. DO NOT overlap
28 / 31
DO overlap
28 / 31
DO overlap
Theorem A T-mesh M is AS if and only if is each couple of T-splines dened on M partially overlaps. The proof is not trivial . . .
Construction of dual-based projectors

1d
Let (s, t) be a node of the mesh with associated knot vectors,

s t ( , )
t and
s t B (s, t) = B(s; )B(t; ) , s t = ( )( ) ,
T-spline dual functionals
And now it is trivial to see 1 ,1 (B2 ,2 ) = 1 ,2 1 ,2 if the two T-splines B1 ,1 and B2 ,2 (and thus their knot vectors) partially overlap.
29 / 31

1d
Let (s, t) be a node of the mesh with associated knot vectors,

s t ( , )
t and
s t B (s, t) = B(s; )B(t; ) , s t = ( )( ) ,
T-spline dual functionals
And now it is trivial to see 1 ,1 (B2 ,2 ) = 1 ,2 1 ,2 if the two T-splines B1 ,1 and B2 ,2 (and thus their knot vectors) partially overlap. Main Theorem On a AS T-mesh, the functionals { , ( ) T-node} form a local dual , , basis to the set of T-splines.
Let S(M) be the span of all T-splines on M, then: there exists a local stable projection : L2 ((0, 1)2 ) S(M); if 1 S(M), the set of T-splines forms a partition of unity; if the global cubic polynomial belongs to the space, then: ||f [f ]||L2 (Q) C (hQ )r |f |H r (Q) e e Q M, f H r ([0, 1]2 ).
where 0 r 4, Q is the union of supports of functions interacting with Q.
30 / 31
More on AS T-splines
AS T-splines can now be extended in several space dimensions Error estimates in the physical domain is feasible (in progress)
31 / 31
AS T-splines can now be extended in several space dimensions Error estimates in the physical domain is feasible (in progress) An ecient local renement has still to be understood..
31 / 31
AS T-splines can now be extended in several space dimensions Error estimates in the physical domain is feasible (in progress) An ecient local renement has still to be understood.. Error indicators should be adapted to regular functions.
31 / 31
AS T-splines can now be extended in several space dimensions Error estimates in the physical domain is feasible (in progress) An ecient local renement has still to be understood.. Error indicators should be adapted to regular functions.
Grazie per lattenzione! Merci de votre attention! http://www.imati.cnr.it/annalisa
31 / 31

Plugin Buffa Lions Magenes

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Plugin Buffa Lions Magenes

Uploaded by

Copyright:

Available Formats

On local renement in Isogeometric analysis

IMATI E. Magenes - Pavia Consiglio Nazionale delle Ricerche

ERC Starting Grant: GeoPDEs n. 205004

Laboratoire JLL - Paris

Isogeometric Analysis: basics Construction of approximation spaces Approximation properties

A. Bua (IMATI-CNR Italy)

Part I IsoGeometric Analysis: basics

A. Bua (IMATI-CNR Italy)

IGA: compute the solution of PDEs with NURBS/Splines on NURBS geometries.

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

IGA: compute the solution of PDEs with NURBS/Splines on NURBS geometries.

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

The use of Splines and NURBS in Analysis is a powerful tool.

C0 Same approximation capability for moderate p !

Isogeometric analysis: basics

push forward of {Bi }i=1,...,N0

The geometry and its parametrization F is given by CAD

A. Bua (IMATI-CNR Italy)

Isogeometric analysis: basics

push forward of {Bi }i=1,...,N0

The geometry and its parametrization F is given by CAD F= Ci Bi

A. Bua (IMATI-CNR Italy)

Isogeometric analysis: basics

push forward of {Bi }i=1,...,N0

The geometry and P parametrization F is given by CAD its F= Ci Bi or F =

A. Bua (IMATI-CNR Italy)

Isogeometric analysis: basics

push forward of {Bi }i=1,...,N1

A. Bua (IMATI-CNR Italy)

Isogeometric analysis: basics

push forward of {Bi }i=1,...,N2

A. Bua (IMATI-CNR Italy)

Isogeometric analysis: basics

push forward of {Bi }i=1,...,N2

Single patch versus multipatch geometry

A. Bua (IMATI-CNR Italy)

Basic approximation properties

A. Bua (IMATI-CNR Italy)

Basic approximation properties

A. Bua (IMATI-CNR Italy)

Basic approximation properties

true under the restriction

A. Bua (IMATI-CNR Italy)

Basic approximation properties

true under the restriction

Basic approximation properties

A. Bua (IMATI-CNR Italy)

Basic approximation properties

The NURBS projector is also constructed in a similar way.

A. Bua (IMATI-CNR Italy)

Part II Isogeometric Analysis: local renement via T-splines

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

A. Bua (IMATI-CNR Italy)

T-splines promises are:

A. Bua (IMATI-CNR Italy)