CONVERGENCE OF AN IMPLICIT FINITE ELEMENT METHOD FOR THE LANDAU-LIFSHITZ-GILBERT EQUATION
|
|
- Mary Greene
- 6 years ago
- Views:
Transcription
1 CONVERGENCE OF AN IMPLICIT FINITE ELEMENT METHOD FOR THE LANDAU-LIFSHITZ-GILBERT EQUATION SÖREN BARTELS AND ANDREAS PROHL Abstract. Te Landau-Lifsitz-Gilbert equation describes dynamics of ferromagnetism, were strong nonlinearity, nonconvexity are ard to tackle: so far, existing scemes to approximate weak solutions suffer from severe time-step restrictions. In tis paper, we propose an implicit fully discrete sceme and verify unconditional convergence.. Introduction Te penomenological Landau-Lifscitz-Gilbert equation LLG describes dynamics of ferromagnetism; let α denote te damping parameter, ten te magnetization m :, T Ω S 2, for S 2 = {x R 3 x = }, solves. m t = α m m m + m m, supplemented by initial and boundary conditions, m = m W,2 Ω; S 2, and n m = on, T Ω. A proper definition of weak solutions is given below. Limiting equations are te Heisenberg equation α, and eat flow for armonic maps α, see [, Propositions 5., 5.2],.2 m t = m m α, m t = m + m 2 m α. Te construction of convergent scemes for. is a nontrivial task, due to te nonconvex sideconstraint m = a.e. in, T Ω, wic is difficult to realize in a numerical approximation sceme. A first explicit sceme is proposed in [2], were also weak sub- convergence towards weak solutions is verified; tis program is continued in [3], were k = o α 2 + n 2 is identified to be sufficient for stability and convergence; sarpness of tese restrictions is evidenced by computational studies in [3]. From tis background, we look for an implicit sceme exempted from restricting requirements for numerical parameters, and iger flexibility wit respect to small coices of α >. Te construction of our discretization is based on a reformation of. by Gilbert see, e.g. [5], m t α m m t = + α 2 m m. Given te lowest order finite element space V W,2 Ω; R 3 subordinate to a triangulation T of Ω and a time-step size k >, our approximation sceme reads as follows: Algoritm.. Let m V. Given j and m j V determine m j+ d t m j+, φ + α m j d tm j+, φ = + α 2 m j+/2 V from m j+/2, φ φ V. 99 Matematics Subject Classification. 35K55, 65M2, 65M5, 68U, 94A8. Key words and prases. ferromagnetism, Landau-Lifsitz-Gilbert equation, nonconvexity, finite elements, convergence. Supported by Deutsce Forscungsgemeinscaft troug te DFG Researc Center Mateon Matematics for key tecnologies in Berlin
2 Here,, denotes a discrete version reduced integration of te inner product in L 2 Ω; R 3, : W,2 Ω; R 3 V is a discrete version of te Laplace operator, and we use d t ϕ j := k ϕ j ϕ j for j and ϕ j+/2 := 2 ϕ j+ + ϕ j for j and a sequence {ϕ j } j ; we refer te reader to Section 2 for details. Remark.. Te linear second term in Algoritm. is motivated by te identity m j d tm j+ = m j+/2 k 2 d tm j+ dt m j+ = m j+/2 d t m j+. It is well-known, tat weak solutions to. solve m t = div m m + α m + m 2 m in distributional sense; cf. [, 4]. Corresponding relations need not old for discretizations, due to competition of local and nonlocal aspects inerent to fully discrete finite-element based metods. Lemma 6. below sows tat solutions of Algoritm. satisfy.3 d t m j+, φ + α m j+/2 j+/2, φ = α m 2 m j+/2, φ m j+/2 m j+/2, φ + Corr, for all φ V and a correcting term Corr. Lemma 3. below states conservation of m j = at te nodes of te triangulation T and verifies a discrete energy law for solutions to Algoritm.. Tis indicates tat te forcing correction term Corr serves to balance te damping effect of te implicit Euler metod wit employed reduced integration and local averaging tools in Algoritm.. Te unconditional stability of Algoritm. allows to prove subconvergence to a weak solution of.. Te remainder of tis paper is organized as follows: Preliminaries are stated in Section 2. Our main result is Teorem 3. wic verifies unconditional convergence for Algoritm.; a simple fixed-point iteration is proposed in Algoritm 4., wose convergence is establised for k = O 2, uniformly for values α C, in Section 4. We discuss numerical experiments wit finite-time blowup in Section 5, allowing for direct comparison wit results for values α = O in [3], and study te limiting case α. Section 6 proves.3 and illustrates difficulties in te construction of convergent implicit finite element scemes. 2. Preliminaries Trougout tis paper we assume tat T is a quasiuniform regular triangulation of te polygonal or polyedral bounded Lipscitz domain Ω R n into triangles or tetraedra for n = 2 or n = 3, respectively. We define te lowest order finite element space V W,2 Ω; R 3 by V = { φ CΩ; R 3 : φ K P K; R 3 K T }, were P K; R 3 denotes te set of polynomials of total degree less or equal tan one restricted to te element K T. Given te set of nodes { x l : l L } of te triangulation T, te nodal interpolation operator I : CΩ; R 3 V satisfies I φx l = φx l for all l L. Given functions f, g L 2 Ω; R m and letting, denote te inner product in R m we set f, g = f, g dx. For continuous functions φ, Z CΩ; R 3 we define φ, Z = Ω Ω I φ, Z dx = l L 2 β l φx l, Zx l,
3 for certain weigts β l >, l L. If for eac l L we denote by ϕ l CΩ te nodal basis function wic is T -elementwise affine and satisfies ϕ l x l = and ϕ l x m = for all m L \ {l} ten we ave β l = Ω ϕ l dx. We define φ 2 = φ, φ and notice tat φ 2 L 2 φ 2 n + 2 φ 2 L 2, for all φ V. We define a discrete Laplace operator : W,2 Ω; R 3 V by 2. φ, χ = φ, χ χ V. It is well known tat tere exists a constant c > suc tat for all φ V tere olds 2.2 φ L 2 c φ L 2, were is te maximal mes-size in T, i.e., = max{diamk : K T }. Coosing χ = φ in 2. and using 2.2 we observe tat for all φ V tere olds 2.3 φ 2 = φ, φ φ L 2 φ L 2 c φ L 2 φ. Given φ V and a node x l for some l L we obtain from using χ = ϕ l φ x l in 2. tat φ x l 2 = β l φ, χ = β l φ, χ 2.4 = β l φ x m, φ x l ϕ m, ϕ l c 2 2 φ L φ x l, m L: K T, x m,x l K were we used 2.2, tat given a node x l te cardinality of te set {m L : K, x m, x l K} is bounded -independently, and tat ϕ m L 2 cβ /2 l for all m L. 3. Unconditional Convergence We first recall te definition of a weak solution to LLG. Trougout tis section we abbreviate Ω T =, T Ω. Definition 3.. Let m W,2 Ω; S 2, ten m is called weak solution to LLG, if for all T > m W,2 Ω T ; R 3 suc tat m = almost everywere in Ω T ; 2 for all φ C Ω T ; R 3 olds m t, φ dxdt + α m m t, φ dxdt = + α 2 m m, φ dxdt ; Ω T Ω Ω T 3 m = m in te sense of traces; 4 for almost all T, T tere olds mt 2 dx + α 2 + α 2 Ω,T Ω m t 2 dxdt 2 Ω m 2 dx. Te following lemma provides discrete counterparts of and 4. We remark tat wellposedness of Algoritm., i.e., te existence of a unique sequence {m j } j tat solves Algoritm., can be deduced from a classical argument, see e.g. [, Section 3]. Lemma 3.. Suppose tat m x l = for all l L. Ten te sequence {m j } j produced by Algoritm. satisfies for all j i m j+ x l = l L, ii 2 d t m j+ 2 L + α 2 + α 2 d tm j+ 2 =. 3
4 Proof. Verification of i follows from coosing φ = ϕ l m j+/2 x l V for l L in Algoritm.. In order to verify ii, we first coose φ = m j+/2 and find 2 d t m j+ 2 L + α m j+/2 2 d t m j+, m j+/2 =. Coosing φ = d t m j+ yields α + α 2 d tm j+ 2 = α m j+/2 m j+/2, d t m j+. A combination of te two identities proves ii and finises te proof of te lemma. Definition 3.2. For x Ω and t [t j, t j+ define Mt, x := t t j m j+ k x + t j+ t m j k x, M t, x := m j x, M+ t, x := m j+ x, Mt, x := m j+/2. Given any T > equation ii in Lemma 3. may be rewritten as 2 M+ T 2 L + α 2 + α 2 M t 2 dt 2 M 2 L 2. Tis bound yields te existence of some m W,2 Ω; R 3 wic is te weak limit as k, of a subsequence suc tat M m in W,2 Ω T, M, M +, M m in L 2 Ω, M, M +, M m in L 2 Ω T. Since M t, x l = for every l L and almost all t, T, tere olds for every K T, M 2 L 2 K C M 2 L 2 K = C 2 M M L 2 K 2C M L 2 K, wic implies M in L 2 Ω T ; R 3, and ence m = almost everywere in Ω T. Algoritm. may be written as follows: taking φ t := I φt,, for φ C Ω T ; R 3, tere olds 3. M t, φ dt + α M M t, φ dt = + α 2 M M, φ dt. Effects of reduced integration are controlled using te fact tat for all χ, η V tere olds χ, η χ, η C χ L 2 η L 2. Tis implies tat for almost all t, T we ave Mt, φ M t, φ C Mt L 2 φ L 2 and allows to prove tat M t, φ dt m t, φ dt. Using tat for χ V and η CΩ; R 3 tere olds χ, η = χ, I η and employing a triangle inequality and standard estimates for nodal interpolation results in Mt, M φ M t, Id ± I M φ C Mt L 2 M φ L 2. Tis yields tat M M t, φ dt 4 m m t, φdt.
5 Te only troublesome limit is for te last term in 3.. We write M M, φ = M φ, M = Id I M φ, M + I IdM φ, M + M φ, M =: I + II + III. Control of I uses te bound χ L 2 c χ L 2 and estimates for nodal intepolation, I C 2 D 2 M φ L 2 K M L 2 K C M L 2 φ L M L 2. K T A similar argumentation proves II C K T D 2 M φ L 2 K M L 2 K C M L 2 φ L M L 2. We use tat given any Z, χ W,2 Ω; R 3 tere olds Z, Z χ = Z, Z χ to verify A combination of te last four assertions sows III = M φ, M = M φ, M. T M M, φ dt m φ, m dt = Tis proves our main teorem. m φ, m dt. Teorem 3.. Suppose m x l = for all l L and let {m j } j solve Algoritm.. Assume tat m m in W,2 Ω for. For k, tere exists m W,2 Ω T ; R 3 suc tat M subconverges to m in W,2 Ω T and m is a weak solution of LLG. 4. Solving te nonlinear system In te numerical experiments reported below we employ te following fixed-point iteration to solve te nonlinear system in Algoritm.: Algoritm 4.. Set m j+, := m j and l :=. i Compute m j+,l+ V suc tat for all φ V tere olds 4. k mj+,l+, φ + α k mj mj+,l+ + α2 m j+,l+ 4, φ + α2 4 m j, φ + α2 4 ii If m j+,l+ ε ten stop and set m j+ iii Set l := l + and go to i. m j+,l+ m j+,l, φ m j m j+,l+, φ = k mj, φ + + α2 m j 4 m j, φ := m j+,l+. Te following lemma sows tat te iteration converges provided tat k c 2 / + α 2, for an, k, α-independent constant factor c > tat only depends on te geometry of T. Lemma 4.. Suppose tat γ := 5 + α 2 c 2 2 k/4 < and m j x m = for all m L. Ten, for all l tere exists a unique solution m j+,l+ to 4.. For all l tere olds m j+,l+ Θ γ γ mj+,l, 5
6 provided tat Θ := +ρ ρ > for ρ := + α2 c 2 k 2 /4. Moreover, for all l and all φ V tere olds dt m j+,l+, φ + αm j d tm j+,l+, φ + α 2 m j+/2,l+ were d t m j+,l+ = k m j+,l+ m j+/2,l+, φ Θ 5 + α2 c m j+,l+ φ, m j and mj+,l+/2 = 2 mj+,l+ + m j. Proof. We abbreviate µ = + α 2 /4. For φ = m j+,l+ from below by te left-and side of 4. is bounded k mj+,l+ k mj+,l+ 2 µmj m j+,l+, m j+,l+ 2 µ mj L m j+,l+ m j+,l+ k µ 5c 2 2 m j+,l+ 2, were we used m j L = and m j+,l+ c m j+,l+. Terefore, te bilinear form defined by te left-and side of 4. is positive definite on V V if γ < and ten 4. admits a unique solution. Let m L be suc tat m j+,l L = m j+,l x m. Coosing φ = φ m m j+,l x m in te equation for m j+,l proves k mj+,l x m 2 µ m j x m m j+,l x m m j+,l x m + k mj x m m j+,l x m + µ m j x m m j x m m j+,l x m = µ m j+,l x m m j+,l x m + k mj+,l x m + µ m j x m m j+,l x m Tere olds φ x m c 2 2 φ L for all φ V and ence m j+,l L + kµc 2 2 = Θ. kµc 2 2 Subtraction of two subsequent equations in te fixed-point iteration yields k mj+,l+ µ[m j+,l+, φ + α k mj [mj+,l+ µ[m j+,l+ for all φ V. Coosing φ := m j+,l+ m j+,l+ ], φ ] m j+,l, φ µm j+,l [m j+,l ], φ ] m j, φ µm j [m j+,l+ ], φ = kµθ [m j+,l sows ] + kµ [m j+,l+ ]. Using φ c φ for all φ V we deduce te first estimate of te lemma. In order to verify te second estimate we notice tat owing to 4., m j mj =, and te above 6
7 estimate m j+,l+ L Θ tere olds for all φ V d t m j+,l+, φ + αm j d tm j+,l+, φ µm j+/2,l+ m j+/2,l+, φ = k mj+,l+ µm j+,l+, φ k mj, φ + α k mj mj+,l+, φ α k mj mj, φ m j+,l+, φ µm j+,l+ m j, φ µm j m j+,l+, φ µm j m j, φ =µm j+,l+ µ m j+,l+ Θµc m j+,l wic finises te proof of te lemma. m j+,l, φ µm j+,l+ L m j+,l + φ + φ m j+,l+, φ 5. Numerical Experiments Te implementation of Algoritms. and 4. was performed in MATLAB wit an assemblation of te stiffness matrices in C. We set ε = 4 for te termination criterion in Algoritm 4., and it terminated after at most 5 iterations in all of our experiments. Te experiments are defined troug te following example wic is taken from [3]. Example 5.. Let Ω = /2, /2 2 and let m : Ω S 2 be defined by {,, for x /2, m x = 2xA, A 2 x 2 / A 2 + x 2 for x /2, were A := 2 x 4 /s for some s >. Te triangulations T l used in te numerical simulations are defined troug a positive integer l and consist of 2 2l+ alved squares wit edge lengt = 2 l. Motivated by Lemma 4. we use k = 2 / + α 2 As discrete initial data we employ te nodal interpolant of m, i.e., we set m = I Tl m in all experiments. Figures and 2 display snapsots of te numerical approximation provided by Algoritm. wit α =, s =, and l = 4. Te plots in Figure display te first two components of te vector field M at te nodes of te triangulation after an appropriate rescaling and at various times. Figure 2 sows a zoom towards te origin and reveals tat in tis experiment regularity of te exact solution cannot be expected. At time t.529 te vector at te origin points in anoter direction tan all surrounding vectors resulting in a large maximal W, norm. Figures 3 and 4 sow similar snapsots for α = /64, s =, and l = 4. Owing to te significantly smaller stabilization corresponding to te small value of α, te numerical solution is even less regular tan in te previous experiment and fails to become stationary for times t /2. For fixed α = and s = 4 we used l = 4, 5, 6 in Example 5.. In Figure 5 we displayed te energy EMt = Mt, 2 dx 2 Ω and te W, semi-norm Mt, = Mt L as functions of t for t, 6/ for l = 4, 5, 6. For eac l = 4, 5, 6 te function Mt L assumes te maximum value 2 2 among functions φ V wit φ x m = for all nodes x m. We observe tat for decreasing mes-size te blowup time te time at wic Mt L assumes its maximum approaces t.3. In order to study te dependence of blow-up beaviour on te parameter α we ran Algoritm. in Example 5. for fixed l = 5, s =, and for α =, /4, /6, /64, /256. Te plot in Figure 6 7
8 Figure. Numerical approximation Mt, in Example 5. wit s =, l = 4, and α = for t =,.9,.295,.529,.588, Figure 2. Nodal values Mt, x m for nodes x m close to te origin in Example 5. wit s =, l = 4, and α = for t =,.9,.295,.529,.588,
9 Figure 3. Numerical approximation Mt, in Example 5. wit s =, l = 4, and α = /64 for t =,.2,.297,.492,.687,.78,.37,.664,.254,.2347,.2738,.33. 9
10 Figure 4. Nodal values Mt, x m for nodes x m close to te origin in Example 5. wit s =, l = 4, and α = /64 for t =,.2,.297,.492,.687,.78,.37,.664,.254,.2347,.2738,.33.
11 indicates tat te blow-up time approaces te time t.6 for decreasing α. Te experimental values for α = /64 and α = /256 almost coincide. We remark tat te results of our experiments for α =, /4, /6 are similar to te results obtained in [3] wit an explicit sceme. Te implicit sceme of tis article allows to use smaller values for α wic lead to too restrictive conditions on te time step size for te explicit sceme of [3]. For te triangulations employed ere and for α = te total runtimes of te explicit sceme using reduced integration and te implicit sceme are comparable. 6. Proof of.3 Lemma 6.. Assume tat m x l = for all l L and let {m j } j solve Algoritm.. Tere olds for all φ V, d t m j+, φ + α m j+/2 m j+/2 for a correcting term Corr = Corr A + Corr B, wit Corr A := α j+/2 m 2 +α m j+/2 j+/2, φ = α m 2 m j+/2, φ m j+/2, φ + Corr, 2, m j+/2, φ + α2 + α 2 d t m j+, [ m j+/2 2 φ ] and Corr B = 3 i= Corr B i given in te proof below.,, [ m j+/2 2 ]φ Proof. Given any Z V coose φ = I m j+/2 Z in Algoritm., ten te properties of, imply j+/2 m d t m j+ 6., Z + α m j+/2 m j+/2 d t m j+, Z = + α 2 m j+/2 m j+/2 m j+/2, Z. Owing to a b c = a, c b a, b c for all a, b, c R 3, te second term on te left-and side in 6. may be rewritten as α m j+/2, d t m j+ m j+/2, Z α m j+/2 2 d t m j+, Z dt m j+ 2 m j+/2, Z α m j+/2 2 d t m j+, Z, = α 2 and te first term on te left-and side vanises owing to Lemma 3. below. We again use te above vector identity to recast te rigt-and side of 6. as α 2 m j+/2 + α2 m j+/2 2 m j+/2, Z. We proceed independently wit arising two terms: intermitting te Lagrange interpolant for te, m j+/2 m j+/2, Z nonlinear term in te first case to benefit from 2. yields Id j+/2 ± I m, Z m j+/2, m j+/2 Id = j+/2 I m + Id I m j+/2, Z m j+/2, m j+/2 m j+/2, Z m j+/2, Z m j+/2, m j+/2 j+/2, m, were te first two terms on te rigt-and side are referred to as Corr B. For te last term, we resume j+/2 m, m j+/2, Z m j+/2 = m j+/2 2 m j+/2 j+/2, Z + m 2 2, m j+/2, Z.
12 E[ M t ] =/8 M t, =/8 E[ M t ] =/6 M t, =/6 E[ M t ] =/32 M t, =/32 E[ M t ] =/64 M t, =/ t Figure 5. Energy and W, semi-norm for decreasing mes-sizes in Example 5. wit α = and s = E[ M t ] α = M t, α = E[ M t ] α = /4 M t, α = /4 E[ M t ] α = /6 M t, α = /6 E[ M t ] α = /64 M t, α = /64 E[ M t ] α = /256 M t, α = / t Figure 6. Energy and W, semi-norm in Example 5. for l = 5, s =, and α =, /4, /6, /64, /256. 2
13 Similarly, we account for effects of reduced integration and local averaging inerent to te sceme for te second term in 6.2, Id j+/2 ± I m 2 Id Z, m j+/2 = j+/2 I m 2 Z, m j+/2 + Id I m j+/2 2 Z, m j+/2 m j+/2 2 Z, m j+/2, were te first two terms on te rigt-and side are gatered in Corr B2. Finally, by Algoritm., and a b, c = a c, b, te first term in 6. is identical to for Corr B3 α dt m j+, Z + + α2 α = α = Id I m j+/2 m j+/2 dt m j+, Z + + α2 α Reassembling 6. ten yields to + α 2 m j+/2 2 d t m j+ [ +α + α 2 j+/2 m m j+/2 Z, m j+/2, Z m j+/2, Z m j+/2 Z, m j+/2 + CorrB3, Id I m j+/2 Z, m j+/2. = + α2 m j+/2 Z, m j+/2 j+/2, Z + m 2 2, m j+/2, Z 2 m j+/2, m j+/2 2 Z ] + α Rearranging terms ten yields to te assertion. Corr A + + α 2 Corr B. Acknowledgment: Part of te work was written wen S. B. visited Forscungsinstitut für Matematik ETH Züric in January 25. S. B. gratefully acknowledges ospitality of te Department of Matematics at te University of Maryland at College Park. References [] F. Alouges, A. Soyeur, On global weak solutions for Landau-Lifsitz equations: existence and nonuniqueness, Nonl. Analysis, Teory, Met. & Appl. 8, pp [2] F. Alouges, P. Jaisson Convergence of a finite elements discretization for te Landau Lifsitz equations, downloadable at maery.mat.u-psud.fr/alouges/ 24. [3] S. Bartels, J. Ko, A. Prol, Numerical approximation of Landau-Lifsitz equations and finite time blow up of weak solutions, manuscript 25. [4] B. Guo, M.-C. Hong, Te Landau-Lifsitz equation of te ferromagnetic spin cain and armonic maps, Calc. Var., pp [5] M. Kružík, A. Prol, Recent Developments in Modeling, Analysis and Numerics of Ferromagnetism, SIAM Review accepted, also downloadable at: Department of Matematics, Humboldt-Universität zu Berlin, Unter den Linden 6, D-99 Berlin, Germany. Department of Matematics, ETHZ, CH-892 Züric, Switzerland 3
NUMERICAL APPROXIMATION OF THE LANDAU-LIFSHITZ-GILBERT EQUATION AND FINITE TIME BLOW-UP OF WEAK SOLUTIONS
NUMERICAL APPROXIMATION OF THE LANDAU-LIFSHITZ-GILBERT EQUATION AND FINITE TIME BLOW-UP OF WEAK SOLUTIONS SÖREN BARTELS, JOY KO, AND ANDREAS PROHL Abstract. Te Landau-Lifsitz-Gilbert equation describes
More informationAn Implicit Finite Element Method for the Landau-Lifshitz-Gilbert Equation with Exchange and Magnetostriction
SMA An Implicit Finite Element Metod for te Landau-Lifsitz-Gilbert Equation wit Excange and Magnetostriction Jonatan ROCHAT under te supervision of L. Banas and A. Abdulle 2 ACKNOWLEDGEMENTS I would like
More informationA finite element approximation for the quasi-static Maxwell Landau Lifshitz Gilbert equations
ANZIAM J. 54 (CTAC2012) pp.c681 C698, 2013 C681 A finite element approximation for te quasi-static Maxwell Landau Lifsitz Gilbert equations Kim-Ngan Le 1 T. Tran 2 (Received 31 October 2012; revised 29
More informationPROJECTION-FREE APPROXIMATION OF GEOMETRICALLY CONSTRAINED PARTIAL DIFFERENTIAL EQUATIONS
PROJECTION-FREE APPROXIMATION OF GEOMETRICALLY CONSTRAINED PARTIAL DIFFERENTIAL EQUATIONS Abstract. We devise algoritms for te numerical approximation of partial differential equations involving a nonlinear,
More informationStability and convergence of finite element approximation schemes for harmonic maps
Stability and convergence of finite element approximation scemes for armonic maps Sören Bartels Department of Matematics, Humboldt-Universität zu Berlin, Unter den Linden 6, D-199 Berlin, Germany E-Mail:
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 informationAn extended midpoint scheme for the Landau-Lifschitz-Gilbert equation in computational micromagnetics. Bernhard Stiftner
AANMPDE(JS) Strobl, July 7, 2016 An extended midpoint sceme for te Landau-Lifscitz-Gilbert equation in computational micromagnetics Bernard Stiftner joint work wit Dirk Praetorius, Micele Ruggeri TU Wien
More informationarxiv: v1 [math.na] 29 Nov 2017
LINEAR SECOND-ORDER IMEX-TYPE INTEGRATOR FOR THE (EDDY CURRENT) LANDAU LIFSHITZ GILBERT EQUATION GIOVANNI DI FRATTA, CARL-MARTIN PFEILER, DIRK PRAETORIUS, MICHELE RUGGERI, BERNHARD STIFTNER arxiv:1711.1715v1
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 informationCONVERGENT DISCRETIZATION OF HEAT AND WAVE MAP FLOWS TO SPHERES USING APPROXIMATE DISCRETE LAGRANGE MULTIPLIERS
CONVERGENT DISCRETIZATION OF HEAT AND WAVE MAP FLOWS TO SPHERES USING APPROXIMATE DISCRETE LAGRANGE MULTIPLIERS SÖREN BARTELS, CHRISTIAN LUBICH, AND ANDREAS PROHL Abstract. We propose fully discrete scemes
More informationNumerical Experiments Using MATLAB: Superconvergence of Nonconforming Finite Element Approximation for Second-Order Elliptic Problems
Applied Matematics, 06, 7, 74-8 ttp://wwwscirporg/journal/am ISSN Online: 5-7393 ISSN Print: 5-7385 Numerical Experiments Using MATLAB: Superconvergence of Nonconforming Finite Element Approximation for
More informationA posteriori error analysis for time-dependent Ginzburg-Landau type equations
A posteriori error analysis for time-dependent Ginzburg-Landau type equations Sören Bartels Department of Matematics, University of Maryland, College Park, MD 74, USA Abstract. Tis work presents an a posteriori
More informationContinuity and Differentiability of the Trigonometric Functions
[Te basis for te following work will be te definition of te trigonometric functions as ratios of te sides of a triangle inscribed in a circle; in particular, te sine of an angle will be defined to be te
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 informationch (for some fixed positive number c) reaching c
GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan
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 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 informationarxiv: v2 [math.na] 5 Jul 2017
Trace Finite Element Metods for PDEs on Surfaces Maxim A. Olsanskii and Arnold Reusken arxiv:1612.00054v2 [mat.na] 5 Jul 2017 Abstract In tis paper we consider a class of unfitted finite element metods
More information1. Introduction. We consider the model problem: seeking an unknown function u satisfying
A DISCONTINUOUS LEAST-SQUARES FINITE ELEMENT METHOD FOR SECOND ORDER ELLIPTIC EQUATIONS XIU YE AND SHANGYOU ZHANG Abstract In tis paper, a discontinuous least-squares (DLS) finite element metod is introduced
More informationarxiv: v2 [math.na] 5 Feb 2017
THE EDDY CURRENT LLG EQUATIONS: FEM-BEM COUPLING AND A PRIORI ERROR ESTIMATES MICHAEL FEISCHL AND THANH TRAN arxiv:1602.00745v2 [mat.na] 5 Feb 2017 Abstract. We analyze a numerical metod for te coupled
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 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 informationPoisson Equation in Sobolev Spaces
Poisson Equation in Sobolev Spaces OcMountain Dayligt Time. 6, 011 Today we discuss te Poisson equation in Sobolev spaces. It s existence, uniqueness, and regularity. Weak Solution. u = f in, u = g on
More informationarxiv: v1 [math.na] 28 Apr 2017
THE SCOTT-VOGELIUS FINITE ELEMENTS REVISITED JOHNNY GUZMÁN AND L RIDGWAY SCOTT arxiv:170500020v1 [matna] 28 Apr 2017 Abstract We prove tat te Scott-Vogelius finite elements are inf-sup stable on sape-regular
More informationMath Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim
Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z
More informationDedicated to the 70th birthday of Professor Lin Qun
Journal of Computational Matematics, Vol.4, No.3, 6, 4 44. ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS Guang-wei Yuan Xu-deng Hang Laboratory of Computational Pysics,
More informationPreconditioning in H(div) and Applications
1 Preconditioning in H(div) and Applications Douglas N. Arnold 1, Ricard S. Falk 2 and Ragnar Winter 3 4 Abstract. Summarizing te work of [AFW97], we sow ow to construct preconditioners using domain decomposition
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 informationChapter 5 FINITE DIFFERENCE METHOD (FDM)
MEE7 Computer Modeling Tecniques in Engineering Capter 5 FINITE DIFFERENCE METHOD (FDM) 5. Introduction to FDM Te finite difference tecniques are based upon approximations wic permit replacing differential
More informationPriority Program 1253
Deutsce Forscungsgemeinscaft Priority Program 53 Optimization wit Partial Differential Equations K. Deckelnick, A. Günter and M. Hinze Finite element approximation of elliptic control problems wit constraints
More informationNUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example,
NUMERICAL DIFFERENTIATION James T Smit San Francisco State University In calculus classes, you compute derivatives algebraically: for example, f( x) = x + x f ( x) = x x Tis tecnique requires your knowing
More information1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)
Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of
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 informationTHE DISCRETE PLATEAU PROBLEM: CONVERGENCE RESULTS
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 0025-5718XX0000-0 THE DISCRETE PLATEAU PROBLEM: CONVERGENCE RESULTS GERHARD DZIUK AND JOHN E. HUTCHINSON Abstract. We solve te problem of
More informationDownloaded 11/15/17 to Redistribution subject to SIAM license or copyright; see
SIAM J. NUMER. ANAL. Vol. 55, No. 6, pp. 2787 2810 c 2017 Society for Industrial and Applied Matematics EDGE ELEMENT METHOD FOR OPTIMAL CONTROL OF STATIONARY MAXWELL SYSTEM WITH GAUSS LAW IRWIN YOUSEPT
More informationFunction Composition and Chain Rules
Function Composition and s James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 8, 2017 Outline 1 Function Composition and Continuity 2 Function
More informationMIXED DISCONTINUOUS GALERKIN APPROXIMATION OF THE MAXWELL OPERATOR. SIAM J. Numer. Anal., Vol. 42 (2004), pp
MIXED DISCONTINUOUS GALERIN APPROXIMATION OF THE MAXWELL OPERATOR PAUL HOUSTON, ILARIA PERUGIA, AND DOMINI SCHÖTZAU SIAM J. Numer. Anal., Vol. 4 (004), pp. 434 459 Abstract. We introduce and analyze a
More informationMath 161 (33) - Final exam
Name: Id #: Mat 161 (33) - Final exam Fall Quarter 2015 Wednesday December 9, 2015-10:30am to 12:30am Instructions: Prob. Points Score possible 1 25 2 25 3 25 4 25 TOTAL 75 (BEST 3) Read eac problem carefully.
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 informationPOLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY
APPLICATIONES MATHEMATICAE 36, (29), pp. 2 Zbigniew Ciesielski (Sopot) Ryszard Zieliński (Warszawa) POLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY Abstract. Dvoretzky
More informationNONNEGATIVITY OF EXACT AND NUMERICAL SOLUTIONS OF SOME CHEMOTACTIC MODELS
NONNEGATIVITY OF EXACT AND NUMERICAL SOLUTIONS OF SOME CHEMOTACTIC MODELS PATRICK DE LEENHEER, JAY GOPALAKRISHNAN, AND ERICA ZUHR Abstract. We investigate nonnegativity of exact and numerical solutions
More informationWEAK MARTINGALE SOLUTIONS TO THE STOCHASTIC LANDAU LIFSHITZ GILBERT EQUATION WITH MULTI-DIMENSIONAL NOISE VIA A CONVERGENT FINITE-ELEMENT SCHEME
WEAK MARTINGALE SOLUTIONS TO THE STOCHASTIC LANDAU LIFSHITZ GILBERT EQUATION WITH MULTI-DIMENSIONAL NOISE VIA A CONVERGENT FINITE-ELEMENT SCHEME BENIAMIN GOLDYS, JOSEPH GROTOWSKI, AND KIM-NGAN LE Abstract.
More informationVolume 29, Issue 3. Existence of competitive equilibrium in economies with multi-member households
Volume 29, Issue 3 Existence of competitive equilibrium in economies wit multi-member ouseolds Noriisa Sato Graduate Scool of Economics, Waseda University Abstract Tis paper focuses on te existence of
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 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 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 informationCopyright c 2008 Kevin Long
Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula
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 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 informationlecture 26: Richardson extrapolation
43 lecture 26: Ricardson extrapolation 35 Ricardson extrapolation, Romberg integration Trougout numerical analysis, one encounters procedures tat apply some simple approximation (eg, linear interpolation)
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 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 informationDifferentiation. Area of study Unit 2 Calculus
Differentiation 8VCE VCEco Area of stud Unit Calculus coverage In tis ca 8A 8B 8C 8D 8E 8F capter Introduction to limits Limits of discontinuous, rational and brid functions Differentiation using first
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 information3.4 Worksheet: Proof of the Chain Rule NAME
Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are
More informationLEAST-SQUARES FINITE ELEMENT APPROXIMATIONS TO SOLUTIONS OF INTERFACE PROBLEMS
SIAM J. NUMER. ANAL. c 998 Society for Industrial Applied Matematics Vol. 35, No., pp. 393 405, February 998 00 LEAST-SQUARES FINITE ELEMENT APPROXIMATIONS TO SOLUTIONS OF INTERFACE PROBLEMS YANZHAO CAO
More informationPart VIII, Chapter 39. Fluctuation-based stabilization Model problem
Part VIII, Capter 39 Fluctuation-based stabilization Tis capter presents a unified analysis of recent stabilization tecniques for te standard Galerkin approximation of first-order PDEs using H 1 - conforming
More informationWeierstraß-Institut. im Forschungsverbund Berlin e.v. Preprint ISSN
Weierstraß-Institut für Angewandte Analysis und Stocastik im Forscungsverbund Berlin e.v. Preprint ISSN 0946 8633 Stability of infinite dimensional control problems wit pointwise state constraints Micael
More informationHow to Find the Derivative of a Function: Calculus 1
Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te
More information4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.
Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra
More informationarxiv: v2 [math.na] 8 Nov 2017
CONVERGENCE OF AN IMPLICIT-EXPLICIT MIDPOINT SCHEME FOR COMPUTATIONAL MICROMAGNETICS DIRK PRAETORIUS, MICHELE RUGGERI, AND BERNHARD STIFTNER arxiv:1611.2465v2 [mat.na] 8 Nov 217 Abstract. Based on lowest-order
More informationAdaptive Finite Element Method
39 Capter 3 Adaptive inite Element Metod 31 Introduction As already pointed out in capter 2, singularities occur in interface problems Wen discretizing te problem (221) wit inite Elements, te singularities
More informationA posteriori error estimates for non-linear parabolic equations
A posteriori error estimates for non-linear parabolic equations R Verfürt Fakultät für Matematik, Rur-Universität Bocum, D-4478 Bocum, Germany E-mail address: rv@num1rur-uni-bocumde Date: December 24 Summary:
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 informationITERATIVE SOLUTION OF A CONSTRAINED TOTAL VARIATION REGULARIZED MODEL PROBLEM
ITERATIVE SOLUTION OF A CONSTRAINED TOTAL VARIATION REGULARIZED MODEL PROBLEM Abstract. Te discretization of a bilaterally constrained total variation minimization problem wit conforming low order finite
More informationFINITE ELEMENT APPROXIMATIONS AND THE DIRICHLET PROBLEM FOR SURFACES OF PRESCRIBED MEAN CURVATURE
FINITE ELEMENT APPROXIMATIONS AND THE DIRICHLET PROBLEM FOR SURFACES OF PRESCRIBED MEAN CURVATURE GERHARD DZIUK AND JOHN E. HUTCHINSON Abstract. We give a finite element procedure for te Diriclet Problem
More informationVariational Localizations of the Dual Weighted Residual Estimator
Publised in Journal for Computational and Applied Matematics, pp. 192-208, 2015 Variational Localizations of te Dual Weigted Residual Estimator Tomas Ricter Tomas Wick Te dual weigted residual metod (DWR)
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 informationError analysis of a finite element method for the Willmore flow of graphs
Interfaces and Free Boundaries 8 6, 46 Error analysis of a finite element metod for te Willmore flow of graps KLAUS DECKELNICK Institut für Analysis und Numerik, Otto-von-Guericke-Universität Magdeburg,
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 informationITERATIVE SOLUTION OF A CONSTRAINED TOTAL VARIATION REGULARIZED MODEL PROBLEM
ITERATIVE SOLUTION OF A CONSTRAINED TOTAL VARIATION REGULARIZED MODEL PROBLEM Abstract. Te discretization of a bilaterally constrained total variation minimization problem wit conforming low order finite
More informationSmoothness of solutions with respect to multi-strip integral boundary conditions for nth order ordinary differential equations
396 Nonlinear Analysis: Modelling and Control, 2014, Vol. 19, No. 3, 396 412 ttp://dx.doi.org/10.15388/na.2014.3.6 Smootness of solutions wit respect to multi-strip integral boundary conditions for nt
More informationarxiv: v1 [math.dg] 4 Feb 2015
CENTROID OF TRIANGLES ASSOCIATED WITH A CURVE arxiv:1502.01205v1 [mat.dg] 4 Feb 2015 Dong-Soo Kim and Dong Seo Kim Abstract. Arcimedes sowed tat te area between a parabola and any cord AB on te parabola
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 informationEquilibrium and Pareto Efficiency in an exchange economy
Microeconomic Teory -1- Equilibrium and efficiency Equilibrium and Pareto Efficiency in an excange economy 1. Efficient economies 2 2. Gains from excange 6 3. Edgewort-ox analysis 15 4. Properties of a
More informationBob Brown Math 251 Calculus 1 Chapter 3, Section 1 Completed 1 CCBC Dundalk
Bob Brown Mat 251 Calculus 1 Capter 3, Section 1 Completed 1 Te Tangent Line Problem Te idea of a tangent line first arises in geometry in te context of a circle. But before we jump into a discussion of
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 informationMA455 Manifolds Solutions 1 May 2008
MA455 Manifolds Solutions 1 May 2008 1. (i) Given real numbers a < b, find a diffeomorpism (a, b) R. Solution: For example first map (a, b) to (0, π/2) and ten map (0, π/2) diffeomorpically to R using
More informationAPPROXIMATION OF CRYSTALLINE DENDRITE GROWTH IN TWO SPACE DIMENSIONS. Introduction
Acta Mat. Univ. Comenianae Vol. LXVII, 1(1998), pp. 57 68 57 APPROXIMATION OF CRYSTALLINE DENDRITE GROWTH IN TWO SPACE DIMENSIONS A. SCHMIDT Abstract. Te pase transition between solid and liquid in an
More informationA CLASS OF EVEN DEGREE SPLINES OBTAINED THROUGH A MINIMUM CONDITION
STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume XLVIII, Number 3, September 2003 A CLASS OF EVEN DEGREE SPLINES OBTAINED THROUGH A MINIMUM CONDITION GH. MICULA, E. SANTI, AND M. G. CIMORONI Dedicated to
More informationHigher Derivatives. Differentiable Functions
Calculus 1 Lia Vas Higer Derivatives. Differentiable Functions Te second derivative. Te derivative itself can be considered as a function. Te instantaneous rate of cange of tis function is te second derivative.
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 informationAn Effective Integrator for the Landau-Lifshitz-Gilbert Equation
ASC Report No. 02/2012 An Effective Integrator for te Landau-Lifsitz-Gilbert Equation P. Goldenits, G. Hrkac, D. Praetorius, D. Suess Institute for Analysis and Scientific Computing Vienna University of
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 informationError estimates for a semi-implicit fully discrete finite element scheme for the mean curvature flow of graphs
Interfaces and Free Boundaries 2, 2000 34 359 Error estimates for a semi-implicit fully discrete finite element sceme for te mean curvature flow of graps KLAUS DECKELNICK Scool of Matematical Sciences,
More informationA Hybrid Mixed Discontinuous Galerkin Finite Element Method for Convection-Diffusion Problems
A Hybrid Mixed Discontinuous Galerkin Finite Element Metod for Convection-Diffusion Problems Herbert Egger Joacim Scöberl We propose and analyse a new finite element metod for convection diffusion problems
More informationControllability of a one-dimensional fractional heat equation: theoretical and numerical aspects
Controllability of a one-dimensional fractional eat equation: teoretical and numerical aspects Umberto Biccari, Víctor Hernández-Santamaría To cite tis version: Umberto Biccari, Víctor Hernández-Santamaría.
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 informationarxiv: v1 [math.na] 27 Jan 2014
L 2 -ERROR ESTIMATES FOR FINITE ELEMENT APPROXIMATIONS OF BOUNDARY FLUXES MATS G. LARSON AND ANDRÉ MASSING arxiv:1401.6994v1 [mat.na] 27 Jan 2014 Abstract. We prove quasi-optimal a priori error estimates
More informationDownloaded 06/08/17 to Redistribution subject to SIAM license or copyright; see
SIAM J. NUMER. ANAL. Vol. 55, No. 3, pp. 357 386 c 7 Society for Industrial and Applied Matematics Downloaded 6/8/7 to 67.96.45.. Redistribution subject to SIAM license or copyrigt; see ttp://www.siam.org/journals/ojsa.pp
More informationComplexity of Decoding Positive-Rate Reed-Solomon Codes
Complexity of Decoding Positive-Rate Reed-Solomon Codes Qi Ceng 1 and Daqing Wan 1 Scool of Computer Science Te University of Oklaoma Norman, OK73019 Email: qceng@cs.ou.edu Department of Matematics University
More informationERROR BOUNDS FOR FINITE-DIFFERENCE METHODS FOR RUDIN OSHER FATEMI IMAGE SMOOTHING
ERROR BOUNDS FOR FINITE-DIFFERENCE METHODS FOR RUDIN OSHER FATEMI IMAGE SMOOTHING JINGYUE WANG AND BRADLEY J. LUCIER Abstract. We bound te difference between te solution to te continuous Rudin Oser Fatemi
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 informationDecay of solutions of wave equations with memory
Proceedings of te 14t International Conference on Computational and Matematical Metods in Science and Engineering, CMMSE 14 3 7July, 14. Decay of solutions of wave equations wit memory J. A. Ferreira 1,
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 informationOverlapping domain decomposition methods for elliptic quasi-variational inequalities related to impulse control problem with mixed boundary conditions
Proc. Indian Acad. Sci. (Mat. Sci.) Vol. 121, No. 4, November 2011, pp. 481 493. c Indian Academy of Sciences Overlapping domain decomposition metods for elliptic quasi-variational inequalities related
More informationFINITE ELEMENT DUAL SINGULAR FUNCTION METHODS FOR HELMHOLTZ AND HEAT EQUATIONS
J. KSIAM Vol.22, No.2, 101 113, 2018 ttp://dx.doi.org/10.12941/jksiam.2018.22.101 FINITE ELEMENT DUAL SINGULAR FUNCTION METHODS FOR HELMHOLTZ AND HEAT EQUATIONS DEOK-KYU JANG AND JAE-HONG PYO DEPARTMENT
More informationarxiv: v1 [math.na] 17 Jul 2014
Div First-Order System LL* FOSLL* for Second-Order Elliptic Partial Differential Equations Ziqiang Cai Rob Falgout Sun Zang arxiv:1407.4558v1 [mat.na] 17 Jul 2014 February 13, 2018 Abstract. Te first-order
More informationLecture 10: Carnot theorem
ecture 0: Carnot teorem Feb 7, 005 Equivalence of Kelvin and Clausius formulations ast time we learned tat te Second aw can be formulated in two ways. e Kelvin formulation: No process is possible wose
More informationSemigroups of Operators
Lecture 11 Semigroups of Operators In tis Lecture we gater a few notions on one-parameter semigroups of linear operators, confining to te essential tools tat are needed in te sequel. As usual, X is a real
More information