Analysis and Applications of Polygonal and Serendipity Finite Element Methods
|
|
- Bertram Byron Barker
- 5 years ago
- Views:
Transcription
1 Analysis and Applications of Polygonal and Serendipity Finite Element Methods Andrew Gillette Department of Mathematics University of California, San Diego agillette/ Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
2 What are a priori FEM error estimates? Poisson s equation in 2D: Given a domain D R 2 and f : D R, find u such that strong form u = f u H 2 (D) weak form u φ = f φ φ H 1 (D) discrete form D D u h φ h = Typical finite element method: D D f φ h φ h V h finite dimen. H 1 (D) Mesh D by polygons {Ω} with vertices {v i }; define h := max diam(ω). Fix basis functions λ i with local piecewise support, e.g. barycentric functions. Define u h such that it uses the λ i to approximate u, e.g. u h := i u(v i)λ i A linear system for u h can then be derived, admitting an a priori error estimate: u u h H 1 (Ω) C h p u H }{{} 2 (Ω), u H p+1 (Ω), }{{} approximation error optimal error bound provided that the λ i span all degree p polynomials on each polygon Ω. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
3 Modern applications require new theory u u h H 1 (Ω) C h p u H 2 (Ω), u H2 (Ω) Modern applications such as patient-specific cardiac electrophysiology need efficient, stable, error-bounded real-time methods. These methods require both accurate geometry approximation (small h) and accurate function approximation (large p), but both are computationally expensive. Two trends in Finite Element Methods research can help: 1 Polygonal & polyhedral generalized barycentric coordinate FEM Greater geometric flexibility from polygonal meshing can alleviate known difficulties with simplicial and cubical elements. 2 Serendipity finite element methods Long observed but only recently formalized theory ensuring order p function approximation with many fewer basis functions than expected. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
4 Table of Contents 1 Linear Polygonal Elements with GBCs 2 Quadratic Serendipity Elements on Polygons 3 Cubic Hermite Serendipity Elements on Cubes 4 Current and Future Work Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
5 Outline 1 Linear Polygonal Elements with GBCs 2 Quadratic Serendipity Elements on Polygons 3 Cubic Hermite Serendipity Elements on Cubes 4 Current and Future Work Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
6 The generalized barycentric coordinate approach Fix Ω R 2 a convex polygon with vertices v 1,..., v n. We call functions λ i : Ω R generalized barycentric coordinates (GBCs) if they satisfy: λ i 0 on Ω L = n L(v i )λ i, i=1 L : Ω R linear Familiar properties are implied by this definition: n n λ i 1 v i λ i (x) = x i=1 }{{} partition of unity i=1 } {{ } linear precision λ i (v j ) = δ ij }{{} interpolation traditional FEM family of GBC reference elements Bilinear Map Unit Diameter Affine Map T Reference Element Physical Element T Ω Ω Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
7 Many generalizations to choose from... Triangulation FLOATER, HORMANN, KÓS, A general construction of barycentric coordinates over convex polygons, λ Tm i (x) λ i (x) λ T M i (x) 1 Wachspress WACHSPRESS, A Rational Finite Element Basis, Sibson / Laplace SIBSON, A vector identity for the Dirichlet tessellation, HIYOSHI, SUGIHARA, Voronoi-based interpolation with higher continuity, Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
8 Many generalizations to choose from... x α i ri v i+1 Mean value FLOATER, Mean value coordinates, FLOATER, KÓS, REIMERS, Mean value coordinates in 3D, α i 1 v i v i 1 u = 0 Harmonic WARREN, Barycentric coordinates for convex polytopes, WARREN, SCHAEFER, HIRANI, DESBRUN, Barycentric coordinates for convex sets, CHRISTIANSEN, A construction of spaces of compatible differential forms on cellular complexes, Many more papers could be cited (maximum entropy coordinates, moving least squares coordinates, surface barycentric coordinates, etc...) Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
9 Comparison via eyeball norm Andrew Gillette - UCSD Triangulated Triangulated Wachspress Mean Value Polygonal () & Serendipity FEM SMU - Feb / 45
10 Comparison via eyeball norm Wachspress Sibson Mean Value Discrete Harmonic Andrew Gillette - UCSD Polygonal () & Serendipity FEM SMU - Feb / 45
11 Optimal Convergence Estimates on Polygons Let Ω be a convex polygon with vertices v 1,..., v n. For linear elements, an optimal convergence estimate has the form n u u(v i )λ i C diam(ω) u H 2 (Ω), u H 2 (Ω). (1) i=1 H }{{ 1(Ω) }{{}} optimal error bound approximation error The Bramble-Hilbert lemma in this context says that any u H 2 (Ω) is close to a first order polynomial in H 1 norm. VERFÜRTH, A note on polynomial approximation in Sobolev spaces, Math. Mod. Num. An., DEKEL, LEVIATAN, The Bramble-Hilbert lemma for convex domains, SIAM J. Math. An., For (1), it suffices to prove an H 1 -interpolant estimate over domains of diameter one: n u(v i )λ i C I u H 2 (Ω), u H1 (Ω). (2) H 1(Ω) i=1 For (2), it suffices to bound the gradients of the {λ i }, i.e. prove C λ R such that λ i L 2 (Ω) C λ. (3) Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
12 Geometric Hypotheses for Convergence Estimates v1 v1 To bound the gradients of the coordinates, we need control of the element geometry. Let ρ(ω) denote the radius of the largest inscribed circle. The aspect ratio γ is defined by γ = diam(ω) ρ(ω) (2, ) Three possible geometric conditions on a polygonal mesh: G1. BOUNDED ASPECT RATIO: γ < such that γ < γ G2. MINIMUM EDGE LENGTH: d > 0 such that v i v i 1 > d G3. MAXIMUM INTERIOR ANGLE: β < π such that β i < β Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
13 A key geometric proposition Proposition Suppose G1 (max aspect ratio γ ) and G2 (min edge length d ) hold. Define h := d 2γ (1 + d ) > 0 Then for all x Ω, B(x, h ) does not intersect any two non-adjacent edges of Ω. Proof: Suppose B(x, h) intersects two non-adjacent edges for some h > 0. The wedge W formed by these edges can be used to show that either G1 fails (contradiction) or h > h. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
14 Gradient bound for mean value coordinates x αi αi 1 vi 1 ri vi+1 Theorem vi The mean value coordinates are defined by λ MV w i (x) i (x) := n j=1 w j(x) tan w i (x) := ( αi (x) 2 ) + tan v i x ( αi 1 (x) Suppose G1 (max aspect ratio γ ) and G2 (min edge length d ) hold. Let λ i be the mean value coordinates. Then there exists C λ > 0 such that λ i H 1 (Ω) C λ 2 ) Proof: Divide analysis into six cases based on proximity to v a and size of α i and α j r a v a Case 1/2 x v i (Case 1) v j (Case 2) α i/α j v a Case 3/4 r a x v i (Case 3) v j (Case 4) α i/α j Case 5 v j r a v a x α j α i Case 6 v j v a r a x α j α i v i v i Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
15 Polygonal Finite Element Optimal Convergence Theorem In the table, any necessary geometric criteria to achieve the a priori linear error estimate are denoted by N. The set of geometric criteria denoted by S in each row taken together are sufficient to guarantee the estimate. G1 (aspect ratio) G2 (min edge length) G3 (max interior angle) Triangulated λ Tri - - S,N Wachspress λ Wach S S S,N Sibson λ Sibs S S - Mean Value λ MV S S - Harmonic λ Har S - - G., RAND, BAJAJ Error Estimates for Generalized Barycentric Interpolation Advances in Computational Mathematics, 37:3, , 2012 RAND, G., BAJAJ Interpolation Error Estimates for Mean Value Coordinates, Advances in Computational Mathematics, in press, Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
16 Outline 1 Linear Polygonal Elements with GBCs 2 Quadratic Serendipity Elements on Polygons 3 Cubic Hermite Serendipity Elements on Cubes 4 Current and Future Work Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
17 From linear to quadratic elements A naïve quadratic element is formed by products of linear GBCs: {λ i } pairwise products {λ aλ b } Why is this naïve? For an n-gon, this construction gives n + ( n 2) basis functions λaλ b The space of quadratic polynomials is only dimension 6: {1, x, y, xy, x 2, y 2 } Conforming to a linear function on the boundary requires 2 degrees of freedom per edge only 2n functions needed! Problem Statement Construct 2n basis functions associated to the vertices and edge midpoints of an arbitrary n-gon such that a quadratic convergence estimate is obtained. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
18 Polygonal Quadratic Serendipity Elements We define matrices A and B to reduce the naïve quadratic basis. filled dot = Lagrangian domain point = all functions in the set evaluate to 0 except the associated function which evaluates to 1 open dot = non-lagrangian domain point = partition of unity satisfied, but not Lagrange property {λ i } n pairwise products {λ aλ b } n + ( ) n 2 A {ξ ij } 2n B {ψ ij } Linear Quadratic Serendipity Lagrange 2n Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
19 From quadratic to serendipity The bases are ordered as follows: ξ ii and λ aλ a = basis functions associated with vertices ξ i(i+1) and λ aλ a+1 = basis functions associated with edge midpoints λ aλ b = basis functions associated with interior diagonals, i.e. b / {a 1, a, a + 1} Serendipity basis functions ξ ij are a linear combination of pairwise products λ aλ b : ξ ii. ξ i(i+1) = A λ aλ a. λ aλ a+1. λ aλ b = c11 11 cab 11 c 11 (n 2)n c ij 11 c ij ab c ij (n 2)n c n(n+1) 11 c n(n+1) ab c n(n+1) (n 2)n λ aλ a. λ aλ a+1. λ aλ b Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
20 From quadratic to serendipity We require the serendipity basis to have quadratic approximation power: Constant precision: 1 = ξ ii + 2ξ i(i+1) i Linear precision: x = v i ξ ii + 2v i(i+1) ξ i(i+1) i Quadratic precision: xx T = v i v T i ξ ii + (v i v T i+1 + v i+1 v T i )ξ i(i+1) i ξ b(b+1) ξ bb ξ b(b 1) Theorem Constants {cij ab } exist for any convex polygon such that the resulting basis {ξ ij } satisfies constant, linear, and quadratic precision requirements. ξ a(a 1) ξ aa ξ a(a+1) λ a λ b Proof: We produce a coefficient matrix A with the structure A := [ I A ] where A has only six non-zero entries per column and show that the resulting functions satisfy the six precision equations. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
21 Pairwise products vs. Lagrange basis Even in 1D, pairwise products of barycentric functions do not form a Lagrange basis at interior degrees of freedom: 1 λ 0 λ 0 λ 1 λ 1 1 ψ 00 ψ 11 ψ01 λ 0 λ 1 Pairwise products 1 Lagrange basis 1 Translation between these two bases is straightforward and generalizes to the higher dimensional case. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
22 From serendipity to Lagrange {ξ ij } B {ψ ij } [ψ ij ] = ψ 11 ψ ψ nn ψ 12 ψ ψ n1 = ξ 11 ξ ξ nn ξ 12 ξ ξ n1 = B[ξ ij ]. Andrew Gillette - UCSD ( ) Polygonal & Serendipity FEM SMU - Feb / 45
23 Serendipity Theorem {λ i } pairwise products {λ aλ b } A {ξ ij } B {ψ ij } Theorem Given bounds on polygon aspect ratio (G1), minimum edge length (G2), and maximum interior angles (G3): A is uniformly bounded, B is uniformly bounded, and span{ψ ij } P 2 (R 2 ) = quadratic polynomials in x and y We obtain the quadratic a priori error estimate: u u h H 1 (Ω) C h 2 u H 3 (Ω) RAND, G., BAJAJ Quadratic Serendipity Finite Element on Polygons Using Generalized Barycentric Coordinates, Submitted, 2011 Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
24 Special case of a square v14 v4 v34 v3 v23 Bilinear functions are barycentric coordinates: λ 1 = (1 x)(1 y) λ 2 = x(1 y) λ 3 = xy λ 4 = (1 x)y v1 ξ 11 ξ 22 ξ 33 ξ 44 ξ 12 ξ 23 ξ 34 ξ 14 v12 = v2 Compute [ξ ij ] := [ ] I A [λaλ b ] λ 1 λ 1 λ 2 λ 2 λ 3 λ 3 λ 4 λ 4 λ 1 λ 2 = λ 2 λ 3 λ 3 λ 4 λ 1 λ /2 1/ /2 1/ /2 1/ /2 1/2 (1 x)(1 y)(1 x y) x(1 y)(x y) xy( 1 + x + y) (1 x)y(y x) (1 x)x(1 y) x(1 y)y (1 x)xy (1 x)(1 y)y span { ξ ii, ξ i(i+1) } = span {1, x, y, x 2, y 2, xy, x 2 y, xy 2} =: S 2 (I 2 ) Hence, this provides a computational basis for the serendipity space S 2 (I 2 ) defined in ARNOLD, AWANOU The serendipity family of finite elements, Found. Comp. Math, Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
25 Numerical evidence for non-affine image of a square Instead of mapping, use quadratic serendipity GBC interpolation with mean value coordinates: n ( vi + v ) i+1 u h = I qu := u(v i )ψ ii + u ψ i(i+1) 2 n = 2 n = 4 i=1 Non-affine bilinear mapping u u h L 2 (u u h ) L 2 n error rate error rate 2 5.0e-2 6.2e e e e e e e e e e e ARNOLD, BOFFI, FALK, Math. Comp., 2002 Quadratic serendipity GBC method u u h L 2 (u u h ) L 2 n error rate error rate e e e e e e e e e e e e e e e e Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
26 Outline 1 Linear Polygonal Elements with GBCs 2 Quadratic Serendipity Elements on Polygons 3 Cubic Hermite Serendipity Elements on Cubes 4 Current and Future Work Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
27 Serendipity Spaces on Cubes in R d Tensor product methods on cubical meshes in R d are well known, but serendipity methods will converge at the same rate with fewer basis functions per element: tensor product elements O(h) O(h 2 ) O(h 3 ) O(h) O(h 2 ) O(h 3 ) serendipity elements Example: For O(h 3 ), d = 3, 50% fewer functions 50% smaller linear system Many modern applications use tensor product elements, often due to ease of implementation. Serendipity elements can reduce computation time, but implementation requires a geometric decomposition. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
28 What is a geometric decomposition? A geometric decomposition for a finite element space is an explicit correspondence: {1, x, y, x 2, y 2, xy, x 3, y 3, x 2 y, xy 2, x 3 y, xy 3 } {ϑ 11, ϑ 14, ϑ 41, ϑ 44, ϑ 12, ϑ 13, ϑ 42, ϑ 43, ϑ 21, ϑ 31, ϑ 24, ϑ 34 } monomials basis functions domain points Previously known basis functions employ Legendre polynomials These functions bear no symmetrical correspondence to the domain points 1 (x 1)(y 1) ( x 2 1 ) (y 1) 1 5 x ( x 2 1 ) (y 1) 4 2 vertex edge (quadratic) edge (cubic) SZABÓ AND I. BABUŠKA Finite element analysis, Wiley Interscience, Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
29 Cubic Hermite Geometric Decomposition: 1D {1, x, x 2, x 3 } {ψ 1, ψ 2, ψ 3, ψ 4 } approxim. geometry monomials basis functions domain points Cubic Hermite Basis on [0, 1] Approximation: x r = ψ 1 ψ 2 ψ 3 := ψ 4 1 3x 2 + 2x 3 x 2x 2 + x 3 x 2 x 3 3x 2 2x ε r,i ψ i, for r = 0, 1, 2, 3, where [ε r,i ] = i= Geometry: u = u(0)ψ 1 + u (0)ψ 2 u (1)ψ 3 + u(1)ψ 4, u P 3 ([0, 1]) }{{} cubic polynomials Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
30 Cubic Hermite Geometric Decomposition: 2D { x r y s } } 0 r, s 3 {{ } Q 3 ([0, 1] 2 ) { ψi (x)ψ j (y) 1 i, j 4 } monomials basis functions domain points Approximation: x r y s = 4 4 ε r,i ε s,j ψ ij, for 0 r, s 3, ε r,i as in 1D. i=1 j=1 Geometry: ψ 11 ψ 21 ψ 22 u = u (0,0) ψ 11 + xu (0,0) ψ 21 + yu (0,0) ψ 12 + x yu (0,0) ψ 22 +, u Q 3 ([0, 1] 2 ) Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
31 Cubic Hermite Geometric Decomposition: 3D { x r y s z t } } 0 r, s, t 3 {{ } Q 3 ([0, 1] 3 ) ψ i(x)ψ j (y)ψ k (z) 1 i, j, k monomials basis functions domain points Approximation: x r y s z t = ε r,i ε s,j ε t,k ψ ijk, for 0 r, s, t 3, ε r,i as in 1D. i=1 j=1 k=1 Geometry: Contours of level sets of the basis functions: ψ 111 ψ 112 ψ 212 ψ 222 Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
32 Two families of finite elements on cubical meshes Q r Λ k ([0, 1] n ) standard tensor product spaces early work: RAVIART, THOMAS 1976, NEDELEC 1980 more recently: ARNOLD, BOFFI, BONIZZONI arxiv: , 2012 ( degree r in each variable) S r Λ k ([0, 1] n ) serendipity finite element spaces (superlinear degree r) early work: STRANG, FIX An analysis of the finite element method 1973 more recently: ARNOLD, AWANOU FoCM 11:3, 2011, and arxiv: , The superlinear degree of a polynomial ignores linearly-appearing variables. Q 3 Λ 0 ([0,1] 2 ) (dim=16) {}}{ n = 2 : { 1, x, y, x 2, y 2, xy, x 3, y 3, x 2 y, xy 2, x 3 y, xy 3, x 2 y 2, x 3 y 2, x 2 y 3, x 3 y 3 } }{{} S 3 Λ 0 ([0,1] 2 ) (dim=12) Q 3 Λ 0 ([0,1] 3 ) (dim=64) {}}{ n = 3 : { 1,..., xyz, x 3 y, x 3 z, y 3 z,..., x 3 yz, xy 3 z, xyz 3, x 3 y 2,..., x 3 y 3 z 3 } }{{} S 3 Λ 0 ([0,1] 3 ) (dim=32) Q r Λ k and S r Λ k and have the same key mathematical properties needed for stability (degree, inclusion, trace, subcomplex, unisolvence, commuting projections) but for fixed k 0, r, n 2 the serendipity spaces have fewer degrees of freedom Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
33 Cubic Hermite Serendipity Geom. Decomp: 2D Theorem [G, 2012]: A Hermite-like geometric decomposition of S 3 ([0, 1] 2 ) exists. { x r y s } } sldeg 3 {{ } S 3 ([0, 1] 2 ) { ϑ lm (to be defined) } monomials basis functions domain points Approximation: x r y s = lm ε r,i ε s,j ϑ lm, for superlinear degree(x r y s ) 3 Geometry: ϑ 11 ϑ 21 u = u (0,0) ϑ 11 + xu (0,0) ϑ 21 + yu (0,0) ϑ 12 + u S 3 ([0, 1] 2 ) Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
34 Cubic Hermite Serendipity Geom. Decomp: 2D Proof Overview: (akin to quadratic approach on polygons) 1 Fix index sets and basis orderings based on domain points: V = vertices (11, 14,...) E = edges (12, 13,...) D = interior (22, 23,...) [ϑ lm ] := [ ϑ 11, ϑ 14, ϑ 41, ϑ 44, ϑ 12, ϑ 13, ϑ 42, ϑ 43, ϑ 21, ϑ 31, ϑ 24, ϑ 34 ], [ψ ij ] := [ ψ 11, ψ 14, ψ 41, ψ 44, ψ 12, ψ 13, ψ 42, ψ 43, ψ 21, ψ 31, ψ 24, ψ 34, ψ 22, ψ 23, ψ 32, ψ 33 ] }{{}}{{}}{{} indices in V indices in E indices in D 2 Define a matrix H with entries h lm ij so that lm V E, ij V E D. 3 Define the serendipity basis functions ϑ lm via [ϑ lm ] := H[ψ ij ] and show that the approximation and geometry properties hold. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
35 Cubic Hermite Serendipity Geom. Decomp: 2D Proof Details: 2 Define a matrix H with entries hij lm so that lm V E, ij V E D I H := (12x12 identity matrix) Define [ϑ lm ] := H[ψ ij ]. The geometry property holds since for lm V E, ϑ lm = ψ lm + }{{} ij D bicubic Hermite hij lm ψ ij }{{} zero on boundary = ϑ lm ψ lm on edges Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
36 Cubic Hermite Serendipity Geom. Decomp: 2D Proof Details: To prove that the approximation property holds, observe: [ϑ lm ] := H[ψ ij ] implies ij hij lm ψ ij = ϑ lm For all (r, s) pairs such that sldeg(x r y s ) 3, the matrix entries in column ij satisfy ε r,i ε s,j = ε r,l ε s,mhij lm lm V E Substitute these into the Hermite 2D approximation property: x r y s = ε r,l ε s,mhij lm ψ ij ε r,i ε s,j ψ ij = ij V E D ij = ε r,l ε s,m hij lm ψ ij = ε r,l ε s,mϑ lm lm lm ij Hence [ϑ lm ] is a basis for S 2 ([0, 1] 2 ), completing the geometric decomposition. lm Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
37 Hermite Style Serendipity Functions (2D) ϑ 11 (x 1)(y 1)( 2 + x + x 2 + y + y 2 ) ϑ 14 (x 1)(y + 1)( 2 + x + x 2 y + y 2 ) ϑ 41 (x + 1)(y 1)( 2 x + x 2 + y + y 2 ) ϑ 44 (x + 1)(y + 1)( 2 x + x 2 y + y 2 ) ϑ 12 (x 1)(y 1) 2 (y + 1) ϑ [ϑ lm ] = 13 = (x 1)(y 1)(y + 1) 2 ϑ 42 (x + 1)(y 1) 2 (y + 1) 1 8 ϑ 43 (x + 1)(y 1)(y + 1) 2 ϑ 21 ϑ (x 1) 2 (x + 1)(y 1) 31 ϑ (x 1)(x + 1) 2 (y 1) 24 (x 1) 2 (x + 1)(y + 1) ϑ 34 (x 1)(x + 1) 2 (y + 1) ϑ 11 ϑ 21 ϑ 31 Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
38 Cubic Hermite Serendipity Geom. Decomp: 3D Theorem [G, 2012]: A Hermite-like geometric decomposition of S 3 ([0, 1] 3 ) exists. { x r y s z t } } sldeg 3 {{ } S 3 ([0, 1] 3 ) { ϑ lmn (to be defined) } monomials basis functions domain points Approximation: x r y s z t = lmn ε r,i ε s,j ε t,k ϑ lmn, for superlinear degree(x r y s z t ) 3 Geometry: u = u (0,0,0) ϑ xu (0,0,0) ϑ yu (0,0,0) ϑ zu (0,0,0) ϑ u S 3 ([0, 1] 3 ) ϑ 111 ϑ 112 Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
39 Cubic Hermite Serendipity Geom. Decomp: 3D Proof Overview: 1 Fix index sets and basis orderings based on domain points: V = vertices (111,...) E = edges (112,...) F = face interior (122,...) M = volume interior (222,...) [ϑ lmn ] := [ ϑ 111,..., ϑ 444, ϑ 112,..., ϑ 443 ], [ψ ijk ] := [ ψ 111,..., ψ 444, ψ 112,..., ψ 443, ψ 122,..., ψ 433, ψ 222,..., ψ 333 ] }{{}}{{}}{{}}{{} indices in V indices in E indices in F indices in M 2 Define a matrix W with entries h lmn ijk (where lmn V E) 3 Define the serendipity basis functions ϑ lmn via [ϑ lmn ] := W[ψ ijk ] and show that the approximation and geometry properties hold. Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
40 Cubic Hermite Serendipity Geom. Decomp: 3D Proof Details: 2 Define a matrix W with entries hijk lmn W := I (32x32 identity matrix) 3 Define [ϑ lmn ] := W[ψ ijk ]. so that lmn V E specific full rank 32x32 matrix with entries -1, 0, or 1 Confirm directly that [ϑ lmn ] restricts to [ϑ lm ] on faces. Similar proof technique confirms geometry and approximation properties. ϑ 111 (x 1)(y 1)(z 1)( 2 + x + x 2 + y + y 2 + z + z 2 ) ϑ 114 (x 1)(y 1)(z + 1)( 2 + x + x 2 + y + y 2 z + z 2 ) [ϑ lmn ] =. = ϑ 442 (x + 1)(y + 1)(z 1) 2 (z + 1) ϑ 443 (x + 1)(y + 1)(z 1)(z + 1) 2 Complete list and more details in my paper: GILLETTE Hermite and Bernstein Style Basis Functions for Cubic Serendipity Spaces on Squares and Cubes, arxiv: , 2012 Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
41 Cubic Bernstein Serendipity Geom. Decomp: 2D, 3D Cubic Bernstein Basis on [0, 1] ψ 1 (1 x) 3 ψ 2 ψ 3 := (1 x) 2 x (1 x)x 2 ψ 4 x Theorem [G, 2012]: Bernstein-like geometric decompositions of S 3 ([0, 1] 2 ) and S 3 ([0, 1] 3 ) exist. ξ 11 (x 1)(y 1)( 2 2x + x 2 2y + y 2 ) ξ 14 (x 1)(y + 1)( 2 2x + x 2 + 2y + y 2 ) [ξ lm ] = 1. =. 16 ξ 24 (x 1) 2 (x + 1)(y + 1) ξ 34 (x 1)(x + 1) 2 (y + 1) ξ 111 (x 1)(y 1)(z 1)( 5 2x + x 2 2y + y 2 2z + z 2 ) ξ 114 (x 1)(y 1)(z + 1)( 5 2x + x 2 2y + y 2 + 2z + z 2 ) [ξ lmn ] = 1. =. 32 ξ 442 (x + 1)(y + 1)(z 1) 2 (z + 1) ξ 443 (x + 1)(y + 1)(z 1)(z + 1) 2 Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
42 Bernstein Style Serendipity Functions (2D) β 11 β 21 β 31 ξ 11 ξ 21 ξ Bicubic Bernstein functions (top) and Bernstein-style serendipity functions (bottom). Note boundary agreement with Bernstein functions Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
43 Outline 1 Linear Polygonal Elements with GBCs 2 Quadratic Serendipity Elements on Polygons 3 Cubic Hermite Serendipity Elements on Cubes 4 Current and Future Work Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
44 Application: Cardiac Electrophysiology Cubic Hermite serendipity functions recently incorporated into Continuity software package for cardiac electrophysiology models. Used to solve the monodomain equations, a type of reaction-diffusion equations Initial results show agreement of serendipity and standard bicubics on a benchmark problem with a 4x computational speedup in 3D. Fast computation essential to clinical applications and real time simulations GONZALEZ, VINCENT, G., MCCULLOCH High Order Interpolation Methods in Cardiac Electrophysiology Simulation, in preparation, Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
45 Acknowledgments Michael Holst National Biomedical Computation Resource Matt Gonzalez Kevin Vincent Andrew McCulloch Chandrajit Bajaj Alexander Rand UC San Diego UC San Diego UC San Diego UC San Diego UC San Diego UT Austin UT Austin / CD-adapco Thanks for the opportunity to speak! Slides and pre-prints: Andrew Gillette - UCSD Polygonal ( ) & Serendipity FEM SMU - Feb / 45
Geometric Decomposition of Serendipity Finite Element Spaces
Geometric Decomposition of Serendipity Finite Element Spaces Andrew Gillette Department of Mathematics University of California, San Diego http://ccom.ucsd.edu/ agillette/ Joint Mathematics Meetings 2013
More informationSerendipity Finite Element Methods for Cardiac Electrophysiology Models
Serendipity Finite Element Methods for Cardiac Electrophysiology Models Andrew Gillette Department of Mathematics University of California, San Diego http://ccom.ucsd.edu/ agillette/ Andrew Gillette -
More informationNodal bases for the serendipity family of finite elements
Foundations of Computational Mathematics manuscript No. (will be inserted by the editor) Nodal bases for the serendipity family of finite elements Michael S. Floater Andrew Gillette Received: date / Accepted:
More informationFinite Element Clifford Algebra: A New Toolkit for Evolution Problems
Finite Element Clifford Algebra: A New Toolkit for Evolution Problems Andrew Gillette joint work with Michael Holst Department of Mathematics University of California, San Diego http://ccom.ucsd.edu/ agillette/
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationChapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method
Chapter 3 Conforming Finite Element Methods 3.1 Foundations 3.1.1 Ritz-Galerkin Method Let V be a Hilbert space, a(, ) : V V lr a bounded, V-elliptic bilinear form and l : V lr a bounded linear functional.
More informationICES REPORT Direct Serendipity Finite Elements on Convex Quadrilaterals
ICES REPORT 17-8 October 017 Direct Serendipity Finite Elements on Convex Quadrilaterals by Todd Arbogast and Zhen Tao The Institute for Computational Engineering and Sciences The University of Texas at
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationAMS subject classifications. Primary, 65N15, 65N30, 76D07; Secondary, 35B45, 35J50
A SIMPLE FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU AND XIU YE Abstract. The goal of this paper is to introduce a simple finite element method to solve the Stokes equations. This method is in
More informationConstruction of `Wachspress type' rational basis functions over rectangles
Proc. Indian Acad. Sci. (Math. Sci.), Vol. 110, No. 1, February 2000, pp. 69±77. # Printed in India Construction of `Wachspress type' rational basis functions over rectangles P L POWAR and S S RANA Department
More informationInterpolation via Barycentric Coordinates
Interpolation via Barycentric Coordinates Pierre Alliez Inria Some material from D. Anisimov Outline Barycenter Convexity Barycentric coordinates For Simplices For point sets Inverse distance (Shepard)
More informationOn angle conditions in the finite element method. Institute of Mathematics, Academy of Sciences Prague, Czech Republic
On angle conditions in the finite element method Michal Křížek Institute of Mathematics, Academy of Sciences Prague, Czech Republic Joint work with Jan Brandts (University of Amsterdam), Antti Hannukainen
More informationOn an Approximation Result for Piecewise Polynomial Functions. O. Karakashian
BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results
More informationDISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS
DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS Sergey Korotov BCAM Basque Center for Applied Mathematics http://www.bcamath.org 1 The presentation is based on my collaboration with several
More informationPREPRINT 2010:23. A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO
PREPRINT 2010:23 A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG
More informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
More informationFinite Elements. Colin Cotter. January 18, Colin Cotter FEM
Finite Elements January 18, 2019 The finite element Given a triangulation T of a domain Ω, finite element spaces are defined according to 1. the form the functions take (usually polynomial) when restricted
More informationVirtual Element Methods for general second order elliptic problems
Virtual Element Methods for general second order elliptic problems Alessandro Russo Department of Mathematics and Applications University of Milano-Bicocca, Milan, Italy and IMATI-CNR, Pavia, Italy Workshop
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY
ABHELSINKI UNIVERSITY OF TECHNOLOGY TECHNISCHE UNIVERSITÄT HELSINKI UNIVERSITE DE TECHNOLOGIE D HELSINKI A posteriori error analysis for the Morley plate element Jarkko Niiranen Department of Structural
More informationICES REPORT A Generalized Mimetic Finite Difference Method and Two-Point Flux Schemes over Voronoi Diagrams
ICS RPORT 15-17 July 2015 A Generalized Mimetic Finite Difference Method and Two-Point Flux Schemes over Voronoi Diagrams by Omar Al-Hinai, Mary F. Wheeler, Ivan Yotov The Institute for Computational ngineering
More informationLecture Note III: Least-Squares Method
Lecture Note III: Least-Squares Method Zhiqiang Cai October 4, 004 In this chapter, we shall present least-squares methods for second-order scalar partial differential equations, elastic equations of solids,
More informationarxiv: v1 [math.na] 11 Jul 2011
Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov
More information1. Introduction. The Stokes problem seeks unknown functions u and p satisfying
A DISCRETE DIVERGENCE FREE WEAK GALERKIN FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU, JUNPING WANG, AND XIU YE Abstract. A discrete divergence free weak Galerkin finite element method is developed
More informationOverlapping Schwarz Preconditioners for Spectral. Problem in H(curl)
Overlapping Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl) Technical Report TR2002-83 November 22, 2002 Department of Computer Science Courant Institute of Mathematical
More informationA Mixed Nonconforming Finite Element for Linear Elasticity
A Mixed Nonconforming Finite Element for Linear Elasticity Zhiqiang Cai, 1 Xiu Ye 2 1 Department of Mathematics, Purdue University, West Lafayette, Indiana 47907-1395 2 Department of Mathematics and Statistics,
More informationSchwarz Preconditioner for the Stochastic Finite Element Method
Schwarz Preconditioner for the Stochastic Finite Element Method Waad Subber 1 and Sébastien Loisel 2 Preprint submitted to DD22 conference 1 Introduction The intrusive polynomial chaos approach for uncertainty
More informationAn abstract Hodge Dirac operator and its stable discretization
An abstract Hodge Dirac operator and its stable discretization Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at ICCA, Tartu,. Joint work with Ari Stern,
More informationNormal form for the non linear Schrödinger equation
Normal form for the non linear Schrödinger equation joint work with Claudio Procesi and Nguyen Bich Van Universita di Roma La Sapienza S. Etienne de Tinee 4-9 Feb. 2013 Nonlinear Schrödinger equation Consider
More informationFinite Element Exterior Calculus. Douglas N. Arnold, University of Minnesota The 41st Woudschoten Conference 5 7 October 2016
Finite Element Exterior Calculus Douglas N. Arnold, University of Minnesota The 41st Woudschoten Conference 5 7 October 2016 The Hilbert complex framework Discretization of Hilbert complexes Finite element
More informationNodal O(h 4 )-superconvergence of piecewise trilinear FE approximations
Preprint, Institute of Mathematics, AS CR, Prague. 2007-12-12 INSTITTE of MATHEMATICS Academy of Sciences Czech Republic Nodal O(h 4 )-superconvergence of piecewise trilinear FE approximations Antti Hannukainen
More informationarxiv: v1 [math.na] 27 Jan 2016
Virtual Element Method for fourth order problems: L 2 estimates Claudia Chinosi a, L. Donatella Marini b arxiv:1601.07484v1 [math.na] 27 Jan 2016 a Dipartimento di Scienze e Innovazione Tecnologica, Università
More informationPublished in Computer Methods in Applied Mechanics and Engineering 198 (2009)
Published in Computer Methods in Applied Mechanics and Engineering 198 (2009) 1660 1672 GEOMETRIC DECOMPOSITIONS AND LOCAL BASES FOR SPACES OF FINITE ELEMENT DIFFERENTIAL FORMS DOUGLAS N. ARNOLD, RICHARD
More informationarxiv: v1 [math.na] 1 May 2013
arxiv:3050089v [mathna] May 03 Approximation Properties of a Gradient Recovery Operator Using a Biorthogonal System Bishnu P Lamichhane and Adam McNeilly May, 03 Abstract A gradient recovery operator based
More information7. Dimension and Structure.
7. Dimension and Structure 7.1. Basis and Dimension Bases for Subspaces Example 2 The standard unit vectors e 1, e 2,, e n are linearly independent, for if we write (2) in component form, then we obtain
More informationGeneralized Finite Element Methods for Three Dimensional Structural Mechanics Problems. C. A. Duarte. I. Babuška and J. T. Oden
Generalized Finite Element Methods for Three Dimensional Structural Mechanics Problems C. A. Duarte COMCO, Inc., 7800 Shoal Creek Blvd. Suite 290E Austin, Texas, 78757, USA I. Babuška and J. T. Oden TICAM,
More informationA posteriori error estimates for non conforming approximation of eigenvalue problems
A posteriori error estimates for non conforming approximation of eigenvalue problems E. Dari a, R. G. Durán b and C. Padra c, a Centro Atómico Bariloche, Comisión Nacional de Energía Atómica and CONICE,
More informationTransfinite mean value interpolation
DEPT. OF MATH./CMA UNIVERSITY OF OSLO PURE MATHEMATICS NO 6 ISSN 0806 2439 OCTOBER 2007 Transfinite mean value interpolation Christopher Dyken and Michael Floater Abstract Transfinite mean value interpolation
More informationPARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS
PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method
More informationA gradient recovery method based on an oblique projection and boundary modification
ANZIAM J. 58 (CTAC2016) pp.c34 C45, 2017 C34 A gradient recovery method based on an oblique projection and boundary modification M. Ilyas 1 B. P. Lamichhane 2 M. H. Meylan 3 (Received 24 January 2017;
More informationInstitut de Recherche MAthématique de Rennes
LMS Durham Symposium: Computational methods for wave propagation in direct scattering. - July, Durham, UK The hp version of the Weighted Regularization Method for Maxwell Equations Martin COSTABEL & Monique
More informationA Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators
A Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators Jeff Ovall University of Kentucky Mathematics www.math.uky.edu/ jovall jovall@ms.uky.edu Kentucky Applied and
More informationChapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction
Chapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction The a posteriori error estimation of finite element approximations of elliptic boundary value problems has reached
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationMIXED FINITE ELEMENTS FOR PLATES. Ricardo G. Durán Universidad de Buenos Aires
MIXED FINITE ELEMENTS FOR PLATES Ricardo G. Durán Universidad de Buenos Aires - Necessity of 2D models. - Reissner-Mindlin Equations. - Finite Element Approximations. - Locking. - Mixed interpolation or
More informationarxiv: v2 [math.na] 23 Apr 2016
Improved ZZ A Posteriori Error Estimators for Diffusion Problems: Conforming Linear Elements arxiv:508.009v2 [math.na] 23 Apr 206 Zhiqiang Cai Cuiyu He Shun Zhang May 2, 208 Abstract. In [8], we introduced
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 34: Improving the Condition Number of the Interpolation Matrix Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationBuilding a finite element program in MATLAB Linear elements in 1d and 2d
Building a finite element program in MATLAB Linear elements in 1d and 2d D. Peschka TU Berlin Supplemental material for the course Numerische Mathematik 2 für Ingenieure at the Technical University Berlin,
More informationKatholieke Universiteit Leuven Department of Computer Science
Interpolation with quintic Powell-Sabin splines Hendrik Speleers Report TW 583, January 2011 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A B-3001 Heverlee (Belgium)
More informationEfficient hp-finite elements
Efficient hp-finite elements Ammon Washburn July 31, 2015 Abstract Ways to make an hp-finite element method efficient are presented. Standard FEMs and hp-fems with their various strengths and weaknesses
More informationNon-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions
Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Wayne McGee and Padmanabhan Seshaiyer Texas Tech University, Mathematics and Statistics (padhu@math.ttu.edu) Summary. In
More informationINSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions Juan Gabriel Calvo Preprint No. 25-2017 PRAHA 2017 A VIRTUAL
More informationThe partial-fractions method for counting solutions to integral linear systems
The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral
More informationMath 660-Lecture 15: Finite element spaces (I)
Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of
More informationAND BARBARA I. WOHLMUTH
A QUASI-DUAL LAGRANGE MULTIPLIER SPACE FOR SERENDIPITY MORTAR FINITE ELEMENTS IN 3D BISHNU P. LAMICHHANE AND BARBARA I. WOHLMUTH Abstract. Domain decomposition techniques provide a flexible tool for the
More informationError estimates for the Raviart-Thomas interpolation under the maximum angle condition
Error estimates for the Raviart-Thomas interpolation under the maximum angle condition Ricardo G. Durán and Ariel L. Lombardi Abstract. The classical error analysis for the Raviart-Thomas interpolation
More informationb i (x) u + c(x)u = f in Ω,
SIAM J. NUMER. ANAL. Vol. 39, No. 6, pp. 1938 1953 c 2002 Society for Industrial and Applied Mathematics SUBOPTIMAL AND OPTIMAL CONVERGENCE IN MIXED FINITE ELEMENT METHODS ALAN DEMLOW Abstract. An elliptic
More informationA posteriori error estimation for elliptic problems
A posteriori error estimation for elliptic problems Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationFinite Element Multigrid Framework for Mimetic Finite Difference Discretizations
Finite Element Multigrid Framework for Mimetic Finite ifference iscretizations Xiaozhe Hu Tufts University Polytopal Element Methods in Mathematics and Engineering, October 26-28, 2015 Joint work with:
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationOn the convexity of piecewise-defined functions
On the convexity of piecewise-defined functions arxiv:1408.3771v1 [math.ca] 16 Aug 2014 Heinz H. Bauschke, Yves Lucet, and Hung M. Phan August 16, 2014 Abstract Functions that are piecewise defined are
More informationNew Model Stability Criteria for Mixed Finite Elements
New Model Stability Criteria for Mixed Finite Elements Andrew Gillette Department of Mathematics Institute of Computational Engineering and Sciences University of Texas at Austin http://www.math.utexas.edu/users/agillette
More informationThe Virtual Element Method: an introduction with focus on fluid flows
The Virtual Element Method: an introduction with focus on fluid flows L. Beirão da Veiga Dipartimento di Matematica e Applicazioni Università di Milano-Bicocca VEM people (or group representatives): P.
More informationA general construction of barycentric coordinates over convex polygons
A general construction of barycentric coordinates over convex polygons Michael S. Floater Kai Hormann Géza Kós Dedicated to Charles A. Micchelli on his 60th Birthday. Abstract Barycentric coordinates are
More informationOn the convexity of C 1 surfaces associated with some quadrilateral finite elements
Advances in Computational Mathematics 13 (2000) 271 292 271 On the convexity of C 1 surfaces associated with some quadrilateral finite elements J. Lorente-Pardo a, P. Sablonnière b and M.C. Serrano-Pérez
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 37, pp. 166-172, 2010. Copyright 2010,. ISSN 1068-9613. ETNA A GRADIENT RECOVERY OPERATOR BASED ON AN OBLIQUE PROJECTION BISHNU P. LAMICHHANE Abstract.
More information(II.B) Basis and dimension
(II.B) Basis and dimension How would you explain that a plane has two dimensions? Well, you can go in two independent directions, and no more. To make this idea precise, we formulate the DEFINITION 1.
More information12-neighbour packings of unit balls in E 3
12-neighbour packings of unit balls in E 3 Károly Böröczky Department of Geometry Eötvös Loránd University Pázmány Péter sétány 1/c H-1117 Budapest Hungary László Szabó Institute of Informatics and Economics
More informationConvergence rates of derivatives of a family of barycentric rational interpolants
Convergence rates of derivatives of a family of barycentric rational interpolants J.-P. Berrut, M. S. Floater and G. Klein University of Fribourg (Switzerland) CMA / IFI, University of Oslo jean-paul.berrut@unifr.ch
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 14: The Power Function and Native Space Error Estimates Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationUltraconvergence of ZZ Patch Recovery at Mesh Symmetry Points
Ultraconvergence of ZZ Patch Recovery at Mesh Symmetry Points Zhimin Zhang and Runchang Lin Department of Mathematics, Wayne State University Abstract. The ultraconvergence property of the Zienkiewicz-Zhu
More informationTHE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER QUADRILATERAL MESHES. Zhong-Ci Shi and Xuejun Xu.
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS SERIES B Volume 9, Number, January 2008 pp. 63 82 THE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER
More informationPREPRINT 2010:25. Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO
PREPRINT 2010:25 Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS
More informationSolving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels
Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Y.C. Hon and R. Schaback April 9, Abstract This paper solves the Laplace equation u = on domains Ω R 3 by meshless collocation
More informationLecture Notes: African Institute of Mathematics Senegal, January Topic Title: A short introduction to numerical methods for elliptic PDEs
Lecture Notes: African Institute of Mathematics Senegal, January 26 opic itle: A short introduction to numerical methods for elliptic PDEs Authors and Lecturers: Gerard Awanou (University of Illinois-Chicago)
More informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
More informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS CARLO LOVADINA AND ROLF STENBERG Abstract The paper deals with the a-posteriori error analysis of mixed finite element methods
More informationNotes on Cellwise Data Interpolation for Visualization Xavier Tricoche
Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche urdue University While the data (computed or measured) used in visualization is only available in discrete form, it typically corresponds
More informationLinear Algebra for Machine Learning. Sargur N. Srihari
Linear Algebra for Machine Learning Sargur N. srihari@cedar.buffalo.edu 1 Overview Linear Algebra is based on continuous math rather than discrete math Computer scientists have little experience with it
More informationThe maximum angle condition is not necessary for convergence of the finite element method
1 2 3 4 The maximum angle condition is not necessary for convergence of the finite element method Antti Hannukainen 1, Sergey Korotov 2, Michal Křížek 3 October 19, 2010 5 6 7 8 9 10 11 12 13 14 15 16
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 11, pp. 1-24, 2000. Copyright 2000,. ISSN 1068-9613. ETNA NEUMANN NEUMANN METHODS FOR VECTOR FIELD PROBLEMS ANDREA TOSELLI Abstract. In this paper,
More informationSome New Elements for the Reissner Mindlin Plate Model
Boundary Value Problems for Partial Differential Equations and Applications, J.-L. Lions and C. Baiocchi, eds., Masson, 1993, pp. 287 292. Some New Elements for the Reissner Mindlin Plate Model Douglas
More informationA High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere
A High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere Michael Levy University of Colorado at Boulder Department of Applied Mathematics August 10, 2007 Outline 1 Background
More informationTropical Geometry Homework 3
Tropical Geometry Homework 3 Melody Chan University of California, Berkeley mtchan@math.berkeley.edu February 9, 2009 The paper arxiv:07083847 by M. Vigeland answers this question. In Theorem 7., the author
More informationHIGH DEGREE IMMERSED FINITE ELEMENT SPACES BY A LEAST SQUARES METHOD
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 14, Number 4-5, Pages 604 626 c 2017 Institute for Scientific Computing and Information HIGH DEGREE IMMERSED FINITE ELEMENT SPACES BY A LEAST
More informationINSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES On the approximation of a virtual coarse space for domain decomposition methods in two dimensions Juan Gabriel Calvo Preprint No. 31-2017 PRAHA 2017
More informationA WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS
A WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS LIN MU, JUNPING WANG, YANQIU WANG, AND XIU YE Abstract. This article introduces and analyzes a weak Galerkin mixed finite element method
More informationCombinatorics and geometry of E 7
Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationNumerical methods for PDEs FEM convergence, error estimates, piecewise polynomials
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Dr. Noemi Friedman Contents of the course Fundamentals
More informationAn interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes
An interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes Vincent Heuveline Friedhelm Schieweck Abstract We propose a Scott-Zhang type interpolation
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationA Generalization for Stable Mixed Finite Elements
A Generalization for Stable Mixed Finite Elements Andrew Gillette joint work with Chandrajit Bajaj Department of Mathematics Institute of Computational Engineering and Sciences University of Texas at Austin,
More informationForms as sums of powers of lower degree forms
Bruce Reznick University of Illinois at Urbana-Champaign SIAM Conference on Applied Algebraic Geometry Algebraic Geometry of Tensor Decompositions Fort Collins, Colorado August 2, 2013 Let H d (C n ) denote
More informationLocal discontinuous Galerkin methods for elliptic problems
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2002; 18:69 75 [Version: 2000/03/22 v1.0] Local discontinuous Galerkin methods for elliptic problems P. Castillo 1 B. Cockburn
More informationMULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.
MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract
More informationSpaces of Finite Element Differential Forms
Spaces of Finite Element Differential Forms Douglas N. Arnold Abstract We discuss the construction of finite element spaces of differential forms which satisfy the crucial assumptions of the finite element
More information