APPROXIMATING PDE s IN L 1
|
|
- Georgia Bryant
- 5 years ago
- Views:
Transcription
1 APPROXIMATING PDE s IN L 1 Veselin Dobrev Jean-Luc Guermond Bojan Popov Department of Mathematics Texas A&M University NONLINEAR APPROXIMATION TECHNIQUES USING L 1 Texas A&M May 16-18, 2008
2 Outline 1
3 Outline 1 2
4 Outline 1 2 3
5 Outline motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics 1 2 3
6 Motivation motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Advection dominated problem: u + β u ɛ 2 u = f ; u Ω = 0 Approximation on coarse mesh β L h ɛ. Standard discretization Spurious oscillations
7 Fri May 21 16:08: Galerkin/Finite Elements 1 PLOT 1 motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics PLOT 1 Y Axis 0 ZZ Axis 0 1 X Axis Mesh Galerkin Y AxisP 1 X Y x u u = 0, u(0, y) = 0, u(1, y) = 1, y u(x, 0) = 0, y u(x, 1) = 0. 1
8 Viscosity solutions of PDE s motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics In Ω R d consider: αu + f (u) = g; u Ω = u 0. Ill-posed in standard sense, but notion of viscosity solution applies (Bardos, Leroux, and Nédélec (1979), Kružkov...)
9 Viscosity solutions of PDE s motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics The viscosity solution can be interpreted as the limit ɛ 0 of αu + f (u) ɛ 2 u = g; u Ω = u 0.
10 Viscosity solutions of PDE s motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics The viscosity solution can be interpreted as the limit ɛ 0 of αu + f (u) ɛ 2 u = g; u Ω = u 0. One tries to solve the ill-posed pb when ɛ f L h.
11 Viscosity solutions of PDE s motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics The viscosity solution can be interpreted as the limit ɛ 0 of αu + f (u) ɛ 2 u = g; u Ω = u 0. One tries to solve the ill-posed pb when ɛ f L h. A good scheme should be able to approximate the viscosity solution!
12 Why L 1 for viscosity solutions? motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Let u visc be viscosity solution of v visc + v visc = f, in (0, 1), v visc(0) = 0, v visc (1) = 0.
13 Why L 1 for viscosity solutions? motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Let u visc be viscosity solution of v visc + v visc = f, in (0, 1), v visc(0) = 0, v visc (1) = 0. Let f be the zero extension of f on (, + ). Let ũ solve v + v = f u visc (1)δ(1), in (, + ), and v( ) = 0, v(+ ) = 0.
14 Why L 1 for viscosity solutions? motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Let u visc be viscosity solution of v visc + v visc = f, in (0, 1), v visc(0) = 0, v visc (1) = 0. Let f be the zero extension of f on (, + ). Let ũ solve v + v = f u visc (1)δ(1), in (, + ), and v( ) = 0, v(+ ) = 0. Lemma ũ [0,1) = u visc.
15 Why L 1 for viscosity solutions? motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Let u visc be viscosity solution of v visc + v visc = f, in (0, 1), v visc(0) = 0, v visc (1) = 0. Let f be the zero extension of f on (, + ). Let ũ solve v + v = f u visc (1)δ(1), in (, + ), and v( ) = 0, v(+ ) = 0. Lemma ũ [0,1) = u visc. ũ solves well-posed pb with RHS bounded measure ( L 1 (R))
16 Viscosity solutions: Theory motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Consider the 1D pb: u + β(x)u = f in (0, 1), u(0) = 0, u(1) = 0.
17 Viscosity solutions: Theory motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Consider the 1D pb: u + β(x)u = f in (0, 1), u(0) = 0, u(1) = 0. Assume 0 < inf β, sup β < 1 and f L 1. Use piecewise linear polynomials. Use midpoint rule to approximate the integrals.
18 Viscosity solutions: Theory motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics Consider the 1D pb: u + β(x)u = f in (0, 1), u(0) = 0, u(1) = 0. Assume 0 < inf β, sup β < 1 and f L 1. Use piecewise linear polynomials. Use midpoint rule to approximate the integrals. Theorem (Guermond-Popov (2007)) The best L 1 -approximation converges in W 1,1 loc ([0, 1)) to the viscosity solution, and the boundary layer is always located in the last mesh cell.
19 Ill-posed transport in 2D motivation Viscosity solutions Why L 1 for viscosity solutions? The theory Numerics P 1 elements + preconditioned interior point method. { u + x u + 2 y u = 1 u Ω = 0.
20 Theory Discretization Numerical tests Outline 1 2 3
21 Theory Discretization Numerical tests Theory Let Ω be a smooth domain in R 2. Consider H(x, u, u) = 0, u Ω = α. H is convex ( ξ c(1 + H(x, v, ξ) + v )). H is Lipschitz.
22 Theory Discretization Numerical tests Theory Assume that Ω, f and α are smooth enough for a viscosity solution to exist u W 1, (Ω), u BV (Ω) and u p-semi-concave. Definition v is p-semi-concave if there is a concave function v c W 1, and a function w W 2,p so that v = v c + w.
23 Theory Discretization Numerical tests Discretization {T h } h>0 regular mesh family. X α h h = {v h C 0 (Ω); v h K P k, K T h, v h Ω = α h }. Take p > 2 (p > 1 in one space dimension). Define J h (v h ) = H(, v h, v h ) L 1 (Ω) + h 2 p F F i h F ({ n v h } + ) p.
24 Theory Discretization Numerical tests Discretization {T h } h>0 regular mesh family. X α h h = {v h C 0 (Ω); v h K P k, K T h, v h Ω = α h }. Take p > 2 (p > 1 in one space dimension). Define J h (v h ) = H(, v h, v h ) L 1 (Ω) + h 2 p F F i h F ({ n v h } + ) p. Compute u h X α h h s.t., J(u h ) = min J h (v h ). v h X α h h
25 Theory Discretization Numerical tests Discretization: convergence Theorem (Guermond-Popov (2008) 1D, and (200?) 2D) u h converges to the viscosity solution strongly in W 1,1 (Ω) (the result holds for arbitrary polynomial degree provided an additional volume entropy is added)
26 Theory Discretization Numerical tests Discretization: algorithms 1D Optimal complexity algorithm developed in Guermond-Marpeau-Popov (2008). Algorithm ũ h Theorem (Guermond-Popov (200?) 1D) ũ h converges to the viscosity solution strongly in W 1,1 (Ω) and complexity of the algorithm is O(1/h).
27 Theory Discretization Numerical tests Discretization: algorithms 1D Optimal complexity algorithm developed in Guermond-Marpeau-Popov (2008). Algorithm ũ h Theorem (Guermond-Popov (200?) 1D) ũ h converges to the viscosity solution strongly in W 1,1 (Ω) and complexity of the algorithm is O(1/h). The algorithm is similar to the fast marching and fast sweeping methods (instead of choosing maximal solution, choose the entropy-minimizing solution).
28 Theory Discretization Numerical tests 1D convergence tests Ω = [0, 1], u + 1 π (u ) 2 = f (x), u(0) = u(1) = 1.
29 Theory Discretization Numerical tests 1D convergence tests Ω = [0, 1], u + 1 π (u ) 2 = f (x), u(0) = u(1) = 1. Data: f (x) = cos(πx) + sin 2 (πx),
30 Theory Discretization Numerical tests 1D convergence tests Ω = [0, 1], u + 1 π (u ) 2 = f (x), u(0) = u(1) = 1. Data: f (x) = cos(πx) + sin 2 (πx), Exact solution: u(x) = cos(πx).
31 Tue May 16 14:10: D convergence tests Theory Discretization Numerical tests Tue May 16 14:11: PLOT PLOT 0 0 Y Axis Y Axis X Axis X Axis Odd # points (9,19, 39) Even # points (10, 20, 40)
32 1D convergence Mon May 15 17:31: tests Theory Discretization Numerical tests Mon May 15 17:31: Odd # of points W11 error, order 1 Max error, order 1 L1 error, order Even # of points W11 error, order 1 Max error, order 2 L1 error, order Odd # points Even # points
33 Theory Discretization Numerical tests 1D convergence tests (u ) 2 + 3u x 2 x = 0, in ( 0.95, 0.95)
34 Theory Discretization Numerical tests 1D convergence tests (u ) 2 + 3u x 2 x = 0, in ( 0.95, 0.95) Boundary condition set so that the viscosity solution u visc is u visc (x) = 1 2 x x 3 2, i.e. u(±0.95) = u visc (±0.95)
35 Theory Discretization Numerical tests 1D convergence tests (u ) 2 + 3u x 2 x = 0, in ( 0.95, 0.95) Boundary condition set so that the viscosity solution u visc is u visc (x) = 1 2 x x 3 2, i.e. u(±0.95) = u visc (±0.95) u visc is in W 1, (Ω) W 2,p (Ω) for any p [1, 2)
36 Theory Discretization Numerical tests 1D convergence tests (u ) 2 + 3u x 2 x = 0, in ( 0.95, 0.95) Boundary condition set so that the viscosity solution u visc is u visc (x) = 1 2 x x 3 2, i.e. u(±0.95) = u visc (±0.95) u visc is in W 1, (Ω) W 2,p (Ω) for any p [1, 2) u visc is p-semi-concave for any p [1, 2)
37 Tue Jul 10 14:19: Theory Discretization Numerical tests Tue Jul 10 15:25: D convergence tests PLOT Y Axis slope W11 Max L X Axis
38 Theory Discretization Numerical tests Eikonal equation 2D Ω = [0, 1] 2, u = 1, u Ω = 0.
39 Theory Discretization Numerical tests Eikonal equation 2D Ω = [0, 1] 2, u = 1, u Ω = 0. Exact solution: u(x) = dist(x, Ω)
40 Tue May 16 16:00: Theory Discretization Numerical tests Tue May 16 15:48: Eikonal equation 2D: P 1 finite elements PLOT 1 PLOT Y Axis Z Axis X Axis iso-lines X Axis Z Y graph Y Axis 1 X
41 Fri Jan 18 17:12: Theory Discretization Numerical tests Eikonal equation 2D: P 1 finite elements PLOT Fri Jan 18 17:13: PLOT Figure: Pentagon: Aligned unstructured mesh (left); Non-aligned unstructured mesh (right).
42 Fri Jan 25 19:15: Theory Discretization Numerical tests Eikonal equation 2D: P 1 finite elements 1 PLOT Fri Jan 25 19:01: PLOT Y Axis 0 Y Axis X Axis X Axis Figure: L-shaped domain: Unstructured mesh (left); Iso-lines of approximate minimizer (right).
43 Theory Discretization Numerical tests Algorithms in 2D Computation done using Newton+regularization (similar flavor to interior point).
44 Theory Discretization Numerical tests Algorithms in 2D Computation done using Newton+regularization (similar flavor to interior point). Conjecture Fast sweeping/marching techniques produce L 1 almost minimizers.
45 Outline Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results 1 2 3
46 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Problem: Given a set of data in R d, (d = 1, 2), construct a spline approximation 1 From J. Lavery, Computer Aided Geometric Design, 23 (2006) 276:296
47 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Problem: Given a set of data in R d, (d = 1, 2), construct a spline approximation Solution: Minimize the L p -norm of second derivative. 1 From J. Lavery, Computer Aided Geometric Design, 23 (2006) 276:296
48 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Problem: Given a set of data in R d, (d = 1, 2), construct a spline approximation Solution: Minimize the L p -norm of second derivative. Cubic L 1 spline Cubic L 2 spline (Least-Squares) 1 1 From J. Lavery, Computer Aided Geometric Design, 23 (2006) 276:296
49 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Cubic L 1 spline Cubic L 2 spline (Least-Squares) 2 2 From J. Lavery, Computer Aided Geometric Design, 18 (2001) 321:343
50 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Cubic L 1 spline Cubic L 2 spline (Least-Squares) 3 (16 16) 3 From J. Lavery, Computer Aided Geometric Design, 22 (2005) 818:837
51 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Data ( ) Cubic L 1 spline (16 16) Cubic L 2 spline (Least-Squares) 4 4 Courtesy from J. Lavery et al.
52 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Observations: L 1 splines are less oscillatory than L 2 splines.
53 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results L 1 splines (J. Lavery et al. ARO and NCSU) Observations: L 1 splines are less oscillatory than L 2 splines. L 1 splines can compress data better than L 2 splines.
54 C 0 Finite element approach Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Ω R 2 T h mesh composed of triangles/quadrangles. V h set of vertices of T h. F i h set of interior edges. Data given at the vertices of the mesh, (d v ) v Vh
55 C 0 Finite element approach Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Ω R 2 T h mesh composed of triangles/quadrangles. V h set of vertices of T h. F i h set of interior edges. Data given at the vertices of the mesh, (d v ) v Vh Problem Given data at the nodes of T h, construct a smooth non-oscillatory representation of the data, (d v ) v Vh.
56 C 0 Finite element approach Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Define manifold X h = {φ C 0 (Ω); φ K P 3 /Q 3, K T h, φ(v) = d v, v V h }.
57 C 0 Finite element approach Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Define manifold X h = {φ C 0 (Ω); φ K P 3 /Q 3, K T h, φ(v) = d v, v V h }. Let α be a real positive number. Define functional J h (u) = ( u xx + 2 u xy + u yy ) + α K T h K F Fh i F { n u}
58 C 0 Finite element approach Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Define manifold X h = {φ C 0 (Ω); φ K P 3 /Q 3, K T h, φ(v) = d v, v V h }. Let α be a real positive number. Define functional J h (u) = ( u xx + 2 u xy + u yy ) + α K T h K F Fh i F { n u} Problem u = argmin w Xh J h (w)
59 Implementation details Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results α = 0 or small u is P 1 /Q 1 interpolant. α large C 1 smoothness. In practice we take α = 3. Quadrature must be rich enough (9 to 12 points). Interior point method
60 Numerical results: 16x16, 3D view Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results
61 Numerical results: 16x16, 3D view Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results
62 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: 16x16, level sets L2/L1
63 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Lavery s test case; Q1
64 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Lavery s test case; L1
65 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Lavery s test case; L2
66 Steady Hamilton Jacobi equations in L1 (Ω) Motivation: L1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Austin West DEM Dobrev/Guermond/Popov APPROXIMATING PDE s IN L1
67 Steady Hamilton Jacobi equations in L1 (Ω) Motivation: L1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Barton creek; Q1 Dobrev/Guermond/Popov APPROXIMATING PDE s IN L1
68 Steady Hamilton Jacobi equations in L1 (Ω) Motivation: L1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Barton creek; L1 Dobrev/Guermond/Popov APPROXIMATING PDE s IN L1
69 Steady Hamilton Jacobi equations in L1 (Ω) Motivation: L1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Barton creek; L2 Dobrev/Guermond/Popov APPROXIMATING PDE s IN L1
70 Numerical results: The peppers Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results
71 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: The peppers; zoomed
72 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: The peppers; zoomed/photoshop CS3
73 Motivation: L 1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: The peppers; zoomed/l1
74 Steady Hamilton Jacobi equations in L1 (Ω) Motivation: L1 splines C 0 Finite element approach Implementation details Numerical results Numerical results: Barton creek THE END Dobrev/Guermond/Popov APPROXIMATING PDE s IN L1
An efficient filtered scheme for some first order Hamilton-Jacobi-Bellman equat
An efficient filtered scheme for some first order Hamilton-Jacobi-Bellman equations joint work with Olivier Bokanowski 2 and Maurizio Falcone SAPIENZA - Università di Roma 2 Laboratoire Jacques-Louis Lions,
More informationNonoscillatory Central Schemes on Unstructured Triangular Grids for Hyperbolic Systems of Conservation Laws
Nonoscillatory Central Schemes on Unstructured Triangular Grids for Hyperbolic Systems of Conservation Laws Ivan Christov 1,* Bojan Popov 1 Peter Popov 2 1 Department of Mathematics, 2 Institute for Scientific
More informationNumerical schemes for Hamilton-Jacobi equations, control problems and games
Numerical schemes for Hamilton-Jacobi equations, control problems and games M. Falcone H. Zidani SADCO Spring School Applied and Numerical Optimal Control April 23-27, 2012, Paris Lecture 2/3 M. Falcone
More informationAsymptotic Error Analysis
Asymptotic Error Analysis Brian Wetton Mathematics Department, UBC www.math.ubc.ca/ wetton PIMS YRC, June 3, 2014 Outline Overview Some History Romberg Integration Cubic Splines - Periodic Case More History:
More informationAPPM/MATH Problem Set 4 Solutions
APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal
More informationNonoscillatory Central Schemes on Unstructured Triangulations for Hyperbolic Systems of Conservation Laws
Nonoscillatory Central Schemes on Unstructured Triangulations for Hyperbolic Systems of Conservation Laws Ivan Christov Bojan Popov Department of Mathematics, Texas A&M University, College Station, Texas
More informationCS205b/CME306. Lecture 9
CS205b/CME306 Lecture 9 1 Convection Supplementary Reading: Osher and Fedkiw, Sections 3.3 and 3.5; Leveque, Sections 6.7, 8.3, 10.2, 10.4. For a reference on Newton polynomial interpolation via divided
More informationHigh Frequency Wave Scattering
High Frequency Wave Scattering University of Reading March 21st, 2006 - Scattering theory What is the effect of obstacles or inhomogeneities on an incident wave? - Scattering theory What is the effect
More informationContents. I The Basic Framework for Stationary Problems 1
page v Preface xiii I The Basic Framework for Stationary Problems 1 1 Some model PDEs 3 1.1 Laplace s equation; elliptic BVPs... 3 1.1.1 Physical experiments modeled by Laplace s equation... 5 1.2 Other
More informationf xx + f yy = F (x, y)
Application of the 2D finite element method to Laplace (Poisson) equation; f xx + f yy = F (x, y) M. R. Hadizadeh Computer Club, Department of Physics and Astronomy, Ohio University 4 Nov. 2013 Domain
More informationTwo Algorithms for Approximation in Highly Complicated Planar Domains
Two Algorithms for Approximation in Highly Complicated Planar Domains Nira Dyn and Roman Kazinnik School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel, {niradyn,romank}@post.tau.ac.il
More informationOn the high order FV schemes for compressible flows
Applied and Computational Mechanics 1 (2007) 453-460 On the high order FV schemes for compressible flows J. Fürst a, a Faculty of Mechanical Engineering, CTU in Prague, Karlovo nám. 13, 121 35 Praha, Czech
More informationHigh Order Weighted Essentially Non-Oscillatory Schemes for Convection. Dominated Problems. Chi-Wang Shu 1
High Order Weighted Essentially Non-Oscillatory Schemes for Convection Dominated Problems Chi-Wang Shu Division of Applied Mathematics, Brown University, Providence, Rhode Island 09 ABSTRACT High order
More informationPolynomials tend to oscillate (wiggle) a lot, even when our true function does not.
AMSC/CMSC 460 Computational Methods, Fall 2007 UNIT 2: Spline Approximations Dianne P O Leary c 2001, 2002, 2007 Piecewise polynomial interpolation Piecewise polynomial interpolation Read: Chapter 3 Skip:
More informationThird Order WENO Scheme on Three Dimensional Tetrahedral Meshes
COMMUNICATIONS IN COMPUTATIONAL PHYSICS Vol. 5, No. 2-4, pp. 86-848 Commun. Comput. Phys. February 29 Third Order WENO Scheme on Three Dimensional Tetrahedral Meshes Yong-Tao Zhang 1, and Chi-Wang Shu
More informationDual Interpolants for Finite Element Methods
Dual Interpolants for Finite Element Methods Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and Sciences University
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn School of Mathematical Sciences Tel Aviv University Michael S. Floater Department of Informatics University of
More informationAn introduction to mesh generation Part IV : elliptic meshing
Elliptic An introduction to mesh generation Part IV : elliptic meshing Department of Civil Engineering, Université catholique de Louvain, Belgium Elliptic Curvilinear Meshes Basic concept A curvilinear
More informationSOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS
SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS JIAN LIANG AND HONGKAI ZHAO Abstract. In this paper we present a general framework for solving partial differential equations on manifolds represented
More informationNodal Basis Functions for Serendipity Finite Elements
Nodal Basis Functions for Serendipity Finite Elements Andrew Gillette Department of Mathematics University of Arizona joint work with Michael Floater (University of Oslo) Andrew Gillette - U. Arizona Nodal
More informationOn the Construction, Comparison, and Local Characteristic Decomposition for High-Order Central WENO Schemes
Journal of Computational Physics 8, 87 09 (00) doi:0.006/jcph.00.79 On the Construction, Comparison, and Local Characteristic Decomposition for High-Order Central WENO Schemes Jianxian Qiu, and Chi-Wang
More informationAn Introduction to Viscosity Solutions: theory, numerics and applications
An Introduction to Viscosity Solutions: theory, numerics and applications M. Falcone Dipartimento di Matematica OPTPDE-BCAM Summer School Challenges in Applied Control and Optimal Design July 4-8, 2011,
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationConservative high order semi-lagrangian finite difference WENO methods for advection in incompressible flow. Abstract
Conservative high order semi-lagrangian finite difference WENO methods for advection in incompressible flow Jing-Mei Qiu 1 and Chi-Wang Shu Abstract In this paper, we propose a semi-lagrangian finite difference
More informationCS 450 Numerical Analysis. Chapter 7: Interpolation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationWESTFÄLISCHE WILHELMS-UNIVERSITÄT MÜNSTER
MÜNSTER Adaptive Discretization of Liftings for Curvature Regularization SIAM Conference on Imaging Science 2016, Albuquerque, NM Ulrich Hartleif, Prof. Dr. Benedikt Wirth May 23, 2016 Outline MÜNSTER
More informationElement Quality Metrics for Higher-Order Bernstein Bézier Elements
Element Quality Metrics for Higher-Order Bernstein Bézier Elements Luke Engvall and John A. Evans Abstract In this note, we review the interpolation theory for curvilinear finite elements originally derived
More informationConvexity Theory and Gradient Methods
Convexity Theory and Gradient Methods Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Convex Functions Optimality
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationarxiv: v1 [math.na] 20 Sep 2016
arxiv:1609.06236v1 [math.na] 20 Sep 2016 A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization P. Gangl 1,2 and U. Langer 3 1 Doctoral Program Comp.
More informationConvex Shape Preservation of Cubic L 1 Spline Fits
Ann. Data. Sci. (07) 4():3 47 DOI 0.007/s40745-06-0099-3 Convex Shape Preservation of Cubic L Spline Fits Tiantian Nie Ziteng Wang Shu-Cherng Fang John E. Lavery 3 Received: 5 August 06 / Revised: 5 October
More information9. Three Dimensional Object Representations
9. Three Dimensional Object Representations Methods: Polygon and Quadric surfaces: For simple Euclidean objects Spline surfaces and construction: For curved surfaces Procedural methods: Eg. Fractals, Particle
More information1.2 Numerical Solutions of Flow Problems
1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian
More informationMath 225 Scientific Computing II Outline of Lectures
Math 225 Scientific Computing II Outline of Lectures Spring Semester 2003 I. Interpolating polynomials Lagrange formulation of interpolating polynomial Uniqueness of interpolating polynomial of degree
More informationCompact Sets. James K. Peterson. September 15, Department of Biological Sciences and Department of Mathematical Sciences Clemson University
Compact Sets James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 15, 2017 Outline 1 Closed Sets 2 Compactness 3 Homework Closed Sets
More informationComputer Graphics 7 - Rasterisation
Computer Graphics 7 - Rasterisation Tom Thorne Slides courtesy of Taku Komura www.inf.ed.ac.uk/teaching/courses/cg Overview Line rasterisation Polygon rasterisation Mean value coordinates Decomposing polygons
More informationROC-HJ: Reachability analysis and Optimal Control problems - Hamilton-Jacobi equations
ROC-HJ: Reachability analysis and Optimal Control problems - Hamilton-Jacobi equations Olivier Bokanowski, Anna Désilles, Hasnaa Zidani February 2013 1 Introduction The software ROC-HJ is a C++ library
More informationMar. 20 Math 2335 sec 001 Spring 2014
Mar. 20 Math 2335 sec 001 Spring 2014 Chebyshev Polynomials Definition: For an integer n 0 define the function ( ) T n (x) = cos n cos 1 (x), 1 x 1. It can be shown that T n is a polynomial of degree n.
More informationA new 8-node quadrilateral spline finite element
Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,
More informationPolygonal, Polyhedral, and Serendipity Finite Element Methods
Polygonal, Polyhedral, and Serendipity Finite Element Methods Andrew Gillette Department of Mathematics University of Arizona ASU Computational and Applied Math Seminar Slides and more info at: http://math.arizona.edu/
More informationThe Finite Element Method
The Finite Element Method A Practical Course G. R. Liu and S. S. Quek Chapter 1: Computational modeling An overview 1 CONTENTS INTRODUCTION PHYSICAL PROBLEMS IN ENGINEERING COMPUTATIONAL MODELLING USING
More informationReview Initial Value Problems Euler s Method Summary
THE EULER METHOD P.V. Johnson School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 INITIAL VALUE PROBLEMS The Problem Posing a Problem 3 EULER S METHOD Method Errors 4 SUMMARY OUTLINE 1 REVIEW 2 INITIAL
More informationOutline. Level Set Methods. For Inverse Obstacle Problems 4. Introduction. Introduction. Martin Burger
For Inverse Obstacle Problems Martin Burger Outline Introduction Optimal Geometries Inverse Obstacle Problems & Shape Optimization Sensitivity Analysis based on Gradient Flows Numerical Methods University
More informationAdaptive numerical methods
METRO MEtallurgical TRaining On-line Adaptive numerical methods Arkadiusz Nagórka CzUT Education and Culture Introduction Common steps of finite element computations consists of preprocessing - definition
More informationHigh Order Fixed-Point Sweeping WENO Methods for Steady State of Hyperbolic Conservation Laws and Its Convergence Study
Commun. Comput. Phys. doi:.48/cicp.375.6a Vol., No. 4, pp. 835-869 October 6 High Order Fixed-Point Sweeping WENO Methods for Steady State of Hyperbolic Conservation Laws and Its Convergence Study Liang
More informationDocumentation for Numerical Derivative on Discontinuous Galerkin Space
Documentation for Numerical Derivative on Discontinuous Galerkin Space Stefan Schnake 204 Introduction This documentation gives a guide to the syntax and usage of the functions in this package as simply
More informationSIZE PRESERVING MESH GENERATION IN ADAPTIVITY PROCESSES
Congreso de Métodos Numéricos en Ingeniería 25-28 junio 2013, Bilbao, España c SEMNI, 2013 SIZE PRESERVING MESH GENERATION IN ADAPTIVITY PROCESSES Eloi Ruiz-Gironés 1, Xevi Roca 2 and Josep Sarrate 1 1:
More informationOn the order of accuracy and numerical performance of two classes of finite volume WENO schemes
On the order of accuracy and numerical performance of two classes of finite volume WENO schemes Rui Zhang, Mengping Zhang and Chi-Wang Shu November 29, 29 Abstract In this paper we consider two commonly
More informationSurface Parameterization
Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping
More informationA Dijkstra-type algorithm for dynamic games
A Dijkstra-type algorithm for dynamic games Martino Bardi 1 Juan Pablo Maldonado Lopez 2 1 Dipartimento di Matematica, Università di Padova, Italy 2 formerly at Combinatoire et Optimisation, UPMC, France
More informationLevel Set Methods and Fast Marching Methods
Level Set Methods and Fast Marching Methods I.Lyulina Scientific Computing Group May, 2002 Overview Existing Techniques for Tracking Interfaces Basic Ideas of Level Set Method and Fast Marching Method
More informationShape Modeling. Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell. CS 523: Computer Graphics, Spring 2011
CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell 2/15/2011 1 Motivation Geometry processing: understand geometric characteristics,
More informationIntroduction to Multigrid and its Parallelization
Introduction to Multigrid and its Parallelization! Thomas D. Economon Lecture 14a May 28, 2014 Announcements 2 HW 1 & 2 have been returned. Any questions? Final projects are due June 11, 5 pm. If you are
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationLecture 1: Finite Volume WENO Schemes Chi-Wang Shu
Lecture 1: Finite Volume WENO Schemes Chi-Wang Shu Division of Applied Mathematics Brown University Outline of the First Lecture General description of finite volume schemes for conservation laws The WENO
More informationValue function and optimal trajectories for a control problem with supremum cost function and state constraints
Value function and optimal trajectories for a control problem with supremum cost function and state constraints Hasnaa Zidani ENSTA ParisTech, University of Paris-Saclay joint work with: A. Assellaou,
More informationUnstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications
Unstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications Per-Olof Persson (persson@mit.edu) Department of Mathematics Massachusetts Institute of Technology http://www.mit.edu/
More informationA Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods
A Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods Scott A. Sarra, Derek Sturgill Marshall University, Department of Mathematics, One John Marshall Drive, Huntington
More informationNumerical methods for volume preserving image registration
Numerical methods for volume preserving image registration SIAM meeting on imaging science 2004 Eldad Haber with J. Modersitzki haber@mathcs.emory.edu Emory University Volume preserving IR p.1/?? Outline
More informationOptimal 3D Lattices in Scientific Visualization and Computer Graphics
Optimal 3D Lattices in Scientific Visualization and Computer Graphics School of Computing Science Simon Fraser University Jan, 2007 Outline Visualization and Graphics 1 Visualization and Graphics 2 3 Further
More informationConvexization in Markov Chain Monte Carlo
in Markov Chain Monte Carlo 1 IBM T. J. Watson Yorktown Heights, NY 2 Department of Aerospace Engineering Technion, Israel August 23, 2011 Problem Statement MCMC processes in general are governed by non
More informationIntroduction to PDEs: Notation, Terminology and Key Concepts
Chapter 1 Introduction to PDEs: Notation, Terminology and Key Concepts 1.1 Review 1.1.1 Goal The purpose of this section is to briefly review notation as well as basic concepts from calculus. We will also
More informationl ealgorithms for Image Registration
FAIR: exib Image Registration l F l ealgorithms for Jan Modersitzki Computing And Software, McMaster University 1280 Main Street West, Hamilton On, L8S 4K1, Canada modersit@cas.mcmaster.ca August 13, 2008
More informationThe Level Set Method. Lecture Notes, MIT J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations
The Level Set Method Lecture Notes, MIT 16.920J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations Per-Olof Persson persson@mit.edu March 7, 2005 1 Evolving Curves and Surfaces Evolving
More informationLecture 2 Unstructured Mesh Generation
Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a
More informationReconstruction of Filament Structure
Reconstruction of Filament Structure Ruqi HUANG INRIA-Geometrica Joint work with Frédéric CHAZAL and Jian SUN 27/10/2014 Outline 1 Problem Statement Characterization of Dataset Formulation 2 Our Approaches
More informationCollocation and optimization initialization
Boundary Elements and Other Mesh Reduction Methods XXXVII 55 Collocation and optimization initialization E. J. Kansa 1 & L. Ling 2 1 Convergent Solutions, USA 2 Hong Kong Baptist University, Hong Kong
More informationParallel Adaptive Tsunami Modelling with Triangular Discontinuous Galerkin Schemes
Parallel Adaptive Tsunami Modelling with Triangular Discontinuous Galerkin Schemes Stefan Vater 1 Kaveh Rahnema 2 Jörn Behrens 1 Michael Bader 2 1 Universität Hamburg 2014 PDES Workshop 2 TU München Partial
More informationweighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.
weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces. joint work with (S. Osher, R. Fedkiw and M. Kang) Desired properties for surface reconstruction:
More informationLecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More informationconsisting of compact sets. A spline subdivision scheme generates from such
Spline Subdivision Schemes for Compact Sets with Metric Averages Nira Dyn and Elza Farkhi Abstract. To dene spline subdivision schemes for general compact sets, we use the representation of spline subdivision
More informationRedistancing by Flow of Time Dependent Eikonal Equation
Redistancing by Flow of Time Dependent Eikonal Equation Li-Tien Cheng and Yen-Hsi Tsai June 11, 2007 Abstract Construction of signed distance to a given inteface is a topic of special interest to level
More informationWhat is Multigrid? They have been extended to solve a wide variety of other problems, linear and nonlinear.
AMSC 600/CMSC 760 Fall 2007 Solution of Sparse Linear Systems Multigrid, Part 1 Dianne P. O Leary c 2006, 2007 What is Multigrid? Originally, multigrid algorithms were proposed as an iterative method to
More informationThe Development of a Volume-of-Fluid Interface Tracking Method for Modeling Problems in Mantle Convection
The Development of a Volume-of-Fluid Interface Tracking Method for Modeling Problems in Mantle Convection Jonathan Robey 1 September 12, 2016 1 Funded in part by a GAANN Fellowship 1 Motivation Mantle
More informationSolutions of 3D Navier-Stokes benchmark problems with adaptive finite elements 1
Solutions of 3D Navier-Stokes benchmark problems with adaptive finite elements 1 M. Braack a T. Richter b a Institute of Applied Mathematics, University of Heidelberg, INF 294, 69120 Heidelberg, Germany
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationLecture 19 Subgradient Methods. November 5, 2008
Subgradient Methods November 5, 2008 Outline Lecture 19 Subgradients and Level Sets Subgradient Method Convergence and Convergence Rate Convex Optimization 1 Subgradients and Level Sets A vector s is a
More informationAUTOMATED ADAPTIVE ERROR CONTROL IN FINITE ELEMENT METHODS USING THE ERROR REPRESENTATION AS ERROR INDICATOR
AUTOMATED ADAPTIVE ERROR CONTROL IN FINITE ELEMENT METHODS USING THE ERROR REPRESENTATION AS ERROR INDICATOR JOHAN JANSSON, JOHAN HOFFMAN, CEM DEGIRMENCI, JEANNETTE SPÜHLER Abstract. In this paper we present
More informationSubdivision-stabilised immersed b-spline finite elements for moving boundary flows
Subdivision-stabilised immersed b-spline finite elements for moving boundary flows T. Rüberg, F. Cirak Department of Engineering, University of Cambridge, Trumpington Street, Cambridge CB2 1PZ, U.K. Abstract
More informationFinal Report. Discontinuous Galerkin Compressible Euler Equation Solver. May 14, Andrey Andreyev. Adviser: Dr. James Baeder
Final Report Discontinuous Galerkin Compressible Euler Equation Solver May 14, 2013 Andrey Andreyev Adviser: Dr. James Baeder Abstract: In this work a Discontinuous Galerkin Method is developed for compressible
More informationAn Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems
An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems Long Chen University of California, Irvine chenlong@math.uci.edu Joint work with: Huayi Wei (Xiangtan University),
More informationCONSERVATIVE AND NON-CONSERVATIVE METHODS BASED ON HERMITE WEIGHTED ESSENTIALLY-NON-OSCILLATORY RECONSTRUCTION FOR VLASOV EQUATIONS
CONSERVATIVE AND NON-CONSERVATIVE METHODS BASED ON HERMITE WEIGHTED ESSENTIALLY-NON-OSCILLATORY RECONSTRUCTION FOR VLASOV EQUATIONS CHANG YANG AND FRANCIS FILBET Abstract. We develop weighted essentially
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 informationConforming Vector Interpolation Functions for Polyhedral Meshes
Conforming Vector Interpolation Functions for Polyhedral Meshes Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and
More informationThe Eikonal Equation
The Eikonal Equation Numerical efficiency versus computational compleity Shu-Ren Hysing III Institute of Applied Mathematics LSIII University of Dortmund Level set - methodology By embedding an interface
More informationObjects 2: Curves & Splines Christian Miller CS Fall 2011
Objects 2: Curves & Splines Christian Miller CS 354 - Fall 2011 Parametric curves Curves that are defined by an equation and a parameter t Usually t [0, 1], and curve is finite Can be discretized at arbitrary
More informationBarycentric Finite Element Methods
University of California, Davis Barycentric Finite Element Methods N. Sukumar UC Davis Workshop on Generalized Barycentric Coordinates, Columbia University July 26, 2012 Collaborators and Acknowledgements
More informationDiscontinuous Fluctuation Distribution
Discontinuous Fluctuation Distribution Matthew Hubbard School of Computing, University of Leeds, Leeds, LS2 9JT, UK. Abstract This paper describes a new numerical scheme for the approximation of steady
More informationADAPTIVE FINITE ELEMENT METHODS FOR ELLIPTIC PDEs BASED ON CONFORMING CENTROIDAL VORONOI DELAUNAY TRIANGULATIONS
SIAM J. SCI. COMPUT. Vol. 8, No. 6, pp. 3 53 c 6 Society for Industrial and Applied Mathematics ADAPTIVE FINITE ELEMENT METHODS FOR ELLIPTIC PDEs BASED ON CONFORMING CENTROIDAL VORONOI DELAUNAY TRIANGULATIONS
More informationInterpolation. TANA09 Lecture 7. Error analysis for linear interpolation. Linear Interpolation. Suppose we have a table x x 1 x 2...
TANA9 Lecture 7 Interpolation Suppose we have a table x x x... x n+ Interpolation Introduction. Polynomials. Error estimates. Runge s phenomena. Application - Equation solving. Spline functions and interpolation.
More informationON CONCAVITY OF THE PRINCIPAL S PROFIT MAXIMIZATION FACING AGENTS WHO RESPOND NONLINEARLY TO PRICES
ON CONCAVITY OF THE PRINCIPAL S PROFIT MAXIMIZATION FACING AGENTS WHO RESPOND NONLINEARLY TO PRICES Shuangjian Zhang This is joint work with my supervisor Robert J. McCann University of Toronto April 11,
More informationNormals of subdivision surfaces and their control polyhedra
Computer Aided Geometric Design 24 (27 112 116 www.elsevier.com/locate/cagd Normals of subdivision surfaces and their control polyhedra I. Ginkel a,j.peters b,,g.umlauf a a University of Kaiserslautern,
More informationA limiting strategy for the back and forth error compensation and correction method for solving advection equations
A limiting strategy for the back and forth error compensation and correction method for solving advection equations Lili Hu, Yao Li, Yingjie Liu April 22, 2014 Abstract We further study the properties
More informationA higher-order finite volume method with collocated grid arrangement for incompressible flows
Computational Methods and Experimental Measurements XVII 109 A higher-order finite volume method with collocated grid arrangement for incompressible flows L. Ramirez 1, X. Nogueira 1, S. Khelladi 2, J.
More informationRobust Poisson Surface Reconstruction
Robust Poisson Surface Reconstruction V. Estellers, M. Scott, K. Tew, and S. Soatto Univeristy of California, Los Angeles Brigham Young University June 2, 2015 1/19 Goals: Surface reconstruction from noisy
More informationRecent Developments in Model-based Derivative-free Optimization
Recent Developments in Model-based Derivative-free Optimization Seppo Pulkkinen April 23, 2010 Introduction Problem definition The problem we are considering is a nonlinear optimization problem with constraints:
More information