Geometric Multigrid Methods


 Samuel Greene
 1 years ago
 Views:
Transcription
1 Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010
2 Ideas Outline SetUp Multigrid Algorithms Smoothing and Approximation Convergence of WCycle Convergence of VCycle Multiplicative Theory Additive Theory Other Algorithms
3 General References 1 W. Hacbusch Multigrid Methods and Applications, SpringerVerlag, J.H. Bramble Multigrid Methods, Longman Scientific & Technical, J.H. Bramble and X. Zhang The Analysis of Multigrid Methods, in Handboo of Numerical Analysis VII, NorthHolland, U. Trottenberg, C. Oosterlee and A. Schüller Multigrid, Academic Press, 2001.
4 Let A be a SPD matrix. Suppose we solve Ideas (L) Ax = b by an iterative method (Jacobi, GaussSeidel, etc.).
5 Let A be a SPD matrix. Suppose we solve Ideas (L) Ax = b by an iterative method (Jacobi, GaussSeidel, etc.). After m iterations (starting with some initial guess), we obtain an approximate solution x m. Then the error e m = x x m satisfies the residual equation (RE) Ae m = r m where r m = b Ax m is the (computable) residual.
6 Let A be a SPD matrix. Suppose we solve Ideas (L) Ax = b by an iterative method (Jacobi, GaussSeidel, etc.). After m iterations (starting with some initial guess), we obtain an approximate solution x m. Then the error e m = x x m satisfies the residual equation (RE) Ae m = r m where r m = b Ax m is the (computable) residual. If we can solve (RE) exactly, then we can recover the exact solution of (L) by the relation (C) x = x m + (x x m ) = x m + e m
7 Ideas In reality, we will only solve (RE) approximately to obtain an approximation e m of e m. Then, hopefully, the correction (C ) x = x m + e m will give a better approximation of x.
8 Ideas In reality, we will only solve (RE) approximately to obtain an approximation e m of e m. Then, hopefully, the correction (C ) x = x m + e m will give a better approximation of x. In the context of finite element equations (FE h ) A h x h = f h there is a natural way to carry out this idea.
9 Ideas In reality, we will only solve (RE) approximately to obtain an approximation e m of e m. Then, hopefully, the correction (C ) x = x m + e m will give a better approximation of x. In the context of finite element equations (FE h ) A h x h = f h there is a natural way to carry out this idea. Smoothing Step Apply m iterations of a classical iterative method to obtain an approximation x m,h of x h and the corresponding residual equation e m,h = x h x m,h, (RE h ) r m,h = f h A hx m,h A h e m,h = r m,h
10 Ideas Correction Step Instead of solving (RE h ), we solve a related equation on a coarser grid T 2h (assuming that T h is obtained from T 2h by uniform refinement). (RE 2h ) A 2h e 2h = r 2h r 2h = projection of r h,m onto the coarse grid space A 2h = stiffness matrix for the coarse grid
11 Ideas Correction Step Instead of solving (RE h ), we solve a related equation on a coarser grid T 2h (assuming that T h is obtained from T 2h by uniform refinement). (RE 2h ) A 2h e 2h = r 2h r 2h = projection of r h,m onto the coarse grid space A 2h = stiffness matrix for the coarse grid We then use a transfer operator I h 2h to move e 2h to the fine grid T h and obtain the final output x m+1,h = x m,h + I h 2h e 2h This is nown as the twogrid algorithm.
12 Ideas Smoothing steps will damp out the highly oscillatory part of the error so that we can capture e h accurately on the coarser grid by the correction step. Together they produce a good approximate solution of (FE h ).
13 Ideas Smoothing steps will damp out the highly oscillatory part of the error so that we can capture e h accurately on the coarser grid by the correction step. Together they produce a good approximate solution of (FE h ). Moreover, it is cheaper to solve the coarse grid residual equation (RE 2h ).
14 Ideas Smoothing steps will damp out the highly oscillatory part of the error so that we can capture e h accurately on the coarser grid by the correction step. Together they produce a good approximate solution of (FE h ). Moreover, it is cheaper to solve the coarse grid residual equation (RE 2h ). Of course we do not have to solve (RE 2h ) exactly. Instead we can apply the same idea recursively to (RE 2h ). The resulting algorithm is a multigrid algorithm.
15 SetUp Model Problem Find u H0 1 (Ω) such that a(u, v) = fv dx v H0(Ω) 1 Ω a(w, v) = w v dx Ω
16 SetUp Model Problem Find u H0 1 (Ω) such that a(u, v) = fv dx v H0(Ω) 1 Ω a(w, v) = Ω w v dx Let T 0 be an initial triangulation of Ω and T ( 1) be obtained from T 1 by a refinement process. V ( 0) is the corresponding finite element space.
17 th Level Finite Element Problem a (u, v) = fv dx Ω SetUp Find u V such that v V The bilinear form a (, ) is an approximation of the bilinear form a(, ) for the continuous problem. We can tae a (, ) to be a(, ) for conforming finite element methods. But in general a (, ) is a modification of a(, ) according to the choice of the finite element method.
18 th Level Finite Element Problem a (u, v) = fv dx Ω SetUp Find u V such that v V It can be written as A u = φ where A : V V and φ V are defined by A w, v = a (w, v) v, w V φ, v = fv dx v V Ω
19 th Level Finite Element Problem a (u, v) = fv dx Ω SetUp Find u V such that v V It can be written as A u = φ Two ey ingredients in defining multigrid algorithms. a good smoother for the equation A z = γ intergrid transfer operators to move functions between consecutive levels
20 Smoothing step for A z = γ (z V, γ V ) SetUp (S) z new = z old + B 1 (γ A z old ) where B : V V is SPD, ρ(b 1 A ) 1 and B v, v h 2 v 2 L 2 (Ω) v V
21 Smoothing step for A z = γ (z V, γ V ) SetUp (S) z new = z old + B 1 (γ A z old ) where B : V V is SPD, Example ρ(b 1 A ) 1 and B v, v h 2 v 2 L 2 (Ω) v V (Richardson relaxation scheme) V ( H 1 0 (Ω)) = P 1 Lagrange finite element space B w, v = λ p V w(p)v(p) V = the set of interior vertices of T λ = a (constant) damping factor
22 Intergrid Transfer Operators SetUp The coarsetofine operator I 1 is a linear operator from V 1 to V. The finetocoarse operator I 1 : V V 1 is the transpose of I 1, i.e., I 1 α, v = α, I 1 v α V, v V 1
23 Intergrid Transfer Operators SetUp The coarsetofine operator I 1 is a linear operator from V 1 to V. The finetocoarse operator I 1 : V V 1 is the transpose of I 1, i.e., Example I 1 α, v = α, I 1 v α V, v V 1 V ( H 1 0 (Ω)) = P 1 Lagrange finite element space V 0 V 1 I 1 = natural injection
24 Multigrid Algorithms VCycle Algorithm for A z = γ with initial guess z 0 Output = MG V (, γ, z 0, m)
25 Multigrid Algorithms VCycle Algorithm for A z = γ with initial guess z 0 Output = MG V (, γ, z 0, m) For = 0, we solve A 0 z = γ exactly to obtain MG V (0, γ, z 0, m) = A 1 0 γ
26 Multigrid Algorithms VCycle Algorithm for A z = γ with initial guess z 0 Output = MG V (, γ, z 0, m) For = 0, we solve A 0 z = γ exactly to obtain MG V (0, γ, z 0, m) = A 1 0 γ For 1, we compute the multigrid output recursively in 3 steps.
27 Multigrid Algorithms VCycle Algorithm for A z = γ with initial guess z 0 Output = MG V (, γ, z 0, m) For = 0, we solve A 0 z = γ exactly to obtain MG V (0, γ, z 0, m) = A 1 0 γ For 1, we compute the multigrid output recursively in 3 steps. Presmoothing Step For 1 m, compute z = z 1 + B 1 (γ A z 1 )
28 Multigrid Algorithms Correction Step Transfer the residual γ A z m V to the coarse grid using I 1 and solve the coarsegrid residual equation A 1 e 1 = I 1 (γ A z m ) by applying the ( 1) st level algorithm using 0 as the initial guess, i.e., we compute q = MG V ( 1, I 1 (γ A z m ), 0, m) as an approximation to e 1. Then we mae the correction z m+1 = z m + I 1 q
29 Multigrid Algorithms Correction Step Transfer the residual γ A z m V to the coarse grid using I 1 and solve the coarsegrid residual equation A 1 e 1 = I 1 (γ A z m ) by applying the ( 1) st level algorithm using 0 as the initial guess, i.e., we compute q = MG V ( 1, I 1 (γ A z m ), 0, m) as an approximation to e 1. Then we mae the correction z m+1 = z m + I 1 q Postsmoothing Step For m + 2 2m + 1, compute z = z 1 + B 1 (γ A z 1 )
30 Final Output Multigrid Algorithms MG V (, γ, z 0, m) = z 2m+1
31 Multigrid Algorithms Multigrid Algorithms for A z = ψ (z V, ψ V ) C 0 Interior Penalty Methods for Fourth Order Problems Final Output MG V (, γ, z 0, m) = z Vcycle Algorithm p = 1 2m+1 = 3 replacements = 2 = 1 = 0 scheduling Scheduling diagram Diagram for the of the Vcycle VCycle algorithm Algorithm Susanne C. Brenner AMIC 2010/6th EASIAM Conference
32 Multigrid Algorithms WCycle Algorithm for A z = γ with initial guess z 0 Output = MG W (, γ, z 0, m)
33 Multigrid Algorithms WCycle Algorithm for A z = γ with initial guess z 0 Output = MG W (, γ, z 0, m) Correction Step (apply the coarse grid algorithm twice) q = MG W ( 1, I 1 (γ A z m ), 0, m) q = MG W ( 1, I 1 (γ A z m ), q, m)
34 Multigrid Algorithms WCycle Algorithm for A z = γ with initial guess z 0 Output = MG W (, γ, z 0, m) C 0 Interior Penalty Methods for Fourth Order Problems Correction Step Multigrid Algorithms (apply the coarse grid algorithm twice) Multigrid Algorithms for A z = ψ (z V, ψ V ) q = MG W ( 1, I 1 (γ A z m ), 0, m) Wcycle Algorithm p = 2 q = MG W ( 1, I 1 (γ A z m ), q, m) = 3 ents = 2 = 1 = 0 scheduling diagram for the Wcycle algorithm Scheduling Diagram of the WCycle Algorithm
35 Multigrid Algorithms Operation Count n = dimv (n 4 ) W = number of flops for the th level multigrid algorithm m = number of smoothing steps p = 1 or 2
36 Operation Count n = dimv (n 4 ) Multigrid Algorithms W = number of flops for the th level multigrid algorithm m = number of smoothing steps p = 1 or 2 W C mn + pw 1 C mn + p(c mn 1 ) + p 2 (C mn 2 ) + p 1 (C mn 1 ) + p W 0 C m4 + pc m4 1 + p 2 C m4 2 + p 1 (C m4) + p W 0 = C m4 ( 1 + p 4 + p p 1 ) p W 0 C m4 1 p/4 + p W 0 C 4 + p W 0 C n
37 Error Propagation Operators Multigrid Algorithms Let E : V V be the error propagation operator that maps the initial error z z 0 to the final error z MG V (, γ, z 0, m). We want to develop a recursive relation between E and E 1.
38 Error Propagation Operators Multigrid Algorithms Let E : V V be the error propagation operator that maps the initial error z z 0 to the final error z MG V (, γ, z 0, m). We want to develop a recursive relation between E and E 1. It follows from (S) and A z = γ that z z new = z z old B 1 (γ A z old ) = (Id B 1 A )(z z old ) where Id is the identity operator on V.
39 Error Propagation Operators Multigrid Algorithms Let E : V V be the error propagation operator that maps the initial error z z 0 to the final error z MG V (, γ, z 0, m). We want to develop a recursive relation between E and E 1. It follows from (S) and A z = γ that z z new = z z old B 1 (γ A z old ) = (Id B 1 A )(z z old ) where Id is the identity operator on V. Therefore the effect of one smoothing step is measured by the operator R = Id B 1 A
40 Multigrid Algorithms Let P 1 : V V 1 be the transpose of the coarsetofine operator I 1 with respect to the variational forms, i.e. a 1 (P 1 v, w) = a (v, I 1 w) v V, w V 1
41 Multigrid Algorithms Let P 1 : V V 1 be the transpose of the coarsetofine operator I 1 with respect to the variational forms, i.e. a 1 (P 1 v, w) = a (v, I 1 w) v V, w V 1 Recall the coarse grid residual equation A 1 e 1 = I 1 (γ A z m )
42 Multigrid Algorithms Let P 1 : V V 1 be the transpose of the coarsetofine operator I 1 with respect to the variational forms, i.e. a 1 (P 1 v, w) = a (v, I 1 w) v V, w V 1 Recall the coarse grid residual equation A 1 e 1 = I 1 (γ A z m ) a 1 (e 1, v) = A 1 e 1, v (for any v V ) = I 1 (γ A z m ), v = (γ A z m ), I 1 v = A (z z m ), I 1 v = a (z z m, I 1 v) = a 1(P 1 (z z m ), v)
43 Multigrid Algorithms Let P 1 : V V 1 be the transpose of the coarsetofine operator I 1 with respect to the variational forms, i.e. a 1 (P 1 v, w) = a (v, I 1 w) v V, w V 1 Recall the coarse grid residual equation A 1 e 1 = I 1 (γ A z m ) a 1 (e 1, v) = A 1 e 1, v (for any v V ) = I 1 (γ A z m ), v = (γ A z m ), I 1 v = A (z z m ), I 1 v = a (z z m, I 1 v) = a 1(P 1 (z z m ), v)
44 Multigrid Algorithms e 1 = P 1 (z z m )
45 Multigrid Algorithms e 1 = P 1 (z z m ) Recall q = MG V ( 1, I 1 (γ A z m ), 0, m) is the approximate solution of the coarse grid residual equation obtained by using the ( 1) st level Vcycle algorithm with initial guess 0.
46 Multigrid Algorithms e 1 = P 1 (z z m ) Recall q = MG V ( 1, I 1 (γ A z m ), 0, m) is the approximate solution of the coarse grid residual equation obtained by using the ( 1) st level Vcycle algorithm with initial guess 0. e 1 q = E 1 (e 1 0) = q = (Id 1 E 1 )e 1
47 Multigrid Algorithms e 1 = P 1 (z z m ) Recall q = MG V ( 1, I 1 (γ A z m ), 0, m) is the approximate solution of the coarse grid residual equation obtained by using the ( 1) st level Vcycle algorithm with initial guess 0. e 1 q = E 1 (e 1 0) = q = (Id 1 E 1 )e 1 z z m+1 = z (z m + I 1 q) = z z m I 1 (Id 1 E 1 )e 1 = z z m I 1 (Id 1 E 1 )P 1 (z z m ) = (Id I 1 P 1 + I 1 E 1P 1 )(z z m ) = (Id I 1 P 1 + I 1 E 1P 1 )R m (z z 0)
48 Multigrid Algorithms z MG V (, γ, z 0, m) = z z 2m+1 = R m (z z m+1) = R m (Id I 1 P 1 + I 1 E 1P 1 )R m (z z 0)
49 Multigrid Algorithms z MG V (, γ, z 0, m) = z z 2m+1 = R m (z z m+1) = R m (Id I 1 P 1 + I 1 E 1P 1 )R m (z z 0)
50 Multigrid Algorithms z MG V (, γ, z 0, m) = z z 2m+1 = R m (z z m+1) = R m (Id I 1 P 1 Recursive Relation for VCycle E = R m (Id I 1 P 1 E 0 = 0 + I 1 E 1P 1 )R m (z z 0) + I 1 E 1P 1 )R m
51 Multigrid Algorithms z MG V (, γ, z 0, m) = z z 2m+1 = R m (z z m+1) = R m (Id I 1 P 1 Recursive Relation for VCycle E = R m (Id I 1 P 1 E 0 = 0 Recursive Relation for WCycle E = R m (Id I 1 P 1 E 0 = 0 + I 1 E 1P 1 )R m (z z 0) + I 1 E 1P 1 )R m + I 1 E2 1P 1 )R m
52 Smoothing and Approximation It is clear from the recursive relation E = R m (Id I 1 P 1 that we need to understand the operators + I 1 Ep 1 P 1 )R m R m and Id I 1 P 1
53 Smoothing and Approximation It is clear from the recursive relation E = R m (Id I 1 P 1 that we need to understand the operators + I 1 Ep 1 P 1 )R m R m and Id I 1 P 1 The effect of R m is measured by the smoothing property while the effect of Id I 1 P 1 is measured by the approximation property. These properties involve certain mesh dependent norms.
54 Smoothing and Approximation It is clear from the recursive relation E = R m (Id I 1 P 1 that we need to understand the operators + I 1 Ep 1 P 1 )R m R m and Id I 1 P 1 The effect of R m is measured by the smoothing property while the effect of Id I 1 P 1 is measured by the approximation property. These properties involve certain mesh dependent norms. Let the inner product (, ) on V be defined by (v, w) = h 2 B v, w Then the operator B 1 A : V V is SPD with respect to (, ).
55 MeshDependent Norms v t, = h t Smoothing and Approximation ((B 1 A ) t v, v) v V, t R
56 MeshDependent Norms In particular v t, = h t v 0, = (v, v) = v 1, = h 1 = Smoothing and Approximation ((B 1 B (B 1 ((B 1 A ) t v, v) v V, t R h 2 B v, v v L2 (Ω) A )v, v) A )v, v = A v, v = a (v, v) = v a
57 MeshDependent Norms In particular v t, = h t v 0, = (v, v) = v 1, = h 1 = Smoothing and Approximation ((B 1 B (B 1 ((B 1 A ) t v, v) v V, t R h 2 B v, v v L2 (Ω) A )v, v) A )v, v = A v, v = a (v, v) = v a ρ(b 1 A ) 1 = R v t, v t,
58 MeshDependent Norms In particular v t, = h t v 0, = (v, v) = v 1, = h 1 = Smoothing and Approximation ((B 1 B (B 1 ((B 1 A ) t v, v) v V, t R h 2 B v, v v L2 (Ω) A )v, v) Generalized CauchySchwarz Inequality A )v, v = A v, v = a (v, v) = v a a (v, w) v 1+t, v 1 t, t R
59 Duality Smoothing and Approximation v 1+t, = a (v, w) max w V \{0} w 1 t, v V, t R
60 Duality Smoothing and Approximation v 1+t, = a (v, w) max w V \{0} w 1 t, v V, t R Smoothing Property For 0 s t 2 and, m = 1, 2,..., R m v s, Cm (t s) 2 h s t v t, v V
61 Duality Smoothing and Approximation v 1+t, = a (v, w) max w V \{0} w 1 t, v V, t R Smoothing Property For 0 s t 2 and, m = 1, 2,..., The proof is based on R m v s, Cm (t s) 2 h s t v t, v V Spectral Theorem ρ(b 1 A ) 1 calculus
62 Approximation Property Smoothing and Approximation There exists α ( 1 2, 1] such that (Id I 1 P 1 )v 1 α, Ch 2α v 1+α, v V, = 1, 2,... (The index α is related to elliptic regularity.)
63 Approximation Property Smoothing and Approximation There exists α ( 1 2, 1] such that (Id I 1 P 1 )v 1 α, Ch 2α v 1+α, v V, = 1, 2,... (The index α is related to elliptic regularity.) The proof is based on elliptic regularity duality arguments relations between the mesh dependent norms s, and the Sobolev norms H s (Ω)
64 Smoothing and Approximation Example (convex Ω) V ( H0 1(Ω)) = Lagrange P 1 finite element space a (w, v) = w v dx = a(w, v) Ω V 0 V 1, I 1 : V 1 V is the natural injection B w, v = λ p V w(p)v(p) v V
65 Smoothing and Approximation Example (convex Ω) V ( H0 1(Ω)) = Lagrange P 1 finite element space a (w, v) = w v dx = a(w, v) Ω V 0 V 1, I 1 : V 1 V is the natural injection B w, v = λ p V w(p)v(p) v V v 0, = ( h 2 B ) 1/2 v, v = λh 2 v 2 (p) v L2 (Ω) v V p V v 1, = v a = v H 1 (Ω) v V
66 The operator P 1 Smoothing and Approximation : V V 1 satisfies a(p 1 v, w) = a(v, I 1 w) = a(v, w) v V, w V 1 a((id I 1 P 1 )v, w) = a(v P 1 v, w) = 0 v V, w V 1
67 The operator P 1 Smoothing and Approximation : V V 1 satisfies a(p 1 v, w) = a(v, I 1 w) = a(v, w) v V, w V 1 a((id I 1 P 1 )v, w) = a(v P 1 v, w) = 0 v V, w V 1 Duality Argument Let v V be arbitrary and ζ H0 1 (Ω) satisfy a(w, ζ) = w(id I 1 P 1 )v dx w H0(Ω) 1 Ω i.e., ζ is the solution of the boundary value problem ζ = (Id I 1 P 1 )v in Ω and ζ = 0 on Ω
68 Since Ω is convex, ζ H 2 (Ω) and Smoothing and Approximation ζ H 2 (Ω) C Ω (Id I 1 P 1 )v L2 (Ω)
69 Since Ω is convex, ζ H 2 (Ω) and Smoothing and Approximation ζ H 2 (Ω) C Ω (Id I 1 P 1 )v L2 (Ω) (Id I 1 P 1 )v 2 L 2 (Ω) = a((id I 1 P 1 )v, ζ) = a((id I 1 P 1 )v, ζ Π 1 ζ) (Id I 1 P 1 )v H 1 (Ω) ζ Π 1 ζ H 1 (Ω) (Id I 1 P 1 )v H 1 (Ω)(Ch ζ H 2 (Ω)) (Id I 1 P 1 )v H 1 (Ω)(Ch (Id I 1 P 1 )v L2 (Ω))
70 Since Ω is convex, ζ H 2 (Ω) and Smoothing and Approximation ζ H 2 (Ω) C Ω (Id I 1 P 1 )v L2 (Ω) (Id I 1 P 1 )v 2 L 2 (Ω) = a((id I 1 P 1 )v, ζ) = a((id I 1 P 1 )v, ζ Π 1 ζ) (Id I 1 P 1 )v H 1 (Ω) ζ Π 1 ζ H 1 (Ω) (Id I 1 P 1 )v H 1 (Ω)(Ch ζ H 2 (Ω)) (Id I 1 P 1 )v H 1 (Ω)(Ch (Id I 1 P 1 )v L2 (Ω)) (Id I 1 P 1 )v L2 (Ω) Ch (Id I 1 P 1 )v H 1 (Ω)
71 Since Ω is convex, ζ H 2 (Ω) and Smoothing and Approximation ζ H 2 (Ω) C Ω (Id I 1 P 1 )v L2 (Ω) (Id I 1 P 1 )v 2 L 2 (Ω) = a((id I 1 P 1 )v, ζ) = a((id I 1 P 1 )v, ζ Π 1 ζ) (Id I 1 P 1 )v H 1 (Ω) ζ Π 1 ζ H 1 (Ω) (Id I 1 P 1 )v H 1 (Ω)(Ch ζ H 2 (Ω)) (Id I 1 P 1 )v H 1 (Ω)(Ch (Id I 1 P 1 )v L2 (Ω)) (Id I 1 P 1 )v L2 (Ω) Ch (Id I 1 P 1 )v H 1 (Ω) (Id I 1 P 1 )v 0, (Id I 1 P 1 )v L2 (Ω) Ch (Id I 1 P 1 )v H 1 (Ω) = Ch (Id I 1 P 1 )v 1,
72 In particular Smoothing and Approximation (Id I 1 P 1 )v 0, Ch (Id I 1 P 1 )v 1, Ch v 1,
73 Smoothing and Approximation In particular (Id I 1 P 1 )v 0, Ch (Id I 1 P 1 )v 1, Ch v 1, Duality (Id I 1 P 1 )v 1, = max w V \{0} = max w V \{0} a(v, (Id I 1 P 1 )w) w 1, a(id I 1 P 1 )v, w) w 1, v 2, (Id I 1 max P 1 )w 0, Ch v 2, w V \{0} w 1,
74 Smoothing and Approximation In particular (Id I 1 P 1 )v 0, Ch (Id I 1 P 1 )v 1, Ch v 1, Duality (Id I 1 P 1 )v 1, = max w V \{0} = max w V \{0} a(v, (Id I 1 P 1 )w) w 1, a(id I 1 P 1 )v, w) w 1, v 2, (Id I 1 max P 1 )w 0, Ch v 2, w V \{0} w 1, Approximation Property with α = 1 (Id I 1 P 1 )v 0, Ch 2 v 2, v V
75 TwoGrid Analysis E TG WCycle Convergence = R m (Id I 1 P 1 )R m
76 TwoGrid Analysis E TG WCycle Convergence = R m (Id I 1 P 1 )R m E TG v 1, = R m (Id I 1 P 1 )R m v 1, Cm α 2 h α Cm α 2 h α Cm α 2 h α (Id I 1 P 1 )R m v 1 α, h 2α R m v 1+α, h 2α m α 2 h α v 1, = C m α v 1,
77 TwoGrid Analysis E TG WCycle Convergence = R m (Id I 1 P 1 )R m E TG v 1, = R m (Id I 1 P 1 )R m v 1, Cm α 2 h α Cm α 2 h α Cm α 2 h α (Id I 1 P 1 )R m v 1 α, h 2α R m v 1+α, h 2α m α 2 h α v 1, = C m α v 1, The convergence of the Wcycle algorithm can then be established by a perturbation argument under the condition I 1 v 1, C v 1, 1 v V 1, = 1, 2,... which implies by duality P 1 v 1, 1 C v 1, v V, = 1, 2,...
78 Suppose for some δ > 0 we have WCycle Convergence E 1 v 1, 1 δ v 1, 1 v V 1
79 Suppose for some δ > 0 we have WCycle Convergence E 1 v 1, 1 δ v 1, 1 v V 1 E v 1, = R m (Id I 1 P 1 + I 1 E2 1P 1 )R m v 1, R m (Id I 1 P 1 )v 1, + R m I 1 E2 1P 1 R m v 1, C m α v 1, + C E 1P 2 1 R m v 1, C m α v 1, + C δ 2 P 1 R m v 1, C m α v 1, + C 2 δ2 v 1, = (C m α + C 2 δ2 ) v 1,
80 Suppose for some δ > 0 we have WCycle Convergence E 1 v 1, 1 δ v 1, 1 v V 1 E v 1, = R m (Id I 1 P 1 + I 1 E2 1P 1 )R m v 1, R m (Id I 1 P 1 )v 1, + R m I 1 E2 1P 1 R m v 1, C m α v 1, + C E 1P 2 1 R m v 1, C m α v 1, + C δ 2 P 1 R m v 1, C m α v 1, + C 2 δ2 v 1, = (C m α + C 2 δ2 ) v 1, E v 1, δ v 1, v V provided ( ) (C m α + C 2 δ2 ) = δ
81 WCycle Convergence Solving ( ) we find ( ) δ = 1 1 4C 2 C m α /(2C 2 ) < 1 provided ( ) 4C 2 C m α < 1
82 WCycle Convergence Solving ( ) we find ( ) δ = 1 1 4C 2 C m α /(2C 2 ) < 1 provided ( ) 4C 2 C m α < 1 Therefore, by mathematical induction E v 1, δ v 1, for 1 and the Wcycle algorithm is a contraction under the condition ( ). Moreover δ C m α as m
83 WCycle Convergence Theorem The Wcycle algorithm is a contraction with contraction number independent of the grid levels, provided the number m of smoothing steps is greater than a number m that is also independent of the grid levels.
84 WCycle Convergence Theorem The Wcycle algorithm is a contraction with contraction number independent of the grid levels, provided the number m of smoothing steps is greater than a number m that is also independent of the grid levels. The convergence analysis of Wcycle is based on the wor of Ban and Dupont (originally for conforming methods). It is a robust approach that wors for problems without full elliptic regularity (α < 1) and also for nonconforming methods.
85 WCycle Convergence Theorem The Wcycle algorithm is a contraction with contraction number independent of the grid levels, provided the number m of smoothing steps is greater than a number m that is also independent of the grid levels. The convergence analysis of Wcycle is based on the wor of Ban and Dupont (originally for conforming methods). It is a robust approach that wors for problems without full elliptic regularity (α < 1) and also for nonconforming methods. References 1 R.E. Ban and T.F. Dupont An optimal order process for solving finite element equations, Math. Comp., B., Convergence of nonconforming multigrid methods without full elliptic regularity, Math. Comp., 1999.
86 WCycle Convergence Theorem The Wcycle algorithm is a contraction with contraction number independent of the grid levels, provided the number m of smoothing steps is greater than a number m that is also independent of the grid levels. The convergence analysis of Wcycle is based on the wor of Ban and Dupont (originally for conforming methods). It is a robust approach that wors for problems without full elliptic regularity (α < 1) and also for nonconforming methods. Remar For conforming finite element methods with nested finite element spaces, the Wcycle algorithm is a contraction for m = 1. This result can be deduced from the corresponding result for the Vcycle algorithm.
87 Model Problem VCycle Convergence Poisson problem on a polygonal domain discretized by a conforming Lagrange finite element method.
88 Model Problem VCycle Convergence Poisson problem on a polygonal domain discretized by a conforming Lagrange finite element method. With Full Elliptic Regularity (Ω convex) u H 2 (Ω) C Ω f L2 (Ω) 1983 BraessHacbusch z MG V (, γ, z 0, m) a C C + m z z 0 a for m, 1, where C is independent of m and. In particular, the Vcycle is a contraction with only one smoothing step.
89 VCycle Convergence Without Full Elliptic Regularity (Ω nonconvex) u H 1+α (Ω) C Ω f L2 (Ω) for 1 2 < α < 1
90 Without Full Elliptic Regularity for 1 2 < α < BramblePascia VCycle Convergence (Ω nonconvex) u H 1+α (Ω) C Ω f L2 (Ω) 1988 DecerMandelParter ( 1 ) z MG V (, γ, z 0, 1) a 1 C (1 α)/α z z 0 a for 1
91 Without Full Elliptic Regularity for 1 2 < α < BramblePascia VCycle Convergence (Ω nonconvex) u H 1+α (Ω) C Ω f L2 (Ω) 1988 DecerMandelParter ( 1 ) z MG V (, γ, z 0, 1) a 1 C (1 α)/α z z 0 a for BramblePasciaWangXu (no regularity assumption) z MG V (, γ, z 0, 1) a ( 1 1 ) z z 0 a for 1 C
92 1992 Zhang, Xu 1993 BramblePascia There exists δ (0, 1) such that VCycle Convergence z MG V (, γ, z 0, m) a δ z z 0 a for m, 1. In particular, the Vcycle is a contraction with one smoothing step.
93 1992 Zhang, Xu 1993 BramblePascia There exists δ (0, 1) such that VCycle Convergence z MG V (, γ, z 0, m) a δ z z 0 a for m, 1. In particular, the Vcycle is a contraction with one smoothing step. BraessHacbusch z MG V (, γ, z 0, m) a C C + m z z 0 a for m, 1, where C is independent of m and. In particular, the Vcycle is a contraction with only one smoothing step.
94 2002 B. z MG V (, γ, z 0, m) a VCycle Convergence C C + m α z z 0 a for m, 1, where C is independent of m and.
95 2002 B. z MG V (, γ, z 0, m) a VCycle Convergence C C + m α z z 0 a for m, 1, where C is independent of m and. This is a complete generalization of the BraessHacbusch result: z MG V (, γ, z 0, m) a C C + m z z 0 a for m, 1, where C is independent of m and. In particular, the Vcycle is a contraction with only one smoothing step.
96 Model Problem Multiplicative Theory P 1 Lagrange finite element method for the Poisson problem. T is generated from T 0 by uniform refinement. V ( H 1 0 (Ω)) is the P 1 Lagrange finite element space associated with T. V 0 V 1 I 1 : V 1 V is the natural injection. a (w, v) = w v dx = a(w, v) Ω
97 Recursive Relation Multiplicative Theory E = R m (Id I 1 P 1 E 0 = 0 + I 1 E 1P 1 )R m
98 Recursive Relation Multiplicative Theory E = R m (Id I 1 P 1 E 0 = 0 + I 1 E 1P 1 )R m Notation (j l) I l j : V j V l is the natural injection P j l : V l V j is the transpose of I l j with respect to the variational form, i.e., a(p j l v, w) = a(v, Il j w) v V l, w V j I j j = Id j = P j j
99 Multiplicative Theory Properties of I l j and P j l For j i l I l j = I l i I i j P j l = P j i P i l I i j = P i l Il j (in particular Id j = I j j = Pj l Il j ) P j i = P j l Il i (I l j Pj l )2 = I l j Pj l (Id l I l j P j l )2 = (Id l I l j P j l )
100 Multiplicative Theory Key Observation [ (Id I 1 P 1 ) + I 1 E 1P 1 ] = (Id I 1 P 1 ) + I 1 [ R m 1 (Id 1 I 1 2 P I 1 2 E 2P 2 ] 1 )Rm 1 P 1
101 Key Observation [ (Id I 1 P 1 ) + I 1 E 1P 1 ] = (Id I 1 P 1 ) + I 1 [ R m 1 (Id 1 I 1 2 P 2 = [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I 2 P 2 [(Id I 1 P 1 Multiplicative Theory 1 + I 1 2 E 2P 2 1 )Rm 1 + I 2 E 2P 2 ) ] ) + I 1 Rm 1 P 1 ] ] P 1
102 Key Observation [ (Id I 1 P 1 ) + I 1 E 1P 1 ] = (Id I 1 P 1 ) + I 1 [ R m 1 (Id 1 I 1 2 P 2 = [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I 2 P 2 Multiplicative Theory 1 + I 1 2 E 2P 2 1 )Rm 1 + I 2 E 2P 2 ) ] [(Id I 1 P 1 ) + I 1 Rm 1 P 1 = [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I 2 P 2 ) + I 2 Rm 2 P 2 ] [(Id I 3 P 3 ) + I 3 E 3P 3 ] [(Id I 2 P 2 ) + I 2 Rm 2 P 2 ] [(Id I 1 P 1 ) + I 1 Rm 1 P 1 ] ] ] P 1
103 Multiplicative Theory E = R m [ (Id I 1 P 1 ) + I 1 E 1P 1 ] R m = R m [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I1 P 1 ) + I1 ] Rm 1 P1 (Id I0 P 0 ) [ (Id I1 P 1 ) + I1 Rm 1 P 1 ] [(Id I 1 P 1 ) + I 1 ] Rm 1 P 1 R m
104 Multiplicative Theory E = R m [ (Id I 1 P 1 ) + I 1 E 1P 1 ] R m = R m [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I1 P 1 ) + I1 ] Rm 1 P1 (Id I0 P 0 ) [ (Id I1 P 1 ) + I1 Rm 1 P 1 ] [(Id I 1 P 1 ) + I 1 ] Rm 1 P 1 R m Notation For 1 j T j = def I j (Id j R m j )P j
105 Multiplicative Theory E = R m [ (Id I 1 P 1 ) + I 1 E 1P 1 ] R m = R m [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I1 P 1 ) + I1 ] Rm 1 P1 (Id I0 P 0 ) [ (Id I1 P 1 ) + I1 Rm 1 P 1 ] [(Id I 1 P 1 ) + I 1 ] Rm 1 P 1 R m Notation For 1 j In particular T j = def I j (Id j R m j )P j T = I (Id R m )P = Id R m = Rm = Id T
106 Multiplicative Theory E = R m [ (Id I 1 P 1 ) + I 1 E 1P 1 ] R m = R m [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I1 P 1 ) + I1 ] Rm 1 P1 (Id I0 P 0 ) [ (Id I1 P 1 ) + I1 Rm 1 P 1 ] [(Id I 1 P 1 ) + I 1 ] Rm 1 P 1 R m Notation For 1 j In particular T j = def I j (Id j R m j )P j T = I (Id R m )P = Id R m = Rm = Id T (Id I j P j ) + I j R m j P j = Id I j (Id j R m j )P j = Id T j
107 Multiplicative Theory E = R m [ (Id I 1 P 1 ) + I 1 E 1P 1 ] R m = R m [ (Id I 1 P 1 ) + I 1 Rm 1 P 1 ] [(Id I1 P 1 ) + I1 ] Rm 1 P1 (Id I0 P 0 ) [ (Id I1 P 1 ) + I1 Rm 1 P 1 ] [(Id I 1 P 1 ) + I 1 ] Rm 1 P 1 R m Notation For 1 j In particular T j = def I j (Id j R m j )P j T = I (Id R m )P = Id R m = Rm = Id T (Id I j P j ) + I j R m j P j = Id I j (Id j R m j )P j = Id T j T 0 = def I 0 P 0 = Id I 0 P 0 = Id T 0
108 Multiplicative Theory Multiplicative Expression for E E = (Id T )(Id T 1 )... (Id T 1 ) (Id T 0 )(Id T 1 )... (Id T 1 )(Id T )
109 Multiplicative Expression for E Multiplicative Theory E = (Id T )(Id T 1 )... (Id T 1 ) (Id T 0 )(Id T 1 )... (Id T 1 )(Id T ) Strengthened CauchySchwarz Inequality For 0 j a(v j, v ) C2 ( j)/2 v j H 1 (Ω)h 1 v L2 (Ω) v j V j, v V
110 Multiplicative Expression for E Multiplicative Theory E = (Id T )(Id T 1 )... (Id T 1 ) (Id T 0 )(Id T 1 )... (Id T 1 )(Id T ) Strengthened CauchySchwarz Inequality For 0 j a(v j, v ) C2 ( j)/2 v j H 1 (Ω)h 1 v L2 (Ω) v j V j, v V Standard CauchySchwarz Inequality a(v j, v ) v j a v a = v H 1 (Ω) v H 1 (Ω) v j V j, v V which implies a(v j, v ) C v j H 1 (Ω)h 1 v L2 (Ω)
111 Theorem There exists δ (0, 1) such that Multiplicative Theory for m, 1. z MG V (, γ, z 0, m) a δ z z 0 a
112 Theorem There exists δ (0, 1) such that Multiplicative Theory for m, 1. z MG V (, γ, z 0, m) a δ z z 0 a Details can be found in the boo by Bramble and the survey article by Bramble and Zhang. Refinement of the multiplicative theory can be found in the paper by Xu and Ziatanov. Reference J. Xu and L. Ziatanov, The method of alternating projections and the method of subspace corrections in Hilbert space, J. Amer. Math. Soc., 2002.
113 Theorem There exists δ (0, 1) such that Multiplicative Theory for m, 1. z MG V (, γ, z 0, m) a δ z z 0 a Details can be found in the boo by Bramble and the survey article by Bramble and Zhang. Refinement of the multiplicative theory can be found in the paper by Xu and Ziatanov. Reference J. Xu and L. Ziatanov, The method of alternating projections and the method of subspace corrections in Hilbert space, J. Amer. Math. Soc., The multiplicative theory cannot be applied to nonconforming finite element methods in general since many of the algebraic relations are no longer valid. For example, (Id I l P l ) 2 (Id I l P l )
114 Recursive Relation E = R m (Id I 1 P 1 E 0 = 0 Additive Theory + I 1 E 1P 1 )R m
115 Recursive Relation E E = R m (Id I 1 P 1 E 0 = 0 Additive Theory + I 1 E 1P 1 )R m = R m (Id I 1 P 1 )R m + R m I 1 Rm 1 (Id 1 I 1 2 P I 1 2 E 2P 2 1 )Rm 1 P 1 = R m (Id I 1 P 1 )R m + R m I 1 Rm 1 (Id 1 I 1 2 P 2 1 )Rm 1 P 1 R m + R m I 1 Rm 1 I 1 2 Rm 2 (Id 2 I 2 3 P 3 2 )Rm 2 P 2 + R m 1 Rm 1 P 1 R m
116 Recursive Relation E E = R m (Id I 1 P 1 E 0 = 0 Additive Theory + I 1 E 1P 1 )R m = R m (Id I 1 P 1 )R m + R m I 1 Rm 1 (Id 1 I 1 2 P I 1 2 E 2P 2 1 )Rm 1 P 1 = R m (Id I 1 P 1 )R m + R m I 1 Rm 1 (Id 1 I 1 2 P 2 1 )Rm 1 P 1 R m + R m I 1 Rm 1 I 1 2 Rm 2 (Id 2 I 2 3 P 3 2 )Rm 2 P 2 + [ R m j (Id j I j 1 P j 1 ] P j = j=1 R m I 1 Rm j+1 Ij+1 j j )R m j R m 1 Rm 1 P 1 R m j+1 Rm j P 1 R m
117 Ideas Additive Theory The operator R m j (Id j I j 1 P j 1 j )R m j has already been analyzed in the twogrid analysis.
118 Ideas Additive Theory The operator R m j (Id j I j 1 P j 1 j )R m j has already been analyzed in the twogrid analysis. The ey is to analyze (for 0 j ) the multilevel operator T def,j = R m I 1 Rm j+1 Ij+1 j : V j V and its transpose with respect to the variational forms T def j, = P j j+1 Rm j P 1 R m : V V j
119 Ideas Additive Theory The operator R m j (Id j I j 1 P j 1 j )R m j has already been analyzed in the twogrid analysis. The ey is to analyze (for 0 j ) the multilevel operator T def,j = R m I 1 Rm j+1 Ij+1 j : V j V and its transpose with respect to the variational forms T def j, = P j j+1 Rm j P 1 R m : V V j We will need a strengthened CauchySchwarz inequality with smoothing and estimates that compare the meshdependent norms on consecutive levels.
120 Ideas Additive Theory The operator R m j (Id j I j 1 P j 1 j )R m j has already been analyzed in the twogrid analysis. The ey is to analyze (for 0 j ) the multilevel operator T def,j = R m I 1 Rm j+1 Ij+1 j : V j V and its transpose with respect to the variational forms T def j, = P j j+1 Rm j P 1 R m : V V j We will need a strengthened CauchySchwarz inequality with smoothing and estimates that compare the meshdependent norms on consecutive levels. We need to circumvent the fact that for nonconforming methods in general (Id I l P l )2 (Id I l Pl )
121 Additive Theory Strengthened CauchySchwarz Inequality with Smoothing Let 0 j, l, v j V j and v l V l. a (T,j R m j v j, T,l R m l v l) C m α δ l j v j 1 α,j v l 1 α,l where C is a positive constant, 0 < δ < 1 and α ( 1 2, 1] is the index of elliptic regularity, provided the number of smoothing steps m is sufficiently large.
122 Additive Theory Strengthened CauchySchwarz Inequality with Smoothing Let 0 j, l, v j V j and v l V l. a (T,j R m j v j, T,l R m l v l) C m α δ l j v j 1 α,j v l 1 α,l where C is a positive constant, 0 < δ < 1 and α ( 1 2, 1] is the index of elliptic regularity, provided the number of smoothing steps m is sufficiently large. A Nonconforming Estimate ( Id 1 P 1 I 1) v 1 α, 1 Ch α v 1, 1 v V 1 (This will allow us to handle (Id I l Pl )2 (Id I l P l ).)
123 TwoLevel Estimates (0 < θ < 1) Additive Theory I 1 v 2 1, (1 + θ 2 ) v 2 1, 1 + Cθ 2 h 2α v 2 1+α, 1 v V 1 I 1 v 2 1 α, (1 + θ 2 ) v 2 1 α, 1 + Cθ 2 h 2α v 2 1, 1 v V 1 P 1 v 2 1 α, 1 (1 + θ 2 ) v 2 1 α, + Cθ 2 h 2α v 2 1, v V Important aspect: the constant C is independent of and θ.
124 TwoLevel Estimates (0 < θ < 1) Additive Theory I 1 v 2 1, (1 + θ 2 ) v 2 1, 1 + Cθ 2 h 2α v 2 1+α, 1 v V 1 I 1 v 2 1 α, (1 + θ 2 ) v 2 1 α, 1 + Cθ 2 h 2α v 2 1, 1 v V 1 P 1 v 2 1 α, 1 (1 + θ 2 ) v 2 1 α, + Cθ 2 h 2α v 2 1, v V Important aspect: the constant C is independent of and θ. θ is a parameter that calibrates the meaning of high/low frequency. The freedom to choose different θ on different levels allows us to build multilevel estimates from these twolevel estimates.
125 Additive Theory Theorem There exists a positive constant C independent of and m, such that z MG V (, γ, z 0, m) ah C m α z z a h provided that the number of smoothing steps m is larger than a number m which is independent of. In particular the Vcycle algorithm is a contraction with contraction number uniformly bounded away from 1 if m is sufficiently large.
126 Additive Theory Theorem There exists a positive constant C independent of and m, such that z MG V (, γ, z 0, m) ah C m α z z a h provided that the number of smoothing steps m is larger than a number m which is independent of. In particular the Vcycle algorithm is a contraction with contraction number uniformly bounded away from 1 if m is sufficiently large. This result holds for both conforming and nonconforming finite element methods.
127 Additive Theory Theorem There exists a positive constant C independent of and m, such that z MG V (, γ, z 0, m) ah C m α z z a h provided that the number of smoothing steps m is larger than a number m which is independent of. In particular the Vcycle algorithm is a contraction with contraction number uniformly bounded away from 1 if m is sufficiently large. This result holds for both conforming and nonconforming finite element methods. In the conforming case we can combine this with the result from the multiplicative theory to show that C z MG V (, γ, z 0, m) a C + m α z z a
128 References Additive Theory 1 B., Convergence of the multigrid Vcycle algorithm for second order boundary value problems without full elliptic regularity, Math. Comp., B., Convergence of nonconforming Vcycle and Fcycle multigrid algorithms for second order elliptic boundary value problems, Math. Comp., B., Smoothers, mesh dependent norms, interpolation and multigrid, Appl. Numer. Math., B. and L.Y. Sung Multigrid algorithms for C 0 interior penalty methods, SIAM J. Numer. Anal., 2006.
129 Other Algorithms FCycle Algorithm for A z = γ with initial guess z 0 Output = MG F (, γ, z 0, m)
130 Other Algorithms FCycle Algorithm for A z = γ with initial guess z 0 Output = MG F (, γ, z 0, m) Correction Step (coarse grid algorithm followed by Vcycle) q = MG F ( 1, I 1 (γ A z m ), 0, m) q = MG V ( 1, I 1 (γ A z m ), q, m)
131 Other Algorithms FCycle Algorithm for A z = γ with initial guess z 0 Output = MG F (, γ, z 0, m) Correction Step (coarse grid algorithm followed by Vcycle) q = MG F ( 1, I 1 (γ A z m ), 0, m) q = MG V ( 1, I 1 (γ A z m ), q, m) = 3 acements = 2 = 1 = 0 scheduling diagram for the Fcycle algorithm
132 Other Algorithms Convergence of the Fcycle algorithm follows from the convergence of the Vcycle algorithm by a perturbation argument. The computational cost of the Fcycle algorithm is more than the cost of the Vcycle algorithm but less than that of the Wcycle algorithm. For nonconforming methods the Fcycle is more robust than the Vcycle (i.e., it requires a smaller number of smoothing steps) and its performance is almost identical with the performance of the Wcycle. Nonconforming Fcycle algorithms have been used extensively in CFD computations by Rannacher and Ture.
133 Variable VCycle Other Algorithms This is the Vcycle algorithm where the number of smoothing steps can vary from level to level.
134 Variable VCycle Other Algorithms This is the Vcycle algorithm where the number of smoothing steps can vary from level to level. Suppose we want to solve the finite element equation on level. Then m j, the number of smoothing steps for level j, is chosen according to the rule β 1 m j m j 1 β 2 m j for 0 j, where 1 < β 1 β 2.
135 Variable VCycle Other Algorithms This is the Vcycle algorithm where the number of smoothing steps can vary from level to level. Suppose we want to solve the finite element equation on level. Then m j, the number of smoothing steps for level j, is chosen according to the rule β 1 m j m j 1 β 2 m j for 0 j, where 1 < β 1 β 2. The variable Vcycle algorithm is mostly used as an optimal preconditioner.
136 Full Multigrid Other Algorithms The th level multigrid algorithm solves the equation A z = γ with an (arbitrary) initial guess z 0.
137 Full Multigrid Other Algorithms The th level multigrid algorithm solves the equation A z = γ with an (arbitrary) initial guess z 0. When we are solving the finite element equation u v dx = fv dx v V Ω the finite element solution u on different levels are related, because they are approximations of the same u. Ω
138 Full Multigrid Other Algorithms The th level multigrid algorithm solves the equation A z = γ with an (arbitrary) initial guess z 0. When we are solving the finite element equation u v dx = fv dx v V Ω the finite element solution u on different levels are related, because they are approximations of the same u. Therefore the initial guess for the th level multigrid algorithm should come from the solution on the ( 1) st level. Ω
139 Finite Element Equation Full Multigrid Algorithm For = 0, û 0 = A 1 0 φ 0 For 1, A u = φ φ, v = fv dx Ω Other Algorithms v V u 0 = I 1û 1 u l = MG(, φ, u l 1, m) for 1 l r û = u r
140 Other Algorithms Suppose the multigrid algorithm is uniformly convergent. For a sufficiently large r, the full multigrid algorithm, which is a nested iteration of the th level multigrid algorithms, will produce an approximate solution of the continuous problem that is accurate to the same order as the exact solution of the finite element equation. Moreover the computational cost of the full multigrid algorithm remains proportional to the number of unnowns.
Multigrid Method ZHONGCI SHI. Institute of Computational Mathematics Chinese Academy of Sciences, Beijing, China. Joint work: Xuejun Xu
Multigrid Method ZHONGCI SHI Institute of Computational Mathematics Chinese Academy of Sciences, Beijing, China Joint work: Xuejun Xu Outline Introduction Standard Cascadic Multigrid method(cmg) Economical
More informationMultigrid Methods for Maxwell s Equations
Multigrid Methods for Maxwell s Equations Jintao Cui Institute for Mathematics and Its Applications University of Minnesota Outline Nonconforming Finite Element Methods for a Two Dimensional CurlCurl
More informationMULTIGRID PRECONDITIONING FOR THE BIHARMONIC DIRICHLET PROBLEM M. R. HANISCH
MULTIGRID PRECONDITIONING FOR THE BIHARMONIC DIRICHLET PROBLEM M. R. HANISCH Abstract. A multigrid preconditioning scheme for solving the CiarletRaviart mixed method equations for the biharmonic Dirichlet
More informationOn an Approximation Result for Piecewise Polynomial Functions. O. Karakashian
BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results
More informationITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS
ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semilinear elliptic equations of the form: find
More informationLecture Note III: LeastSquares Method
Lecture Note III: LeastSquares Method Zhiqiang Cai October 4, 004 In this chapter, we shall present leastsquares methods for secondorder scalar partial differential equations, elastic equations of solids,
More informationANALYSIS AND COMPARISON OF GEOMETRIC AND ALGEBRAIC MULTIGRID FOR CONVECTIONDIFFUSION EQUATIONS
ANALYSIS AND COMPARISON OF GEOMETRIC AND ALGEBRAIC MULTIGRID FOR CONVECTIONDIFFUSION EQUATIONS CHINTIEN WU AND HOWARD C. ELMAN Abstract. The discrete convectiondiffusion equations obtained from streamline
More informationPARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS
PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method
More informationA Mixed Nonconforming Finite Element for Linear Elasticity
A Mixed Nonconforming Finite Element for Linear Elasticity Zhiqiang Cai, 1 Xiu Ye 2 1 Department of Mathematics, Purdue University, West Lafayette, Indiana 479071395 2 Department of Mathematics and Statistics,
More informationConstrained Minimization and Multigrid
Constrained Minimization and Multigrid C. Gräser (FU Berlin), R. Kornhuber (FU Berlin), and O. Sander (FU Berlin) Workshop on PDE Constrained Optimization Hamburg, March 2729, 2008 Matheon Outline Successive
More informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
More informationAMG for a Petascale Navier Stokes Code
AMG for a Petascale Navier Stokes Code James Lottes Argonne National Laboratory October 18, 2007 The Challenge Develop an AMG iterative method to solve Poisson 2 u = f discretized on highly irregular
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra PerOlof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationAn Algebraic Multigrid Method Based on Matching 2 in Graphs 3 UNCORRECTED PROOF
1 An Algebraic Multigrid Method Based on Matching 2 in Graphs 3 James Brannic 1, Yao Chen 1, Johannes Kraus 2, and Ludmil Ziatanov 1 4 1 Department of Mathematics, The Pennsylvania State University, PA
More informationBootstrap AMG. Kailai Xu. July 12, Stanford University
Bootstrap AMG Kailai Xu Stanford University July 12, 2017 AMG Components A general AMG algorithm consists of the following components. A hierarchy of levels. A smoother. A prolongation. A restriction.
More informationChapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction
Chapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction The a posteriori error estimation of finite element approximations of elliptic boundary value problems has reached
More informationRobust solution of Poissonlike problems with aggregationbased AMG
Robust solution of Poissonlike problems with aggregationbased AMG Yvan Notay Université Libre de Bruxelles Service de Métrologie Nucléaire Paris, January 26, 215 Supported by the Belgian FNRS http://homepages.ulb.ac.be/
More informationHamburger Beiträge zur Angewandten Mathematik
Hamburger Beiträge zur Angewandten Mathematik Numerical analysis of a control and state constrained elliptic control problem with piecewise constant control approximations Klaus Deckelnick and Michael
More informationIt is known that Morley element is not C 0 element and it is divergent for Poisson equation (see [6]). When Morley element is applied to solve problem
Modied Morley Element Method for a ourth Order Elliptic Singular Perturbation Problem Λ Wang Ming LMAM, School of Mathematical Science, Peking University Jinchao u School of Mathematical Science, Peking
More informationA Balancing Algorithm for Mortar Methods
A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY 11, USA Dan Stefanica@baruch.cuny.edu Summary. The balancing methods are hybrid nonoverlapping Schwarz
More informationNumerische Mathematik
Numer. Math. (1999) 82: 179 191 Numerische Mathematik c SpringerVerlag 1999 Electronic Edition A cascadic multigrid algorithm for the Stokes equations Dietrich Braess 1, Wolfgang Dahmen 2 1 Fakultät für
More informationIntroduction to Scientific Computing II Multigrid
Introduction to Scientific Computing II Multigrid Miriam Mehl Slide 5: Relaxation Methods Properties convergence depends on method clear, see exercises and 3), frequency of the error remember eigenvectors
More informationNumerische Mathematik
Numer. Math. (997) 76: 479 488 Numerische Mathematik c SpringerVerlag 997 Electronic Edition Exponential decay of C cubic splines vanishing at two symmetric points in each knot interval Sang Dong Kim,,
More informationA STOKES INTERFACE PROBLEM: STABILITY, FINITE ELEMENT ANALYSIS AND A ROBUST SOLVER
European Congress on Computational Methods in Applied Sciences and Engineering ECCOMAS 2004 P. Neittaanmäki, T. Rossi, K. Majava, and O. Pironneau (eds.) O. Nevanlinna and R. Rannacher (assoc. eds.) Jyväskylä,
More informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationSOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY
SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY KLAUS NEYMEYR ABSTRACT. Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow
More informationPoisson Equation in 2D
A Parallel Strategy Department of Mathematics and Statistics McMaster University March 31, 2010 Outline Introduction 1 Introduction Motivation Discretization Iterative Methods 2 Additive Schwarz Method
More informationTHE BEST L 2 NORM ERROR ESTIMATE OF LOWER ORDER FINITE ELEMENT METHODS FOR THE FOURTH ORDER PROBLEM *
Journal of Computational Mathematics Vol.30, No.5, 2012, 449 460. http://www.globalsci.org/jcm doi:10.4208/jcm.1203m3855 THE BEST L 2 NORM ERROR ESTIMATE OF LOWER ORDER FINITE ELEMENT METHODS FOR THE
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wiasberlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationXIAOCHUAN CAI AND MAKSYMILIAN DRYJA. strongly elliptic equations discretized by the nite element methods.
Contemporary Mathematics Volume 00, 0000 Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems XIAOCHUAN CAI AND MAKSYMILIAN DRYJA Abstract. In this paper, we study several overlapping
More informationConvergence of The Multigrid Method With A Wavelet. Abstract. This new coarse grid operator is constructed using the wavelet
Convergence of The Multigrid Method With A Wavelet Coarse Grid Operator Bjorn Engquist Erding Luo y Abstract The convergence of the twolevel multigrid method with a new coarse grid operator is studied.
More informationEXACT DE RHAM SEQUENCES OF SPACES DEFINED ON MACROELEMENTS IN TWO AND THREE SPATIAL DIMENSIONS
EXACT DE RHAM SEQUENCES OF SPACES DEFINED ON MACROELEMENTS IN TWO AND THREE SPATIAL DIMENSIONS JOSEPH E. PASCIAK AND PANAYOT S. VASSILEVSKI Abstract. This paper proposes new finite element spaces that
More informationInstitut für Mathematik
U n i v e r s i t ä t A u g s b u r g Institut für Mathematik Xuejun Xu, Huangxin Chen, Ronald H.W. Hoppe Optimality of Local Multilevel Methods on Adaptively Refined Meshes for Elliptic Boundary Value
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method Classical Iterations We have a problem, We assume that the matrix comes from a discretization of a PDE. The best and most popular model problem is, The matrix will be as large
More informationMath 5520 Homework 2 Solutions
Math 552 Homework 2 Solutions March, 26. Consider the function fx) = 2x ) 3 if x, 3x ) 2 if < x 2. Determine for which k there holds f H k, 2). Find D α f for α k. Solution. We show that k = 2. The formulas
More informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
More informationNumerische Mathematik
umer. Math. 73: 149 167 (1996) umerische Mathematik c SpringerVerlag 1996 Overlapping Schwarz methods on unstructured meshes using nonmatching coarse grids Tony F. Chan 1, Barry F. Smith 2, Jun Zou 3
More informationIntroduction to Multigrid Method
Introduction to Multigrid Metod Presented by: Bogojeska Jasmina /08/005 JASS, 005, St. Petersburg 1 Te ultimate upsot of MLAT Te amount of computational work sould be proportional to te amount of real
More informationA Balancing Algorithm for Mortar Methods
A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY, USA. Dan_Stefanica@baruch.cuny.edu Summary. The balancing methods are hybrid nonoverlapping Schwarz
More informationA Robust Approach to Minimizing H(div)Dominated Functionals in an H 1 Conforming Finite Element Space
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2000; 00:1 23 [Version: 2002/09/18 v1.02] A Robust Approach to Minimizing H(div)Dominated Functionals in an H 1 Conforming Finite
More informationTHE EFFECT OF MULTIGRID PARAMETERS IN A 3D HEAT DIFFUSION EQUATION
Int. J. of Applied Mechanics and Engineering, 2018, vol.23, No.1, pp.213221 DOI: 10.1515/ijame20180012 Brief note THE EFFECT OF MULTIGRID PARAMETERS IN A 3D HEAT DIFFUSION EQUATION F. DE OLIVEIRA *
More informationGoaloriented error control of the iterative solution of finite element equations
J. Numer. Math., Vol. 0, No. 0, pp. 1 31 (2009) DOI 10.1515/ JNUM.2009.000 c de Gruyter 2009 Prepared using jnm.sty [Version: 20.02.2007 v1.3] Goaloriented error control of the iterative solution of finite
More informationMultigrid Solution of the DebyeHückel Equation
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5172013 Multigrid Solution of the DebyeHückel Equation Benjamin Quanah Parker Follow this and additional works
More informationSTEEPEST DESCENT AND CONJUGATE GRADIENT METHODS WITH VARIABLE PRECONDITIONING
SIAM J. MATRIX ANAL. APPL. Vol.?, No.?, pp.?? c 2007 Society for Industrial and Applied Mathematics STEEPEST DESCENT AND CONJUGATE GRADIENT METHODS WITH VARIABLE PRECONDITIONING ANDREW V. KNYAZEV AND ILYA
More informationWEAK GALERKIN FINITE ELEMENT METHOD FOR SECOND ORDER PARABOLIC EQUATIONS
INERNAIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 13, Number 4, Pages 525 544 c 216 Institute for Scientific Computing and Information WEAK GALERKIN FINIE ELEMEN MEHOD FOR SECOND ORDER PARABOLIC
More informationBasic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems
Basic Concepts of Adaptive Finite lement Methods for lliptic Boundary Value Problems Ronald H.W. Hoppe 1,2 1 Department of Mathematics, University of Houston 2 Institute of Mathematics, University of Augsburg
More informationA LEASTSQUARES APPROACH BASED ON A DISCRETE MINUS ONE INNER PRODUCT FOR FIRST ORDER SYSTEMS
MATHEMATICS OF COMPUTATION Volume 66, Number 219, July 1997, Pages 935 955 S 00255718(97)00848X A LEASTSQUARES APPROACH BASED ON A DISCRETE MINUS ONE INNER PRODUCT FOR FIRST ORDER SYSTEMS JAMES H BRAMBLE,
More informationIterative Methods for Linear Systems
Iterative Methods for Linear Systems 1. Introduction: Direct solvers versus iterative solvers In many applications we have to solve a linear system Ax = b with A R n n and b R n given. If n is large the
More informationPREPRINT 2010:25. Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO
PREPRINT 2010:25 Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS
More informationNumerical Solution of the Nonlinear PoissonBoltzmann Equation: Developing More Robust and Efficient Methods
Numerical Solution of the Nonlinear PoissonBoltzmann Equation: Developing More Robust and Efficient Methods Michael J. Holst Department of Applied Mathematics and CRPC California Institute of Technology
More informationRecoveryBased A Posteriori Error Estimation
RecoveryBased A Posteriori Error Estimation Zhiqiang Cai Purdue University Department of Mathematics, Purdue University Slide 1, March 2, 2011 Outline Introduction Diffusion Problems Higher Order Elements
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 3: Iterative Methods PD
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 informationarxiv: v2 [math.na] 16 Nov 2016
BOOTSTRAP MULTIGRID FOR THE SHIFTED LAPLACEBELTRAMI EIGENVALUE PROBLEM JAMES BRANNICK AND SHUHAO CAO arxiv:1511.07042v2 [math.na] 16 Nov 2016 Abstract. This paper introduces bootstrap twogrid and multigrid
More informationA DECOMPOSITION RESULT FOR BIHARMONIC PROBLEMS AND THE HELLANHERRMANNJOHNSON METHOD
Electronic ransactions on Numerical Analysis. Volume 45, pp. 257 282, 2016. Copyright c 2016,. ISSN 1068 9613. ENA A DECOMPOSIION RESUL FOR BIHARMONIC PROBLEMS AND HE HELLANHERRMANNJOHNSON MEHOD WOLFGANG
More informationOn Nonlinear Dirichlet Neumann Algorithms for Jumping Nonlinearities
On Nonlinear Dirichlet Neumann Algorithms for Jumping Nonlinearities Heiko Berninger, Ralf Kornhuber, and Oliver Sander FU Berlin, FB Mathematik und Informatik (http://www.math.fuberlin.de/rd/we02/numerik/)
More informationNewtonMultigrid LeastSquares FEM for SVP Formulation of the NavierStokes Equations
NewtonMultigrid LeastSquares FEM for SVP Formulation of the NavierStokes Equations A. Ouazzi, M. Nickaeen, S. Turek, and M. Waseem Institut für Angewandte Mathematik, LSIII, TU Dortmund, Vogelpothsweg
More informationParallel Discontinuous Galerkin Method
Parallel Discontinuous Galerkin Method Yin Ki, NG The Chinese University of Hong Kong Aug 5, 2015 Mentors: Dr. Ohannes Karakashian, Dr. Kwai Wong Overview Project Goal Implement parallelization on Discontinuous
More informationRegular article Nonlinear multigrid methods for total variation image denoising
Comput Visual Sci 7: 199 06 (004) Digital Object Identifier (DOI) 10.1007/s0079100401503 Computing and Visualization in Science Regular article Nonlinear multigrid methods for total variation image
More informationBasic Principles of Weak Galerkin Finite Element Methods for PDEs
Basic Principles of Weak Galerkin Finite Element Methods for PDEs Junping Wang Computational Mathematics Division of Mathematical Sciences National Science Foundation Arlington, VA 22230 Polytopal Element
More informationOptimal preconditioners for NitscheXFEM discretizations of interface problems
Optimal preconditioners for NitscheXFEM discretizations of interface problems Christoph Lehrenfeld Arnold Reusken August 13, 2014 In the past decade, a combination of unfitted finite elements (or XFEM)
More informationOn Pressure Stabilization Method and Projection Method for Unsteady NavierStokes Equations 1
On Pressure Stabilization Method and Projection Method for Unsteady NavierStokes Equations 1 Jie Shen Department of Mathematics, Penn State University University Park, PA 1682 Abstract. We present some
More informationA DISCONTINUOUS GALERKIN METHOD FOR ELLIPTIC INTERFACE PROBLEMS WITH APPLICATION TO ELECTROPORATION
A DISCONTINUOUS GALERIN METHOD FOR ELLIPTIC INTERFACE PROBLEMS WITH APPLICATION TO ELECTROPORATION GRÉGORY GUYOMARC H AND CHANGOC LEE Abstract. We present a discontinuous Galerkin (DG) method to solve
More informationOn domain decomposition preconditioners for finite element approximations of the Helmholtz equation using absorption
On domain decomposition preconditioners for finite element approximations of the Helmholtz equation using absorption Ivan Graham and Euan Spence (Bath, UK) Collaborations with: Paul Childs (Emerson Roxar,
More informationELLIPTIC RECONSTRUCTION AND A POSTERIORI ERROR ESTIMATES FOR PARABOLIC PROBLEMS
ELLIPTIC RECONSTRUCTION AND A POSTERIORI ERROR ESTIMATES FOR PARABOLIC PROBLEMS CHARALAMBOS MAKRIDAKIS AND RICARDO H. NOCHETTO Abstract. It is known that the energy technique for a posteriori error analysis
More informationFinal Ph.D. Progress Report. Integration of hpadaptivity with a Two Grid Solver: Applications to Electromagnetics. David Pardo
Final Ph.D. Progress Report Integration of hpadaptivity with a Two Grid Solver: Applications to Electromagnetics. David Pardo Dissertation Committee: I. Babuska, L. Demkowicz, C. TorresVerdin, R. Van
More informationThe Effect of the Schedule on the CPU Time for 2D Poisson Equation
Trabalho apresentado no XXXV CNMAC, NatalRN, 2014. The Effect of the Schedule on the CPU Time for 2D Poisson Equation Fabiane de Oliveira, State University of Ponta Grossa, Department of Mathematics and
More informationBoundary Value Problems and Iterative Methods for Linear Systems
Boundary Value Problems and Iterative Methods for Linear Systems 1. Equilibrium Problems 1.1. Abstract setting We want to find a displacement u V. Here V is a complete vector space with a norm v V. In
More informationReduction of Finite Element Models of Complex Mechanical Components
Reduction of Finite Element Models of Complex Mechanical Components Håkan Jakobsson Research Assistant hakan.jakobsson@math.umu.se Mats G. Larson Professor Applied Mathematics mats.larson@math.umu.se Department
More informationDomain Decomposition Methods for Mortar Finite Elements
Domain Decomposition Methods for Mortar Finite Elements Dan Stefanica Courant Institute of Mathematical Sciences New York University September 1999 A dissertation in the Department of Mathematics Submitted
More informationFEM Convergence for PDEs with Point Sources in 2D and 3D
FEM Convergence for PDEs with Point Sources in D and 3D Kourosh M. Kalayeh 1, Jonathan S. Graf, and Matthias K. Gobbert 1 Department of Mechanical Engineering, University of Maryland, Baltimore County
More informationSUPERCONVERGENCE PROPERTIES FOR OPTIMAL CONTROL PROBLEMS DISCRETIZED BY PIECEWISE LINEAR AND DISCONTINUOUS FUNCTIONS
SUPERCONVERGENCE PROPERTIES FOR OPTIMAL CONTROL PROBLEMS DISCRETIZED BY PIECEWISE LINEAR AND DISCONTINUOUS FUNCTIONS A. RÖSCH AND R. SIMON Abstract. An optimal control problem for an elliptic equation
More informationA SpaceTime Multigrid Solver Methodology for the Optimal Control of TimeDependent Fluid Flow
A SpaceTime Multigrid Solver Methodology for the Optimal Control of TimeDependent Fluid Flow Michael Köster, Michael Hinze, Stefan Turek Michael Köster Institute for Applied Mathematics TU Dortmund Trier,
More informationUltraconvergence of ZZ Patch Recovery at Mesh Symmetry Points
Ultraconvergence of ZZ Patch Recovery at Mesh Symmetry Points Zhimin Zhang and Runchang Lin Department of Mathematics, Wayne State University Abstract. The ultraconvergence property of the ZienkiewiczZhu
More informationA Line search Multigrid Method for LargeScale Nonlinear Optimization
A Line search Multigrid Method for LargeScale Nonlinear Optimization Zaiwen Wen Donald Goldfarb Department of Industrial Engineering and Operations Research Columbia University 2008 Siam Conference on
More informationAN HELMHOLTZ ITERATIVE SOLVER FOR THE THREEDIMENSIONAL SEISMIC IMAGING PROBLEMS?
European Conference on Computational Fluid Dynamics ECCOMAS CFD 2006 P. Wesseling, E. Oñate, J. Périaux (Eds) c TU Delft, Delft The Netherlands, 2006 AN HELMHOLTZ ITERATIVE SOLVER FOR THE THREEDIMENSIONAL
More informationChapter 3 Conforming Finite Element Methods 3.1 Foundations RitzGalerkin Method
Chapter 3 Conforming Finite Element Methods 3.1 Foundations 3.1.1 RitzGalerkin Method Let V be a Hilbert space, a(, ) : V V lr a bounded, Velliptic bilinear form and l : V lr a bounded linear functional.
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Sobolev Embedding Theorems Embedding Operators and the Sobolev Embedding Theorem
More informationConjugate gradient method. Descent method. Conjugate search direction. Conjugate Gradient Algorithm (294)
Conjugate gradient method Descent method Hestenes, Stiefel 1952 For A N N SPD In exact arithmetic, solves in N steps In real arithmetic No guaranteed stopping Often converges in many fewer than N steps
More informationA Finite Element Method for an IllPosed Problem. MartinLutherUniversitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract
A Finite Element Method for an IllPosed Problem W. Lucht MartinLutherUniversitat, Fachbereich Mathematik/Informatik,Postfach 8, D699 Halle, Germany Abstract For an illposed problem which has its origin
More informationMIXED FINITE ELEMENT APPROXIMATION OF THE VECTOR LAPLACIAN WITH DIRICHLET BOUNDARY CONDITIONS
MIXED FINITE ELEMENT APPROXIMATION OF THE VECTOR LAPLACIAN WITH DIRICHLET BOUNDARY CONDITIONS DOUGLAS N. ARNOLD, RICHARD S. FALK, AND JAY GOPALAKRISHNAN Abstract. We consider the finite element solution
More informationOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
Int. J. Nonlinear Anal. Appl. 7 (2016) No. 1, 295300 ISSN: 20086822 (electronic) http://dx.doi.org/10.22075/ijnaa.2015.341 On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous
More informationPOLYNOMIAL PRESERVING GRADIENT RECOVERY AND A POSTERIORI ESTIMATE FOR BILINEAR ELEMENT ON IRREGULAR QUADRILATERALS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume, Number, Pages 24 c 2004 Institute for Scientific Computing and Information POLYNOMIAL PRESERVING GRADIENT RECOVERY AND A POSTERIORI ESTIMATE
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Variational Problems of the Dirichlet BVP of the Poisson Equation 1 For the homogeneous
More information7.3 The Jacobi and GaussSiedel Iterative Techniques. Problem: To solve Ax = b for A R n n. Methodology: Iteratively approximate solution x. No GEPP.
7.3 The Jacobi and GaussSiedel Iterative Techniques Problem: To solve Ax = b for A R n n. Methodology: Iteratively approximate solution x. No GEPP. 7.3 The Jacobi and GaussSiedel Iterative Techniques
More informationHighorder ADI schemes for convectiondiffusion equations with mixed derivative terms
Highorder ADI schemes for convectiondiffusion equations with mixed derivative terms B. Düring, M. Fournié and A. Rigal Abstract We consider new highorder Alternating Direction Implicit ADI) schemes
More informationMultispace and Multilevel BDDC
Multispace and Multilevel BDDC Jan Mandel Bedřich Sousedík Clark R. Dohrmann February 11, 2018 arxiv:0712.3977v2 [math.na] 21 Jan 2008 Abstract BDDC method is the most advanced method from the Balancing
More informationOn Surface Meshes Induced by Level Set Functions
On Surface Meshes Induced by Level Set Functions Maxim A. Olshanskii, Arnold Reusken, and Xianmin Xu Bericht Nr. 347 Oktober 01 Key words: surface finite elements, level set function, surface triangulation,
More informationContents. Computational Fluid Dynamics. Fundamentals. Deformation of Materials
Contents R. Verfürth www.ruhrunibochum.de/num1 Lecture Series / Bochum / Summer Term 2018 Variational Formulation of the Stokes Equations of the Stokes Equations Stationary Incompressible NavierStokes
More informationA WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS
A WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS LIN MU, JUNPING WANG, YANQIU WANG, AND XIU YE Abstract. This article introduces and analyzes a weak Galerkin mixed finite element method
More informationScientific Computing II
Technische Universität München ST 008 Institut für Informatik Dr. Miriam Mehl Scientific Computing II Final Exam, July, 008 Iterative Solvers (3 pts + 4 extra pts, 60 min) a) Steepest Descent and Conjugate
More informationOptimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms
Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Marcus Sarkis Worcester Polytechnic Inst., Mass. and IMPA, Rio de Janeiro and Daniel
More informationA multilevel, levelset method for optimizing eigenvalues in shape design problems
A multilevel, levelset method for optimizing eigenvalues in shape design problems E. Haber July 22, 2003 Abstract In this paper we consider optimal design problems that involve shape optimization. The
More informationOptimal Newtontype methods for nonconvex smooth optimization problems
Optimal Newtontype methods for nonconvex smooth optimization problems Coralia Cartis, Nicholas I. M. Gould and Philippe L. Toint June 9, 20 Abstract We consider a general class of secondorder iterations
More informationSolutions of Selected Problems
1 Solutions of Selected Problems October 16, 2015 Chapter I 1.9 Consider the potential equation in the disk := {(x, y) R 2 ; x 2 +y 2 < 1}, with the boundary condition u(x) = g(x) r for x on the derivative
More informationTechnische Universität Graz
Technische Universität Graz Stability of the Laplace single layer boundary integral operator in Sobolev spaces O. Steinbach Berichte aus dem Institut für Numerische Mathematik Bericht 2016/2 Technische
More informationNUMERICAL SIMULATION OF INTERACTION BETWEEN INCOMPRESSIBLE FLOW AND AN ELASTIC WALL
Proceedings of ALGORITMY 212 pp. 29 218 NUMERICAL SIMULATION OF INTERACTION BETWEEN INCOMPRESSIBLE FLOW AND AN ELASTIC WALL MARTIN HADRAVA, MILOSLAV FEISTAUER, AND PETR SVÁČEK Abstract. The present paper
More informationA FINITE ELEMENT METHOD FOR ELLIPTIC EQUATIONS ON SURFACES
A FINITE ELEMENT METHOD FOR ELLIPTIC EQUATIONS ON SURFACES MAXIM A. OLSHANSKII, ARNOLD REUSKEN, AND JÖRG GRANDE Abstract. In this paper a new finite element approach for the discretization of elliptic
More informationMultigrid and Iterative Strategies for Optimal Control Problems
Multigrid and Iterative Strategies for Optimal Control Problems John Pearson 1, Stefan Takacs 1 1 Mathematical Institute, 24 29 St. Giles, Oxford, OX1 3LB email: john.pearson@worc.ox.ac.uk, takacs@maths.ox.ac.uk
More informationThe Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment
he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State
More information