discrete exterior calculus and its connection to feec
play

Discrete Exterior Calculus and its Connection to FEEC Anil N. - PowerPoint PPT Presentation

Discrete Exterior Calculus and its Connection to FEEC Anil N. Hirani University of Illinois at Urbana-Champaign NSF/CBMS Conference: Finite Element Exterior Calculus, June 13, 2012 Institute for Computational and Experimental Research in


  1. Discrete Exterior Calculus and its Connection to FEEC Anil N. Hirani University of Illinois at Urbana-Champaign NSF/CBMS Conference: Finite Element Exterior Calculus, June 13, 2012 Institute for Computational and Experimental Research in Mathematics, Providence, RI

  2. • Computer graphics motivation • Combinatorial and Geometric / Analytical • Primal and dual meshes (Delaunay OK) • Wedge product and A ∞ algebras • Contraction and Lie derivative • Vector fields via diffeomorphism group • PyDEC: software and algorithms

  3. 1. Run-on-one-mesh / Looks-good philosophy [Grinspun, H, Desbrun, Schröder 2003]

  4. Who cares ...

  5. 2. Structural philospophy • Similar to variational integrators philosophy • Does it mimic the mathematical structure ? • Does it lead to : o New mathematical structures ? o New algorithms ?

  6. Primal-Dual Meshes and Discrete Exterior Calculus

  7. Duality via subdivision [Munkres 1984]

  8. Circumcentric duals

  9. σ 0 , 0-simplex σ 1 , 1-simplex σ 2 , 2-simplex σ 3 , 3-simplex D( σ 0 ) 3-cell D( σ 1 ) , 2-cell D( σ 2 ) , 1-cell D( σ 3 ) , 0-cell

  10. d 95 51 66 11 9 1 5 32 6 57 78 10 21 98 3 3 83 45 33 45 8 34 − 34

  11. * 1 1 Area ( T ) h α , T i = Length ( e ) h⇤ α , e i T 1 1 | σ p | h α , σ p i = | ? σ p | h⇤ α , ? σ p i . e

  12. Primal-Dual Complexes d 0 d 1 d 2 C 0 → C 1 → C 2 → C 3 − − − − − − − − − − − − ? ? ? ? ? ? ? ? y ∗ 0 y ∗ 1 y ∗ 2 y ∗ 3 d T d T d T 0 D 3 − D 2 1 − D 1 2 − D 0 ← − − − ← − − − ← − − − d 0 d 1 C 0 → C 1 → C 2 − − − − − − − − ? ? ? ? ? ? y ∗ 0 y ∗ 1 y ∗ 2 d T d T 0 D 2 − D 1 1 − D 0 ← − − − ← − − −

  13. • Either use codifferential (inverse star easy) • Place variables in primal or dual complex • Or use FEEC weak form with DEC star

  14. 〈 σ h , τ 〉−〈 d τ , u h 〉 = 0 〈 d σ h , v 〉 + 〈 d u h ,d v 〉 + 〈 v , p h 〉 = 〈 f , v 〉 〈 u h , q 〉 = 0 ∑ ∗ − d T ∗ ∏∑ σ h ∏ ∑ ∏ 0 = d T ∗ d u h ∗ ( f h − p h ) ∗ d Q T ∗ u h = 0

  15. FEEC DEC

  16. FEEC DEC

  17. FEEC DEC

  18. FEEC DEC

  19. Triangulations • Well-centered • Pairwise Delaunay + boundary restriction

  20. 2-Well-Centered Tetrahedron (Max θ ≈ 87 . 6 ° )

  21. 34562 triangles

  22. Typical results Theorem Let L be a triangulation of S 2 with m vertices. If L has a vertex v 1 of degree d ( v 1 ) ≥ m − 3 , then L is not Lk u for any interior vertex u in a 2 -well-centered tetrahedral mesh in R 3 . Corollary There are at least 9 edges incident to each interior vertex of a 2 -well-centered tetrahedral mesh in R 3 .

  23. Dihedral acute 0 . 0384 0 . 9322 18 . 35 80 . 82 35 . 89 84 . 65 30 40 50 60 70 80 90 10 20 30 40 50 60 70 80 90 0 0.2 0.4 0.6 0.8 1 h / R Values Dihedral Angles Face Angles First known dihedral acute triangulation on a cube (has 1370 tetrahedra)

  24. Another one • Kopczynski, Pak, Przytycki, 2010, 2012 • 2715 tetrahedra • Uses the boundary of 4D 600-cell • No acute triangulation of n-cube, n >= 4 • No acute triangulations of n-space, n >= 5

  25. Alternatives to WCT • Producing WCT in 3 dimensions is hard • WCT is sufficient, but is it necessary ? • Recent: Pairwise Delaunay+ is enough

  26. Sign rule

  27. R L τ c τ c ρ c λ circumcenter order

  28. Theorem : For a pairwise Delaunay mesh of dimension 2 or 3, duals of internal simplices have positive volume. One sidedness condition for boundary simplices.

  29. Unsigned Bad Boundary Not Delaunay

  30. See also • H, Nakshatrala, Chaudhry 2008 (Darcy flow) • Gillette, Bajaj 2010, 2011 (Dual formulations)

  31. Wedge Product

  32. Definition α ∈ § k β ∈ § l α ∧ β ∈ § k + l ( α ∧ β )( e 1 ,..., e k + l ) 1 X ° ¢ ° ¢ (sgn σ ) α e σ (1) ,..., e σ ( k ) β e σ ( k + 1) ,..., e σ ( k + l ) k ! l ! σ ∈ S k + l

  33. Example α ∈ § 2 β ∈ § 1 1 £ § ( α ∧ β )( e 1 , e 2 , e 3 ) = α ( e 1 , e 2 ) β ( e 3 ) − ··· 2!1! 123 132 213 231 312 321 + − − + + −

  34. Some properties ⇤ α ⇤ β = ( ⇧ 1) kl β ⇤ α ( α ⇤ β ) ⇤ γ = α ⇤ ( β ⇤ γ ) d( α ^ β ) = (d α ) ^ β + ( ° 1) k α ^ (d β )

  35. DEC Wedge (1) α ∧ β , σ k + l Æ ≠ Æ ≠ sgn( τ ) | σ k + l ∩ ? v τ ( k ) | 1 ( α ^ β )( τ ( σ k + l )) X | σ k + l | ( k + l )! τ ∈ S k + l + 1

  36. DEC Wedge (1) α ∧ β , σ k + l Æ ≠ Æ ≠ sgn( τ ) | σ k + l ∩ ? v τ ( k ) | X 1 ( α ^ β )( τ ( σ k + l )) X | σ k + l | ( k + l )! τ ∈ S k + l + 1 ( α ^ β )( τ ( σ k + l )) £ § £ § 〈 α , v τ (0) ,..., v τ ( k ) 〉〈 β , v τ ( k ) ,..., v τ ( k + l ) 〉

  37. Example £ § £ ≠ Æ α ∧ β ,[0,1,2] 1 £ ≠ Æ≠ Æ ≠ Æ≠ Æ ° C 0 α ,[1,0] β ,[0,2] + C 0 α ,[2,0] β ,[0,1] 2 ≠ Æ≠ Æ ≠ Æ≠ Æ + C 1 α ,[0,1] β ,[1,2] ° C 1 α ,[2,1] β ,[1,0] ≠ Æ≠ Æ ≠ Æ≠ Ƨ ° C 2 α ,[0,2] β ,[2,1] + C 2 α ,[1,2] β ,[2,0]

  38. β α β α

  39. Properties • Anti-commutative • Leibniz rule satisfied • Not natural under pullback • Not associative in general

  40. DEC wedge (2) 1 sgn( τ )( α ^ β )( τ ( σ k + l )) X � ( k + l + 1)! τ 2 S k + l + 1 | σ k + l ∩ � v τ ( k ) | 1 instead of | σ k + l | k + l + 1 [Castrillon Lopez 2003]

  41. See also • Scott Wilson 2008 • Uses Whitney forms • Also lacks associativity

  42. Remark 7.1.4. Lack of associativity: According to Givental [2003] this lack of associativity in general, and a special status for closed forms, is not an accident. Putting the “democratic weighting” aside, the wedge definition works for any simplicial complex (such as singular cochains, for instance). It is known that it is in principal impossible to make a universal definition anti-commutative and associative. This phenomenon has been studied a lot in algebraic topology or homological algebra and gives rise to the concepts of Massey products and homotopy-associative algebras. [H. 2003]

  43. A-infinity algebras • Introduced by Stasheff 1963 in topology • Kontsevich 1994 (ICM) used in physics • Dolotin, Morozov, Shakirov 2008 • Keller’s survey articles

  44. d 2 = 0 d ∧ + ∧ d = 0 ∧ 2 = 0 = + + − ∧ ∧ ∧ 2 ( α , β , γ ) = ∧ ( ∧ ( α , β ), γ ) −∧ ( α , ∧ ( β , γ )) = ( α ∧ β ) ∧ γ − α ∧ ( β ∧ γ )

  45. (d + ∧ ) 2 = 0 (d + ∧ + m (3) + m (4) + ...) 2 = 0

  46. d 2 = 0 d ∧ + ∧ d = 0 d m (3) + m (3) d + ∧ 2 = 0 d m (4) + m (4) d + ∧ m (3) + m (3) ∧ = 0 m (3) ¢ 2 = 0 d m (5) + m (5) d + ∧ m (4) + m (4) ∧ + °

  47. Contraction and Lie derivative

  48. Definitions and CMF i X α : = α (X,...) L X α : = d ⇧ t = 0 ϕ ⌥ t α ⇧ ⇧ dt L X α = i X d α + di X α Cartan Magic Formula

  49. Proxies versus forms α a 1-form in R 3 ( L X α ) ⇥ � = L X α ⇥ β a 2-form in R 3 ⇥⌅ ⇥ � = L X ⇥ ⇥ ⇤ � � L X β ⌥ β ⌥

  50. X = x ∂ α = xdx , ∂ x ∂ x xdx = d x 2 = 2 xdx L X α = di x ∂ ∑ x ∂ ∂ x , x ∂ ∏ L X α ] = = 0 ∂ x

  51. Euler equation u t + u · ⌅ u = ⇧⌅ p div u = 0 on ∂ ⇤ , u · n = 0 u ( x ,0) = u 0 ( x ) t + L u u � ⇧ 1 u � 2 d ⇤ u ⇤ 2 = ⇧ d p δ u � = 0 on ∂ ⇤ , i u µ = 0 u ( x ,0) = u 0 ( x )

  52. L u u � ⇧ 1 2 d ⇤ u ⇤ 2 = di u u � + i u d u � ⇧ 1 2 di u u � = 1 2 di u u � + i u d u � = 1 ⌃ ⌥ du � ⇥ u � ⌥ 2 di u u � + ⌥ curl u ⌥ u

  53. DEC contraction / Lie (1) ⌃ � α ⇤ X � ⌥ i X α = ( ⌃ 1) k ( n ⌃ k ) � Then define Lie derivative via Cartan formula [H. 2003]

  54. Extrusion and related • Bossavit 2003 • H. 2003 • Jinchao Xu • Heumann and Hiptmair 2008, 2011 • Mullen et al. 2011

  55. DEC contraction / Lie (2) i X α = d ⇥ ⇥ ⇧ α ⇧ ⇧ ⇧ dt t = 0 c H t c L X β = d ⇥ ⇥ ⇧ β ⇧ ⇧ dt t = 0 c S t c

  56. Fluids and diffeomorphisms • Euler equation as evolution on group of volume preserving diffeomorphisms • Lie algebra is div-free vector fields • V. Arnold 1966, Ebin and Marsden 1970 • Now important in brain image matching

  57. Structure preservation f , h � ⇥ 0 , ϕ � Diff vol ( ⇤ ) if f is constant f ϕ = f ⌅ f ϕ , h ϕ ⇧ = ⌅ f , h ⇧

  58. Discrete D ( ⇤ ) = { q � GL(N) + ⇧ q T V q = V } � q i j = 1 ⇥ i , ⇧ ⇧ j ⇧ A T V + V A = 0} � d ( ⇤ ) = { A � gl ( N ) A i j = 0 ⇥ i , ⇧ ⇧ j [Gawlik et al.]

  59. Discrete D ( ⇤ ) = { q � GL(N) + ⇧ q T V q = V } � q i j = 1 ⇥ i , ⇧ ⇧ j ⇧ A T V + V A = 0} � d ( ⇤ ) = { A � gl ( N ) A i j = 0 ⇥ i , ⇧ ⇧ j q ( t ) T V q ( t ) = V d ⇧ t = 0 q ( t ) T V q ( t ) = 0 ⇧ ⇧ dt q (0) T V + V ˙ ˙ q (0) = 0 [Gawlik et al.]

  60. Software

  61. PyDEC

  62. Features • Complexes : simplicial, cubical, Rips, abstract • DEC and lowest order FEEC

  63. Examples

Recommend


More recommend