Third part: finite difference schemes and numerical dispersion
|
|
- Piers Goodman
- 6 years ago
- Views:
Transcription
1 Tird part: finite difference scemes and numerical dispersion BCAM - Basque Center for Applied Matematics Bilbao, Basque Country, Spain BCAM and UPV/EHU courses : Advanced aspects in applied matematics Topics on numerics for wave propagation (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
2 Linear transport equation Te simplest model for te wave propagation is te linear transport equation: u t + u x = 0, x R, t > 0, u(x, 0) = f (x). (1) u = u(x, t) is a solution of (1) iff u is constant along te caracteristic lines x + t = constant. Te solution of (1) is u(x, t) = f (x t). Semigroup teory for te transport equation (1). Te Hilbert space H := L 2 (R), te operator A := x and its domain D(A) := H 1 (R). A is dissipative. < Au, u > L 2 (R) = R x uu dx = 1 2 R x (u2 ) dx = 0. A is maximal. For any f L 2 (R), tere exists an unique solution u H 1 (R) of te equation u + x u = f, wic can be explicitly computed as x 0 u(x) = f (s) exp(s x) ds = f (z + x) exp(z) dz. By te Minkowski inequality u L 2 (R): u x = f u L 2 (R) u H 1 (R). Transport equation wit reversed sign, Te solution of (2) is u(x, t) = g(x + t). 0 u L 2 (R) f L 2 (R) exp(z) dz = f L 2 (R). u t u x = 0, x R, t > 0, u(x, 0) = g(x). (2) (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
3 Tree semi-discrete finite difference approximations of u t + u x = 0 forward u j (t) + u j+1 (t) u j (t) = 0, centered u j (t) + u j+1 (t) u j 1 (t) 2 = 0, backward u j (t) + u j (t) u j 1 (t) = 0. (3) Briefly, forward/centered/backward: u (t) = A u (t) / 1/ 0 A = / 1/... A =... 1/2 0 1/ /2 0 1/ / 1/ 0 0 A = / 1/ 0... (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
4 Peter Lax convergence results Peter Lax s equivalence teorem: CONVERGENCE CONSISTENCY+STABILITY. CONSISTENCY=insert a smoot solution of te continuous model in te discrete one + Taylor expansions. STABILITY = von Neumann analysis. Semi-discrete Fourier transform at scale : û (ξ, t) = j Z u j (t) exp( ix j ξ), ξ [ π/, π/]. All te tree scemes can be transformed into te first-order differential equation wose solution is û t (ξ, t) = p (ξ)û (ξ, t), û (ξ, 0) = û,0 (ξ) Here, p (ξ) = û (ξ, t) = û,0 (ξ) exp( p (ξ)t). 1 exp(iξ), forward sceme i sin(ξ), centered sceme exp( iξ) 1, backward sceme. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
5 Properties of te semi-discrete Fourier transform (SDFT) Definition Consider a sequence f := (f j ) j Z l 2 related to a grid of size (i.e. f j = f (x j )), its semi-discrete Fourier transform at scale is f (ξ) := f j exp( iξx j ), wit ξ [ π/, π/]. j Z Inverse Fourier transform: f j = 1 π/ f 2π (ξ) exp(iξx j ) dξ. π/ Remark Continuous Fourier transform: function f (x), x R, transformed into function f (ξ), ξ R. Semi-discrete Fourier transform: sequence f := (f j ) j Z transformed into function f (ξ), ξ [ π/, π/]. Parseval identity: f 2 l 2 := f j 2 = 1 2π f 2 L j Z 2 ( π/,π/) := 1 2π π/ f (ξ) 2 dξ. π/ Sannon sinc function: ψ 0 (x) = sin(πx/) πx/, wic is globally analytic and ψ 0 (0) = 1. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
6 Properties of te semi-discrete Fourier transform (SDFT) Te sinc function is a particular case of function f in te Paley-Wiener teorem: Teorem (Paley-Wiener, see Rudin, Real and complex analysis ) If A, C > 0 and f L 2 (C) is an entire function s.t. f (z) C exp(a z ) (exponential growt at most A), for all z C, ten te Fourier transform f of f as compact support in [ A, A]. Exercise: ψ 0 L 2 (R) and ψ 0(ξ) = χ ( π/,π/) (ξ), wit χ S te caracteristic function of set S. Definition Set ψ j (x) = ψ 0(x x j ) and te sequence f := (f j ) j Z l 2. Te continuous function f (x) := f j ψ j (x) is j Z called te sinc interpolation of f. Important properties of te sinc interpolation (exercise): f (ξ) = f (ξ) and f L 2 (R) = f l 2. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
7 Oter possible interpolations piecewise constant, using functions ψj 0(x) := χ [x j 1/2,x j+1/2 ]: f 0 (x) = f j ψj 0(x). j Z piecewise linear and continuous, using functions ψj 1(x) := (ψ0 j ψj 0)(x): f 1 (x) = f j ψj 1(x). j Z spline interpolation, using functions ψj m (x) = (ψj 0 ψj 0 )(x) (m successive convolutions): f m (x) = f j ψj m (x). j Z f 0 L 2 (R) = f l 2 and 1 3 f l 2 f 1 L 2 (R) f l 2. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
8 Observation ψ0 0 and ψ1 0 ave compact support, but teir Fourier transforms ψ 0 0 (ξ) = sinc(ξ/2) and ψ 0 1(ξ) = ( ψ 0 0(ξ))2 are spread. ψ 0 is spread, but its Fourier transform ψ 0 (ξ) = χ ( π/,π/) (ξ) as compact support. Cf. Heisenberg Uncertainty Principle, is not possible bot f and its Fourier transform f to ave compact support: Teorem (Heisenberg Uncertainty Principle, Stein & Sakarci, Fourier analysis - an introduction) Let f S(R), f L 2 (R) = 1. Ten ( )( x 2 f (x) 2 dx R R ) ξ 2 f (ξ) 2 dξ 1 16π 2, wit equality iff f (x) = A exp( B x 2 ), B > 0 and A 2 = 2B/π. In fact, for all x 0, ξ 0 R, ( )( ) x x 0 2 f (x) 2 dx ξ ξ 0 2 f (ξ) 2 dξ 1 16π 2. R R Interpretation in quantum mecanics. Te more certain we are about te location of a particle, te less certain we can be about its momentum and vice versa. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
9 Back to stabilization of numerical scemes... Set p = max ξ [ π/,π/] Re( p (ξ)). Using Parseval identity for te SDFT, u (t) 2 l 2 = 1 π/ û,0 (ξ) 2 exp(2tre( p (ξ))) dξ 2π π/. exp(2t p ) 1 π/ û,0 (ξ) 2 dξ = exp(2t p 2π ) u,0 2 l 2. π/ Numerical scemes (3) are stable iff p 0. Oterwise p 1/ and exp(2t p ) as 0. FORWARD: Re( p (ξ)) = 2 sin 2 (ξ/2)/ 0, ξ [ π/, π/], and p = 2/ UNSTABLE!!!. CENTERED: Re( p (ξ)) = 0, ξ [ π/, π/], and p = 0 STABLE. BACKWARD: Re( p (ξ)) = 2 sin 2 (ξ/2)/ 0, ξ [ π/, π/], and p = 0 STABLE. NECESSARY GEOMETRIC CONDITION FOR THE CONVERGENCE OF A NUMERICAL SCHEME: Te domain of dependence of te numerical sceme MUST CONTAIN te domain of dependence of te continuous model. Domains of dependence at a point (x j, t): Continuous transport: te segment joining (x j, t) wit (x j t, 0). Forward sceme: te semi-strip TO THE RIGHT of x = x j delimited by te times 0 and t. Centered sceme: te band delimited by te times 0 and t. Backward sceme: te semi-strip to te left of x = x j delimited by te times 0 and t. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
10 Error estimates Linear transport equation Consistency errors: Consider u a smoot solution of te transport equation u t(x, t) + u x (x, t) = 0, u(x, 0) = f (x), x R. Ten, by plugging u in te numerical sceme and using Taylor expansions, we obtain: backward sceme: u t(x j, t) + u(x j, t) u(x j 1, t) = u t(x j, t) + u x (x j, t) }{{} =0, u solves u t +u x =0 2 uxx (x j 1/2, t) := O j (t), x j 1/2 (x j 1, x centered sceme: u t(x j, t) + u(x j+1, t) u(x j 1, t) 2 = u t(x j, t) + u x (x j, t) }{{} =0, u solves u t +u x = (uxxx (x j 1/2, t) + uxxx (x j+1/2, t)), x j±1/2 (x j 1/2±1/2, x j+1/2±1/2 ). Set te error ɛ j (t) := u j (t) u(x j, t), were u j (t) is te solution of te backward sceme wit data u j (0) = f (x j ). Ten ɛ j (t) solves te problem ɛ j (t) + ɛ j (t) ɛ j 1 (t) = O j (t), ɛ j (0) = 0. (4) (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
11 Error estimates Linear transport equation ENERGY METHOD. Multiply (4) by ɛ j (t) and add in j Z: 1 d [ ɛ j (t) 2] + 2 dt j Z j Z(ɛ 2 j (t) ɛ j (t)ɛ j 1 (t)) = O j (t)ɛ j (t). (5) j Z }{{} = 1 (ɛ 2 j (t) ɛ j 1 (t)) 2 0 j Z ɛ (t) 2 l 2 := ɛ j (t) 2. By Caucy-Scwarz inequality in (5) 1 d 2 dt ɛ (t) 2 l j Z 2 O (t) l 2 ɛ (t) l 2, so tat d dt ɛ (t) l 2 O (t) l 2 and, since ɛ (0) l 2 = 0, Assume f C 2 c (R). Ten O j (t) = f (x j 1/2 t) /2 and Teorem O (s) 2 l 2 = j Z f (x j 1/2 s) 2 = 3 4 Supp(f ) t ɛ (t) l 2 0 O (s) l 2 ds. j Z s.t. x j 1/2 s Suppf f (x j 1/2 s) 2 f 2 L (R) = 2 4 Supp(f ) f 2 L (R). For any initial data f C 2 c (R) in te transport equation, te backward semi-discrete sceme wit initial data u j (0) = f (x j ) is convergent of order in l 2 and te error ɛ j (t) = u j (t) u(x j, t) satisfies te estimate ɛ (t) l 2 t 2 f L (R) Supp(f ), t 0, > 0. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
12 More about te energy metod Te L 2 (R)-norm of te solution for te continuous transport equation ut + ux = 0 is conserved in time. Conservation law of te energy: d dt u(, t) 2 L 2 (R) = 0. Te centered semi-discrete sceme is also conservative: d dt u (t) 2 l 2 = 0. Te backward semi-discrete sceme is dissipative since te energy decreases in time: d dt u (t) 2 l 2 +, u (t) 2 l 2 = 0, were, f j := f j f j 1. Te forward semi-discrete sceme is anti-dissipative since te energy increases in time: d dt u (t) 2 l 2,+ u (t) 2 l 2 = 0, were,+ f j := f j+1 f j. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
13 Fully discrete scemes for te transport equation Consistency exercise Leap-frog sceme: u k+1 j u k 1 j + uk j+1 uk j 1 = 0. 2dt 2dx Stability von Neumann metod. Set û,k (ξ) - te semi-discrete Fourier transform at scale of te solution at time t k, (u k j ) j and µ := dt/dx - te Courant number. Te sequence (û,k (ξ)) k verifies te second-order recurrence: û,k+1 (ξ) + 2iµ sin(ξ)û,k (ξ) û,k 1 (ξ) = 0. Te two roots of te caracteristic polynomial are: λ ± (ξ) = iµ sin(ξ) ± 1 µ 2 sin 2 (ξ). Wen µ < 1, 1 µ 2 sin 2 (ξ) > 0 for all ξ, so tat λ ± (ξ) C of te same imaginary part and of opposite real parts. Also λ ± (ξ) 2 = µ 2 sin 2 (ξ) + 1 µ 2 sin 2 (ξ) = 1. Te stability is guaranteed by te fact tat bot roots λ ± (ξ) are simple and of modulus 1, for any ξ. Wen µ = 1, 1 µ 2 sin 2 (ξ) > 0, excepting te case ξ = π/2 and ξ = 3π/2, for wic tere is a double root of unit modulus INSTABILITY. Wen µ > 1, tere exists ξ µ (0, 2π/) s.t. 1 µ 2 sin 2 (ξ) > 0 for all ξ (0, ξ µ) and 1 µ 2 sin 2 (ξ) 0 for all ξ [ξ µ, 2π). In tis last case, te metod is UNSTABLE: λ ± (ξ) = i(µ sin(ξ) µ 2 sin 2 (ξ) 1) and λ (ξ) = µ sin(ξ) + µ 2 sin 2 (ξ) 1 > 1. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
14 Fully discrete scemes for te transport equation backward Euler EXPLICIT: u k+1 j u k j dt + uk j u k j 1 dx Stability von Neumann metod. Te sequence (û,k (ξ)) k verifies te first-order recurrence: û,k+1 (ξ) = [1 + µ(exp(iξ) 1)]û,k (ξ). For te stability is sufficient to guarantee tat 1 + µ(exp(iξ) 1) 1: 1 + µ(exp(iξ) 1) 2 = (1 + µ(cos(ξ) 1)) 2 + µ 2 sin 2 (ξ) = 1 + 2µ(µ 1)(1 cos(ξ)) 1 iff µ 1. = 0. backward Euler IMPLICIT: u k+1 j u k j dt + uk+1 j u k+1 j 1 = 0. dx Stability von Neumann metod. Te sequence (û,k (ξ)) k verifies te first-order recurrence: û,k+1 (ξ) = µ(1 exp(iξ)) û,k (ξ). For te stability is sufficient to guarantee tat 1 + µ(1 exp(iξ)) 1: 1 + µ(1 exp(iξ)) 2 = (1 + µ(1 cos(ξ))) 2 + µ 2 sin 2 (ξ) = 1 + 2µ(µ + 1)(1 cos(ξ)) 1, µ > 0 UNCONDITIONAL STABILITY NO CONDITION on µ to guarantee stability. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
15 Fully discrete scemes for te transport equation Teorem If û,k+1 (ξ, t) û,k (ξ) for all ξ [ π/, π/] u,k+1 l 2 u,k l 2. Proof: Parseval identity for te SDFT. Oter fully discrete scemes for te transport equation: Crank-Nicolson, inspired from te trapezoidal rule for solving ODEs, is unconditionally stable and of second-order in bot time and space: u k+1 j uj k dt [ u k+1 j+1 uk+1 j 1 2dx + uk j+1 uk ] j 1 = 0. 2dx Lax-Wendroff, of second-order, conservative, stable iff µ 1 (exercise) u k+1 j uj k dt + uk j+1 uk j 1 2dx Lax-Friedrics, of first-order, stable iff µ 1 (exercise) u k+1 j 1 2 (uk j+1 + uk j 1 ) dt dt uj+1 k 2uk j + uj 1 k 2 dx 2 = 0 + uk j+1 uk j 1 2dx = 0. Definition (A-stability, cf. Iserles, A first course on numerical analysis of ODEs) A numerical metod is A-stable if it preserves te beaviour of te continuous solution as t. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
16 Numerical approximations for te wave equation Te finite difference space semi-discretization: u j u j+1 2u j +u j 1 2 = 0. Te explicit leapfrog fully discrete finite difference sceme is stable for µ = dt/dx 1: u k+1 2u k j j +uk 1 j dt 2 uk j+1 2uk j +uk j 1 dx 2 = 0. Te implicit leapfrog fully discrete finite difference sceme is unconditionally stable: u k+1 2u k j j +uk 1 j dt 2 u k+1 j+1 2uk+1 +u k+1 j j 1 dx 2 = 0. Te implicit midpoint sceme is unconditionally stable: u k+1 2u k j j +uk 1 j dt u k+1 j+1 2uk+1 +u k+1 j j 1 dx u k 1 j+1 2uk 1 +u k 1 j j 1 dx 2 = 0. Te finite element semi-discretization. Find u (x, t) = N u j (t)φ j (x) V := span{φ 1,, φ N } s.t. j=1 d 2 1 dt 2 u 1 (x, t)φ(x) dx + ux (x, t)φ x (x) dx = 0, φ V. 0 0 x x j 1, x (x j 1, x j ) Here φ j (x) = x j+1 x, x (x j, x j+1 ),, Ten (u j (t)) j satisfies te system: 0, oterwise. 6 u j+1 (t) u j (t) + 6 u j 1 (t) u j+1(t) 2u j (t)+u j 1 (t) = 0. Finite difference semi-discretization of te 2 d wave equation: u j,k (t) u j+1,k (t) 2u j,k (t)+u j 1,k (t) x 2 u j,k+1(t) 2u j,k (t)+u j,k 1 (t) y 2 = 0. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
17 Numerical dissipation and dispersion Trefeten [6]: Finite difference approximations ave more complicated pysics tan te equations tey are designed to simulate. Tey are used not because te numbers tey generate ave simpler properties, but because tose numbers are simpler to compute. Plane wave solutions: u(x, t) = exp(i(ξx + tω)), were ξ is te wave number and ω is te frequency. Te PDE or te numerical sceme imposes a relationsip between ω and ξ, ω = ω(ξ), called dispersion relation. Examples: Transport equation u t + u x = 0 ω(ξ) = ξ Wave equation u tt u xx = 0 ω(ξ) = ±ξ Scrödinger equation iu t + u xx = 0 ω(ξ) = ξ 2. Centered finite difference semi-discretization for te transport equation u j + (u j+1 u j 1 )/2 = 0 ω (ξ) = sin(ξ)/ Finite difference semi-discretization of te wave equation u j (u j+1 2u j + u j 1 )/ 2 = 0 ω (ξ) = ±2 sin(ξ/2)/. Finite difference semi-discretization of te Scrödinger equation iu j + (u j+1 2u j + u j 1 )/ 2 = 0 ω (ξ) = 4 sin 2 (ξ/2)/ 2. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
18 Dispersion relations for fully discrete scemes for te transport equation Leap-frog: sin(dtω (ξ)) + µ sin(dxξ) = 0, µ = dt/dx, = dx. Backward explicit Euler: exp(idtω (ξ)) 1 + µ(1 exp( iξdx)) = 0 Backward implicit Euler: 1 exp( idtω (ξ)) + µ(1 exp( iξdx)) = 0 Crank-Nicolson: 2 tan(dtω (ξ)/2) + µ sin(dxξ) = 0 Lax-Wendroff: exp(idtω (ξ)) 1 + iµ sin(dxξ) + 2µ 2 sin 2 (dxξ/2) = 0 Lax-Friedric: exp(idtω (ξ)) cos(dxξ) + iµ sin(dxξ) = 0. Definition A finite difference sceme is dissipative of order 2r if te dispersion relation satisfies Im(ω (ξ)dt) γ ξdx 2r, for all ξ [ π/dx, π/dx], γ > 0. A finite difference sceme is non-dissipative if Im(ω (ξ)) = 0. Example non-dissipative scemes: leap-frog, Crank-Nicolson Example dissipative scemes: Lax-Wendroff, backward explicit Euler, Lax-Friedric (in figure)... Effect of dissipation: Te amplitude of te numerical solution decays in time. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
19 Group velocity, pase velocity Wave packet: u(x, t) = R φ(ξ) exp(itω(ξ) + iξx) dξ. Data concentrated around x = 0 and oscillating at frequency ξ 0 : φ(x) = ψ(x) exp(iξ 0 x). Example - finite difference semi-discretization: ω = ω (ξ) = 2 sin(ξ/2)/ ω (ξ 0 ) + (ξ ξ 0 )ω (ξ0 ) u(x, t) exp(iξ 0 (x + tω (ξ 0 )/ξ 0 ))ψ(x + tω (ξ0 )). Pase velocity: ω (ξ 0 )/ξ 0 - te velocity of propagation for te oscillation Group velocity: ω (ξ0 ) - te velocity of propagation for te envelope ψ. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
20 Geometric Optics Linear transport equation Ligt as a dual nature: is particle (poton) and is wave (and oscillates at a certain wavelengt). Geometric Optics (GO) studies te propagation of ligt particles along trajectories called rays. Hamilton principle states tat te trajectory of a particle between times t 1 and t 2 minimizes te t 2 action L(q, q, t) dt, were L = T V is te difference between kinetic and potential energies, t 1 q is te vector of generalized coordinates and q = tq. Hamiltonian system associated to H = H(p, q): p (s) = qh(p(s), q(s)), q (s) = ph(p(s), q(s)). For te continuous wave equation, H = H(x, t, ξ, τ) = τ 2 ξ 2 and te rays of GO verify te Hamiltonian system: x (s) = ξ H(x(s), t(s), ξ(s), τ(s)) = 2ξ(s), t (s) = τ H(x(s), t(s), ξ(s), τ(s)) = 2τ(s) ξ (s) = x H(x(s), t(s), ξ(s), τ(s)) = 0 ξ(s) = ξ 0, τ (s) = th(x(s), t(s), ξ(s), τ(s)) = 0 τ(s) = τ 0. Null-bi-caracteristics. H(x(0), t(0), ξ(0), τ(0)) = 0. Ten H(x(s), t(s), ξ(s), τ(s)) = 0 s > 0. Caracteristics. Replace s by t in te Hamiltonian system. Since H(x(0), 0, ξ(0), τ(0)) = 0 as two roots as equation in τ 0, τ 0 = ± ξ 0, ten x (t) = ±ξ 0 / ξ 0 two caracteristics: x(t) = x 0 ± tξ 0 / ξ 0. Tey propagate at unit velocity. For te finite difference semi-discretization of te wave equation, te Hamiltonian is H(x, t, ξ, τ) = τ 2 4 sin 2 (ξ)/ 2 and te caracteristics propagate wit te group velocity, i.e. x(t) = x 0 ± t cos(ξ 0 /2) (exercise). (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
21 Some related bibliograpy T.-C. Poon, Engineering Optics Wit Matlab, World Scientific, A. Quarteroni, A. Valli, Numerical approximation of PDEs, Springer, J.C. Strikwerda, Finite difference scemes and PDEs, SIAM, L.N. Trefeten, Group velocity ub finite difference scemes, SIAM Rev L.N. Trefeten, Spectral metods in Matlab, SIAM, L.N. Trefeten, Finite difference and spectral metods for ordinary and PDEs, R. Vicnevetsky, B. Bowles, Fourier analysis of numerical approximations of yperbolic equations, SIAM, E. Zuazua, Métodos numéricos de resolución de Ecuaciones en Derivadas Parciales, capters 3 and 9. (BCAM - Basque Center for Applied Matematics) Finite difference approximations Bilbao /06/ / 21
1 Upwind scheme for advection equation with variable. 2 Modified equations: numerical dissipation and dispersion
1 Upwind sceme for advection equation wit variable coefficient Consider te equation u t + a(x)u x Applying te upwind sceme, we ave u n 1 = a (un u n 1), a 0 u n 1 = a (un +1 u n ) a < 0. CFL condition
More informationFinite Difference Methods Assignments
Finite Difference Metods Assignments Anders Söberg and Aay Saxena, Micael Tuné, and Maria Westermarck Revised: Jarmo Rantakokko June 6, 1999 Teknisk databeandling Assignment 1: A one-dimensional eat equation
More informationNumerical Analysis of Differential Equations Numerical Solution of Parabolic Equations
Numerical Analysis of Differential Equations 215 6 Numerical Solution of Parabolic Equations 6 Numerical Solution of Parabolic Equations TU Bergakademie Freiberg, SS 2012 Numerical Analysis of Differential
More informationWave propagation in discrete heterogeneous media
www.bcamath.org Wave propagation in discrete heterogeneous media Aurora MARICA marica@bcamath.org BCAM - Basque Center for Applied Mathematics Derio, Basque Country, Spain Summer school & workshop: PDEs,
More informationNotes on wavefunctions II: momentum wavefunctions
Notes on wavefunctions II: momentum wavefunctions and uncertainty Te state of a particle at any time is described by a wavefunction ψ(x). Tese wavefunction must cange wit time, since we know tat particles
More informationAMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error.
Lecture 09 Copyrigt by Hongyun Wang, UCSC Recap: Te total error in numerical differentiation fl( f ( x + fl( f ( x E T ( = f ( x Numerical result from a computer Exact value = e + f x+ Discretization error
More informationStability properties of a family of chock capturing methods for hyperbolic conservation laws
Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) Stability properties of a family of cock capturing metods for yperbolic conservation
More informationFinite Difference Method
Capter 8 Finite Difference Metod 81 2nd order linear pde in two variables General 2nd order linear pde in two variables is given in te following form: L[u] = Au xx +2Bu xy +Cu yy +Du x +Eu y +Fu = G According
More informationFinite difference methods for the diffusion equation
Finite difference methods for the diffusion equation D150, Tillämpade numeriska metoder II Olof Runborg May 0, 003 These notes summarize a part of the material in Chapter 13 of Iserles. They are based
More informationConsider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.
Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions
More informationParabolic PDEs: time approximation Implicit Euler
Part IX, Capter 53 Parabolic PDEs: time approximation We are concerned in tis capter wit bot te time and te space approximation of te model problem (52.4). We adopt te metod of line introduced in 52.2.
More informationFinite difference method for heat equation
Finite difference method for heat equation Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen
More information3 Parabolic Differential Equations
3 Parabolic Differential Equations 3.1 Classical solutions We consider existence and uniqueness results for initial-boundary value problems for te linear eat equation in Q := Ω (, T ), were Ω is a bounded
More informationNumerical Methods for PDEs
Numerical Methods for PDEs Problems 1. Numerical Differentiation. Find the best approximation to the second drivative d 2 f(x)/dx 2 at x = x you can of a function f(x) using (a) the Taylor series approach
More informationOrder of Accuracy. ũ h u Ch p, (1)
Order of Accuracy 1 Terminology We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, wic can be for instance te grid size or time step in a numerical
More informationERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER*
EO BOUNDS FO THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BADLEY J. LUCIE* Abstract. Te expected error in L ) attimet for Glimm s sceme wen applied to a scalar conservation law is bounded by + 2 ) ) /2 T
More informationNumerical Differentiation
Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function
More informationTutorial 2. Introduction to numerical schemes
236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes c 2012 Classifying PDEs Looking at the PDE Au xx + 2Bu xy + Cu yy + Du x + Eu y + Fu +.. = 0, and its discriminant, B 2
More informationClick here to see an animation of the derivative
Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,
More informationarxiv: v1 [math.na] 12 Mar 2018
ON PRESSURE ESTIMATES FOR THE NAVIER-STOKES EQUATIONS J A FIORDILINO arxiv:180304366v1 [matna 12 Mar 2018 Abstract Tis paper presents a simple, general tecnique to prove finite element metod (FEM) pressure
More informationRecent Advances in Time-Domain Maxwell s Equations in Metamaterials
Recent Advances in Time-Domain Maxwell s Equations in Metamaterials Yunqing Huang 1, and Jicun Li, 1 Hunan Key Laboratory for Computation and Simulation in Science and Engineering, Xiangtan University,
More informationPDEs, part 3: Hyperbolic PDEs
PDEs, part 3: Hyperbolic PDEs Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2011 Hyperbolic equations (Sections 6.4 and 6.5 of Strang). Consider the model problem (the
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Implicit Schemes for the Model Problem The Crank-Nicolson scheme and θ-scheme
More informationFDM for parabolic equations
FDM for parabolic equations Consider the heat equation where Well-posed problem Existence & Uniqueness Mass & Energy decreasing FDM for parabolic equations CNFD Crank-Nicolson + 2 nd order finite difference
More informationSome Applications of Fractional Step Runge-Kutta Methods
Some Applications of Fractional Step Runge-Kutta Metods JORGE, J.C., PORTERO, L. Dpto. de Matematica e Informatica Universidad Publica de Navarra Campus Arrosadia, s/n 3006 Pamplona Navarra SPAIN Abstract:
More informationParameter Fitted Scheme for Singularly Perturbed Delay Differential Equations
International Journal of Applied Science and Engineering 2013. 11, 4: 361-373 Parameter Fitted Sceme for Singularly Perturbed Delay Differential Equations Awoke Andargiea* and Y. N. Reddyb a b Department
More informationSuperconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract
Superconvergence of energy-conserving discontinuous Galerkin metods for linear yperbolic equations Yong Liu, Ci-Wang Su and Mengping Zang 3 Abstract In tis paper, we study superconvergence properties of
More informationThe Verlet Algorithm for Molecular Dynamics Simulations
Cemistry 380.37 Fall 2015 Dr. Jean M. Standard November 9, 2015 Te Verlet Algoritm for Molecular Dynamics Simulations Equations of motion For a many-body system consisting of N particles, Newton's classical
More informationA Finite Element Primer
A Finite Element Primer David J. Silvester Scool of Matematics, University of Mancester d.silvester@mancester.ac.uk. Version.3 updated 4 October Contents A Model Diffusion Problem.................... x.
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University A Model Problem and Its Difference Approximations 1-D Initial Boundary Value
More informationNUMERICAL DIFFERENTIATION
NUMERICAL IFFERENTIATION FIRST ERIVATIVES Te simplest difference formulas are based on using a straigt line to interpolate te given data; tey use two data pints to estimate te derivative. We assume tat
More informationBlanca Bujanda, Juan Carlos Jorge NEW EFFICIENT TIME INTEGRATORS FOR NON-LINEAR PARABOLIC PROBLEMS
Opuscula Matematica Vol. 26 No. 3 26 Blanca Bujanda, Juan Carlos Jorge NEW EFFICIENT TIME INTEGRATORS FOR NON-LINEAR PARABOLIC PROBLEMS Abstract. In tis work a new numerical metod is constructed for time-integrating
More informationStrongly continuous semigroups
Capter 2 Strongly continuous semigroups Te main application of te teory developed in tis capter is related to PDE systems. Tese systems can provide te strong continuity properties only. 2.1 Closed operators
More informationarxiv: v1 [math.ap] 4 Aug 2017
New Two Step Laplace Adam-Basfort Metod for Integer an Non integer Order Partial Differential Equations arxiv:178.1417v1 [mat.ap] 4 Aug 17 Abstract Rodrigue Gnitcogna*, Abdon Atangana** *Department of
More informationLECTURE 14 NUMERICAL INTEGRATION. Find
LECTURE 14 NUMERCAL NTEGRATON Find b a fxdx or b a vx ux fx ydy dx Often integration is required. However te form of fx may be suc tat analytical integration would be very difficult or impossible. Use
More informationPart 1. The diffusion equation
Differential Equations FMNN10 Graded Project #3 c G Söderlind 2016 2017 Published 2017-11-27. Instruction in computer lab 2017-11-30/2017-12-06/07. Project due date: Monday 2017-12-11 at 12:00:00. Goals.
More informationMethods for Parabolic Equations
Maximum Norm Regularity of Implicit Difference Metods for Parabolic Equations by Micael Pruitt Department of Matematics Duke University Date: Approved: J. Tomas Beale, Supervisor William K. Allard Anita
More informationFDM for wave equations
FDM for wave equations Consider the second order wave equation Some properties Existence & Uniqueness Wave speed finite!!! Dependence region Analytical solution in 1D Finite difference discretization Finite
More informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary
More information232 Calculus and Structures
3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE
More information5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems
5 Ordinary Differential Equations: Finite Difference Metods for Boundary Problems Read sections 10.1, 10.2, 10.4 Review questions 10.1 10.4, 10.8 10.9, 10.13 5.1 Introduction In te previous capters we
More informationSwitching, sparse and averaged control
Switching, sparse and averaged control Enrique Zuazua Ikerbasque & BCAM Basque Center for Applied Mathematics Bilbao - Basque Country- Spain zuazua@bcamath.org http://www.bcamath.org/zuazua/ WG-BCAM, February
More informationImplicit-explicit variational integration of highly oscillatory problems
Implicit-explicit variational integration of igly oscillatory problems Ari Stern Structured Integrators Worksop April 9, 9 Stern, A., and E. Grinspun. Multiscale Model. Simul., to appear. arxiv:88.39 [mat.na].
More informationFinite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations
Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Modified Equation of a Difference Scheme What is a Modified Equation of a Difference
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc
More informationRecent Progress in the Integration of Poisson Systems via the Mid Point Rule and Runge Kutta Algorithm
Recent Progress in te Integration of Poisson Systems via te Mid Point Rule and Runge Kutta Algoritm Klaus Bucner, Mircea Craioveanu and Mircea Puta Abstract Some recent progress in te integration of Poisson
More informationMATH745 Fall MATH745 Fall
MATH745 Fall 5 MATH745 Fall 5 INTRODUCTION WELCOME TO MATH 745 TOPICS IN NUMERICAL ANALYSIS Instructor: Dr Bartosz Protas Department of Matematics & Statistics Email: bprotas@mcmasterca Office HH 36, Ext
More information7 Hyperbolic Differential Equations
Numerical Analysis of Differential Equations 243 7 Hyperbolic Differential Equations While parabolic equations model diffusion processes, hyperbolic equations model wave propagation and transport phenomena.
More informationIntroduction to numerical schemes
236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes Heat equation The simple parabolic PDE with the initial values u t = K 2 u 2 x u(0, x) = u 0 (x) and some boundary conditions
More informationLecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator.
Lecture XVII Abstract We introduce te concept of directional derivative of a scalar function and discuss its relation wit te gradient operator. Directional derivative and gradient Te directional derivative
More informationNotes on Multigrid Methods
Notes on Multigrid Metods Qingai Zang April, 17 Motivation of multigrids. Te convergence rates of classical iterative metod depend on te grid spacing, or problem size. In contrast, convergence rates of
More informationNew Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems
MATEMATIKA, 2015, Volume 31, Number 2, 149 157 c UTM Centre for Industrial Applied Matematics New Fourt Order Quartic Spline Metod for Solving Second Order Boundary Value Problems 1 Osama Ala yed, 2 Te
More informationA First-Order System Approach for Diffusion Equation. I. Second-Order Residual-Distribution Schemes
A First-Order System Approac for Diffusion Equation. I. Second-Order Residual-Distribution Scemes Hiroaki Nisikawa W. M. Keck Foundation Laboratory for Computational Fluid Dynamics, Department of Aerospace
More informationNumerical methods Revised March 2001
Revised March 00 By R. W. Riddaway (revised by M. Hortal) Table of contents. Some introductory ideas. Introduction. Classification of PDE's.3 Existence and uniqueness.4 Discretization.5 Convergence, consistency
More informationEntropy and the numerical integration of conservation laws
Pysics Procedia Pysics Procedia 00 2011) 1 28 Entropy and te numerical integration of conservation laws Gabriella Puppo Dipartimento di Matematica, Politecnico di Torino Italy) Matteo Semplice Dipartimento
More information= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c)
Paper 1: Pure Matematics 1 Mark Sceme 1(a) (i) (ii) d d y 3 1x 4x x M1 A1 d y dx 1.1b 1.1b 36x 48x A1ft 1.1b Substitutes x = into teir dx (3) 3 1 4 Sows d y 0 and states ''ence tere is a stationary point''
More information1. Introduction. Consider a semilinear parabolic equation in the form
A POSTERIORI ERROR ESTIMATION FOR PARABOLIC PROBLEMS USING ELLIPTIC RECONSTRUCTIONS. I: BACKWARD-EULER AND CRANK-NICOLSON METHODS NATALIA KOPTEVA AND TORSTEN LINSS Abstract. A semilinear second-order parabolic
More informationSome Error Estimates for the Finite Volume Element Method for a Parabolic Problem
Computational Metods in Applied Matematics Vol. 13 (213), No. 3, pp. 251 279 c 213 Institute of Matematics, NAS of Belarus Doi: 1.1515/cmam-212-6 Some Error Estimates for te Finite Volume Element Metod
More informationA h u h = f h. 4.1 The CoarseGrid SystemandtheResidual Equation
Capter Grid Transfer Remark. Contents of tis capter. Consider a grid wit grid size and te corresponding linear system of equations A u = f. Te summary given in Section 3. leads to te idea tat tere migt
More information5.74 Introductory Quantum Mechanics II
MIT OpenCourseWare ttp://ocw.mit.edu 5.74 Introductory Quantum Mecanics II Spring 9 For information about citing tese materials or our Terms of Use, visit: ttp://ocw.mit.edu/terms. Andrei Tokmakoff, MIT
More informationChapter 10 Exercises
Chapter 10 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rl/fdmbook Exercise 10.1 (One-sided and
More informationFinite Differences: Consistency, Stability and Convergence
Finite Differences: Consistency, Stability and Convergence Varun Shankar March, 06 Introduction Now that we have tackled our first space-time PDE, we will take a quick detour from presenting new FD methods,
More informationMass Lumping for Constant Density Acoustics
Lumping 1 Mass Lumping for Constant Density Acoustics William W. Symes ABSTRACT Mass lumping provides an avenue for efficient time-stepping of time-dependent problems wit conforming finite element spatial
More informationNew Streamfunction Approach for Magnetohydrodynamics
New Streamfunction Approac for Magnetoydrodynamics Kab Seo Kang Brooaven National Laboratory, Computational Science Center, Building 63, Room, Upton NY 973, USA. sang@bnl.gov Summary. We apply te finite
More informationA method of Lagrange Galerkin of second order in time. Une méthode de Lagrange Galerkin d ordre deux en temps
A metod of Lagrange Galerkin of second order in time Une métode de Lagrange Galerkin d ordre deux en temps Jocelyn Étienne a a DAMTP, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, Great-Britain.
More informationUniversity Mathematics 2
University Matematics 2 1 Differentiability In tis section, we discuss te differentiability of functions. Definition 1.1 Differentiable function). Let f) be a function. We say tat f is differentiable at
More informationFEM solution of the ψ-ω equations with explicit viscous diffusion 1
FEM solution of te ψ-ω equations wit explicit viscous diffusion J.-L. Guermond and L. Quartapelle 3 Abstract. Tis paper describes a variational formulation for solving te D time-dependent incompressible
More informationChapter 4: Numerical Methods for Common Mathematical Problems
1 Capter 4: Numerical Metods for Common Matematical Problems Interpolation Problem: Suppose we ave data defined at a discrete set of points (x i, y i ), i = 0, 1,..., N. Often it is useful to ave a smoot
More informationSymmetry Labeling of Molecular Energies
Capter 7. Symmetry Labeling of Molecular Energies Notes: Most of te material presented in tis capter is taken from Bunker and Jensen 1998, Cap. 6, and Bunker and Jensen 2005, Cap. 7. 7.1 Hamiltonian Symmetry
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x
More informationLecture Notes on Numerical Schemes for Flow and Transport Problems
Lecture Notes on Numerical Schemes for Flow and Transport Problems by Sri Redeki Pudaprasetya sr pudap@math.itb.ac.id Department of Mathematics Faculty of Mathematics and Natural Sciences Bandung Institute
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationLecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines
Lecture 5 Interpolation II Introduction In te previous lecture we focused primarily on polynomial interpolation of a set of n points. A difficulty we observed is tat wen n is large, our polynomial as to
More informationHigh-Order Energy and Linear Momentum Conserving Methods for the Klein-Gordon Equation
matematics Article Hig-Order Energy and Linear Momentum Conserving Metods for te Klein-Gordon Equation He Yang Department of Matematics, Augusta University, Augusta, GA 39, USA; yang@augusta.edu; Tel.:
More informationAnalytic Functions. Differentiable Functions of a Complex Variable
Analytic Functions Differentiable Functions of a Complex Variable In tis capter, we sall generalize te ideas for polynomials power series of a complex variable we developed in te previous capter to general
More informationTaylor Series and the Mean Value Theorem of Derivatives
1 - Taylor Series and te Mean Value Teorem o Derivatives Te numerical solution o engineering and scientiic problems described by matematical models oten requires solving dierential equations. Dierential
More information(4.2) -Richardson Extrapolation
(.) -Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Suppose tat lim G 0 and lim F L. Te function F is said to converge to L as
More informationLecture Notes on Numerical Schemes for Flow and Transport Problems
Lecture Notes on Numerical Schemes for Flow and Transport Problems by Sri Redeki Pudaprasetya sr pudap@math.itb.ac.id Department of Mathematics Faculty of Mathematics and Natural Sciences Bandung Institute
More informationThe Sinc-Collocation Method for Solving the Telegraph Equation
Te Sinc-Collocation Metod for Solving te Telegrap Equation E. Hesameddini *1, E. Asadolaifard Department of Matematics, Faculty of Basic Sciences, Siraz University of Tecnology, Siraz, Iran *1 esameddini@sutec.ac.ir;
More informationNumerical Solution to Parabolic PDE Using Implicit Finite Difference Approach
Numerical Solution to arabolic DE Using Implicit Finite Difference Approac Jon Amoa-Mensa, Francis Oene Boateng, Kwame Bonsu Department of Matematics and Statistics, Sunyani Tecnical University, Sunyani,
More informationERROR ANALYSIS OF SOME MULTI-SYMPLECTIC SCHEME FOR KLEIN-GORDON-SCHRÖDINGER EQUATION
ERROR ANALYSIS OF SOME MULTI-SYMPLECTIC SCHEME FOR KLEIN-GORDON-SCHRÖDINGER EQUATION JIALIN HONG, SHANSHAN JIANG,, AND CHUN LI, Abstract. In tis paper, we study te multi-symplectic metod for te Klein-
More informationThe total error in numerical differentiation
AMS 147 Computational Metods and Applications Lecture 08 Copyrigt by Hongyun Wang, UCSC Recap: Loss of accuracy due to numerical cancellation A B 3, 3 ~10 16 In calculating te difference between A and
More informationDifferentiation in higher dimensions
Capter 2 Differentiation in iger dimensions 2.1 Te Total Derivative Recall tat if f : R R is a 1-variable function, and a R, we say tat f is differentiable at x = a if and only if te ratio f(a+) f(a) tends
More informationQuantum Numbers and Rules
OpenStax-CNX module: m42614 1 Quantum Numbers and Rules OpenStax College Tis work is produced by OpenStax-CNX and licensed under te Creative Commons Attribution License 3.0 Abstract Dene quantum number.
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 34, pp. 14-19, 2008. Copyrigt 2008,. ISSN 1068-9613. ETNA A NOTE ON NUMERICALLY CONSISTENT INITIAL VALUES FOR HIGH INDEX DIFFERENTIAL-ALGEBRAIC EQUATIONS
More information3.3. Phase and Amplitude Errors of 1-D Advection Equation
3.3. Phase and Amplitude Errors of 1-D Advection Equation Reading: Duran section 2.4.2. Tannehill et al section 4.1.2. The following example F.D. solutions of a 1D advection equation show errors in both
More informationQuantum Mechanics Chapter 1.5: An illustration using measurements of particle spin.
I Introduction. Quantum Mecanics Capter.5: An illustration using measurements of particle spin. Quantum mecanics is a teory of pysics tat as been very successful in explaining and predicting many pysical
More informationA = h w (1) Error Analysis Physics 141
Introduction In all brances of pysical science and engineering one deals constantly wit numbers wic results more or less directly from experimental observations. Experimental observations always ave inaccuracies.
More informationTime stepping methods
Time stepping methods ATHENS course: Introduction into Finite Elements Delft Institute of Applied Mathematics, TU Delft Matthias Möller (m.moller@tudelft.nl) 19 November 2014 M. Möller (DIAM@TUDelft) Time
More informationSECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY
(Section 3.2: Derivative Functions and Differentiability) 3.2.1 SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY LEARNING OBJECTIVES Know, understand, and apply te Limit Definition of te Derivative
More informationNumerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions
Proc. of te 8t WSEAS Int. Conf. on Matematical Metods and Computational Tecniques in Electrical Engineering, Bucarest, October 16-17, 2006 219 Numerical Solution of One Dimensional Nonlinear Longitudinal
More informationAnalysis of a second order discontinuous Galerkin finite element method for the Allen-Cahn equation
Graduate Teses and Dissertations Graduate College 06 Analysis of a second order discontinuous Galerin finite element metod for te Allen-Can equation Junzao Hu Iowa State University Follow tis and additional
More informationPhysically Based Modeling: Principles and Practice Implicit Methods for Differential Equations
Pysically Based Modeling: Principles and Practice Implicit Metods for Differential Equations David Baraff Robotics Institute Carnegie Mellon University Please note: Tis document is 997 by David Baraff
More information1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point
MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note
More informationAn approximation method using approximate approximations
Applicable Analysis: An International Journal Vol. 00, No. 00, September 2005, 1 13 An approximation metod using approximate approximations FRANK MÜLLER and WERNER VARNHORN, University of Kassel, Germany,
More informationDiscrete Monogenic Functions in Image processing
Discrete Function Teory Discrete Monogenic Functions in Image processing U. Käler CIDMA and Departamento de Matemática Universidade de Aveiro ukaeler@ua.pt MOIMA Scloss Herrenausen Hannover, June 20-24,
More information4.2 - Richardson Extrapolation
. - Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Definition Let x n n converge to a number x. Suppose tat n n is a sequence
More informationResearch Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic Spline Quasi Interpolation
Advances in Numerical Analysis Volume 204, Article ID 35394, 8 pages ttp://dx.doi.org/0.55/204/35394 Researc Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic
More information