Dirichlet-Neumann and Neumann-Neumann Methods
|
|
- George Copeland
- 5 years ago
- Views:
Transcription
1 Dirichlet-Neumann and Neumann-Neumann Methods Felix Kwok Hong Kong Baptist University Introductory Domain Decomposition Short Course DD25, Memorial University of Newfoundland July 22, 2018
2 Outline Methods Without Overlap Dirichlet Neumann Method Neumann Neumann Method Discrete Formulation
3 Outline Methods Without Overlap Dirichlet Neumann Method Neumann Neumann Method Discrete Formulation
4 DD methods without overlap Methods that do not require overlap between subdomains: 1. Optimized Schwarz methods (lecture by Laurence Halpern) 2. Dirichlet-Neumann and Neumann-Neumann methods (this lecture)
5 DD methods without overlap Method converges to monodomain solution if the subdomain solutions have the same function values and derivatives across the interface: u 1 = u 2 u 1 n 1 = u 2 n 2 on Γ on Γ
6 Outline Methods Without Overlap Dirichlet Neumann Method Neumann Neumann Method Discrete Formulation
7 Dirichlet Neumann Method (Bjørstad & Widlund 1986) Geometry: assume two non-overlapping subdomains Iterates: solution on the interface u 1 Γ, u2 Γ,... Once interface values converge, solve subdomain problems to get solution everywhere
8 Dirichlet Neumann Method (Bjørstad & Widlund 1986) Iteration n consists of two substeps: 1. Solve Dirichlet problem on Ω 1, using uγ n as Dirichlet value on Γ u n+1/2 1 = f in Ω 1 u n+1/2 1 = 0 on Ω 1 \ Γ u n+1/2 1 = uγ n on Γ
9 Dirichlet Neumann Method (Bjørstad & Widlund 1986) Iteration n consists of two substeps: 2. Solve Neumann problem on Ω 2 by matching normal derivatives with u n+1/2 1 : u n+1 2 = f in Ω 2 u n+1 2 = 0 on Ω 2 \ Γ u n+1 2 n 2 = un+1/2 1 n 1 on Γ
10 Dirichlet Neumann Method (Bjørstad & Widlund 1986) Iteration n consists of two substeps: 2. Solve Neumann problem on Ω 2 by matching normal derivatives with u n+1/2 1 : Update interface trace: u n+1 2 = f in Ω 2 u n+1 2 = 0 on Ω 2 \ Γ u n+1 2 n 2 = un+1/2 1 n 1 on Γ u n+1 Γ = (1 θ)u n Γ + θu n+1 2 Γ, 0 < θ 1
11 Why does this work? For i = 1, 2, define the Dirichlet-to-Neumann map DtN i (, ) so that DtN i (f, g) = u i n i Γ, where u i satisfies u i = f on Ω i and u i = g on Γ; the Neumann-to-Dirichlet map NtD i (, ) so that NtD i (f, g) = u i Γ, where u i satisfies u i = f on Ω i and u i / n i = g on Γ. Note that for fixed f and i, DtN and NtD are inverses of each other: DtN i (f, NtD i (f, g)) = g, NtD i (f, DtN i (f, g)) = g.
12 Why does it work? Then the Dirichlet-Neumann (DN) method can be written as u n+1 Γ = (1 θ)u n Γ + θntd 2 (f, DtN 1 (f, u n Γ)). If the method converges, then at the fixed point u Γ = lim n u n Γ, we have u Γ = NtD 2 (f, DtN 1 (f, u Γ )),
13 Why does it work? Then the Dirichlet-Neumann (DN) method can be written as u n+1 Γ = (1 θ)u n Γ + θntd 2 (f, DtN 1 (f, u n Γ)). If the method converges, then at the fixed point u Γ = lim n u n Γ, we have DtN 2 (f, u Γ ) = DtN 1 (f, u Γ ),
14 Why does it work? Then the Dirichlet-Neumann (DN) method can be written as u n+1 Γ = (1 θ)u n Γ + θntd 2 (f, DtN 1 (f, u n Γ)). If the method converges, then at the fixed point u Γ = lim n uγ n, we have DtN 1 (f, u Γ ) + DtN 2 (f, u Γ ) = 0 ( )
15 Why does it work? Then the Dirichlet-Neumann (DN) method can be written as u n+1 Γ = (1 θ)u n Γ + θntd 2 (f, DtN 1 (f, u n Γ)). If the method converges, then at the fixed point u Γ = lim n uγ n, we have DtN 1 (f, u Γ ) + DtN 2 (f, u Γ ) = 0 ( ) In other words, we have u 1 and u 2 such that u i = f u 1 = u 2 = u Γ u 1 n 1 + u 2 n 2 = 0 on Ω i on Γ on Γ = continuity and smoothness conditions satisfied.
16 Why does it work? Then the Dirichlet-Neumann (DN) method can be written as u n+1 Γ = (1 θ)u n Γ + θntd 2 (f, DtN 1 (f, u n Γ)). If the method converges, then at the fixed point u Γ = lim n uγ n, we have DtN 1 (f, u Γ ) + DtN 2 (f, u Γ ) = 0 ( ) In other words, we have u 1 and u 2 such that u i = f u 1 = u 2 = u Γ u 1 n 1 + u 2 n 2 = 0 on Ω i on Γ on Γ The DN method is a stationary iteration for solving ( ) for u Γ.
17 Multiple subdomains Start with one subdomain and solve Dirichlet problem
18 Multiple subdomains Start with one subdomain and solve Dirichlet problem Solve mixed Dirichlet-Neumann problems on neighbours
19 Multiple subdomains Start with one subdomain and solve Dirichlet problem Solve mixed Dirichlet-Neumann problems on neighbours Update interface traces
20 Multiple subdomains Start with one subdomain and solve Dirichlet problem Solve mixed Dirichlet-Neumann problems on neighbours Update interface traces Move on to next set of neighbours, etc.
21 Multiple subdomains Start with one subdomain and solve Dirichlet problem Solve mixed Dirichlet-Neumann problems on neighbours Update interface traces Move on to next set of neighbours, etc. Many configurations possible!
22 Convergence Analysis by Fourier Assume 2D rectangular domain ( a, b) (0, π) Two subdomains: Ω 1 = (0, b) (0, π), Ω 2 = ( a, 0) (0, π) Solve u = f with Dirichlet boundary conditions Since problem is linear, assume f = 0 and study how the error e n := u n u tends to zero as n
23 Convergence Analysis by Fourier Expand eγ n into a Fourier sine series: e n Γ = k 1 ê n Γ(k) sin(ky) Solve e n 1 = 0 on Ω 1 using separation of variables: e n+1/2 1 (x, y) = k 1 A k sin(ky) sinh(k(b x)) e n+1/2 1 (0, y) = A k sin(ky) sinh(kb) = êγ(k) n sin(ky) k 1 k 1 = e n+1/2 1 (x, y) = k 1 sinh(k(b x)) ê n sinh(kb) Γ(k) sin(ky)
24 Convergence Analysis by Fourier Now solve e n+1 2 = 0 on Ω 2 using separation of variables: e n+1 2 (x, y) = k 1 B k sin(ky) sinh(k(x + a)) e n+1 2 x (0, y) = kb k sin(ky) cosh(ka) k 1 But e n+1/2 1 (0, y) = k cosh(kb) x sinh(kb) ên Γ(k) sin(ky) k 1 = e n+1 2 (x, y) = k 1 cosh(kb) sinh(k(x + a)) ê n cosh(ka) sinh(kb) Γ(k) sin(ky)
25 Convergence Analysis by Fourier Therefore, e n+1 Γ [ = ê n+1 Γ (k) = = (1 θ)eγ n + θe n+! 2 (0, y) = [ ( cosh(kb) sinh(ka) 1 θ 1 + cosh(ka) sinh(kb) k 1 ( 1 θ 1 + tanh(ka) )] ê n tanh(kb) Γ(k) } {{ } ρ(k,a,b,θ) Contraction factor depends on 1. Frequency k, 2. Geometry, i.e., relative sizes b and a of Ω 1 and Ω 2, 3. Relaxation parameter θ. If ρ(k, a, b, θ) < 1 for all k, then e n Γ 0 as n If ρ(k, a, b, θ) > 1 for some k, then iteration diverges )] ê n Γ(k) sin(ky)
26 Symmetric Domains (k) = ρ(k, a, b, θ)êγ(k) n ( ρ(k, a, b, θ) = 1 θ 1 + tanh(ka) tanh(kb) ê n+1 Γ ) If Ω 1 and Ω 2 have the same size, i.e., a = b, then ρ(k, a, b, θ) = 1 2θ Convergence independent of frequency k If θ = 1/2, then e n+1 Γ = 0 for all n 0 Exact solution obtained on Γ after one iteration One more subdomain solve to get solution everywhere
27 ; Unsymmetric Domains Example for a = 3, b = 1: a = 3, b = 1 3=0.1 3=0.2 3=0.3 3=0.4 3=0.5 3=0.6 3=0.7 3=0.8 3=0.9 3= k
28 ; Unsymmetric Domains Example for a = 1, b = 3: a = 1, b = 3 3=0.1 3=0.2 3=0.3 3=0.4 3=0.5 3=0.6 3=0.7 3=0.8 3=0.9 3= k
29 ; Unsymmetric Domains Example for a = 1, b = 3: a = 1, b = 3 3=0.1 3=0.2 3=0.3 3=0.4 3=0.5 3=0.6 3=0.7 3=0.8 3=0.9 3= k Want to choose θ to minimize ρ(k, a, b, θ) over all frequencies k, i.e., solve min max ρ(k, a, b, θ), θ k 0 where ( ρ(k, a, b, θ) = 1 θ 1 + tanh(ka) ) tanh(kb)
30 Unsymmetric Domains ( ρ k = θ sinh(2ka) sinh(2kb) ) { > 0, a > b, = pos.terms 2a 2b < 0, a < b. So ρ(k, a, b, θ) is monotonic in k with lim k 0 ρ = (1 θ) θa b, lim ρ = 1 2θ. k Therefore, the value of θ that minimizes ρ over all k is given by the equioscillation condition lim ρ k 0 = lim ρ k = θ opt = 2b a + 3b, ρ a b opt = a + 3b < 1.
31 ; ; Unsymmetric Domains Example for a = 1, b = 3: θ opt = 0.6, ρ opt = a = 1, b = 3,3 = k Example for a = 3, b = 1: θ opt = ρ opt = 1/3 1 a = 3, b = 1,3 = k
32 Outline Methods Without Overlap Dirichlet Neumann Method Neumann Neumann Method Discrete Formulation
33 Neumann Neumann Method (Bourgat, Glowinski, Le Tallec & Vidrascu 1989) Consider the elliptic problem u = f
34 Neumann Neumann (NN) Method Given Dirichlet traces g n 1,..., gn j 1 :
35 Neumann Neumann (NN) Method Given Dirichlet traces g n 1,..., gn j 1 : 1. Solve Dirichlet problems on Ω 1,..., Ω J : u n+1/2 i = f on Ω i u n+1/2 i = g i 1 on Γ i 1,i u n+1/2 i = g i on Γ i,i+1
36 Neumann Neumann (NN) Method Given Dirichlet traces g n 1,..., gn j 1 : 1. Solve Dirichlet problems on Ω 1,..., Ω J : 2. Calculate jumps in Neumann traces along Γ i 1,i : r n+1/2 i = un+1/2 i n i + un+1/2 i+1 n i+1
37 Neumann Neumann (NN) Method Given Dirichlet traces g n 1,..., gn j 1 : 3. Solve Neumann problems for corrections ψ n+1 i on Ω 1,..., Ω J : ψ n+1/2 i n i 1 ψ n+1/2 i = 0 on Ω i = r i 1, Γi 1,i ψ n+1/2 i = r n i i. Γi,i+1
38 Neumann Neumann (NN) Method Given Dirichlet traces g n 1,..., gn j 1 : 3. Solve Neumann problems for corrections ψ n+1 i on Ω 1,..., Ω J : 4. Update Dirichlet traces: g n+1 i = gi n θ(ψ n+1 i Γi + ψ n+1 i+1 Γ i ).
39 Convergence Analysis Assume two rectangular subdomains again: Analyze how the error goes to zero for the homogeneous problem
40 Convergence Analysis Fourier analysis gives for the Dirichlet solve e n+1/2 1 (x, y) = k 1 e n+1/2 2 (x, y) = k 1 sinh(k(b x)) ê n sinh(kb) Γ(k) sin(ky) sinh(k(x + a)) ê n sinh(ka) Γ(k) sin(ky)
41 Convergence Analysis The normal derivative thus becomes e n+1/2 1 (0, y) = k cosh(kb) x sinh(kb) ên Γ(k) sin(ky) k 1 n+1/2 e 2 (0, y) = k cosh(ka) x k 1 = r n+1/2 = k 1 k sinh(ka) ên Γ(k) sin(ky) ( cosh(ka) sinh(ka) + cosh(kb) sinh(kb) ) ê n Γ(k) sin(ky)
42 Convergence Analysis r n+1/2 = k 1 k The corrections ψ n+1 1, ψ n+1 2 satisfy ( cosh(ka) sinh(ka) + cosh(kb) ) ê n sinh(kb) Γ(k) sin(ky) ψ n+1 1 (x, y) = k 1 A k sinh(k(b x)) sin(ky) ψ n+1 2 (x, y) = k 1 B k sinh(k(x + a)) sin(ky)
43 Convergence Analysis r n+1/2 = k 1 k The corrections ψ n+1 1, ψ n+1 2 satisfy ( cosh(ka) sinh(ka) + cosh(kb) ) ê n sinh(kb) Γ(k) sin(ky) ψn+1 1 x (0, y) = ka k cosh(kb) sin(ky) = r n+1/2 k 1 ψ n+1 2 x (0, y) = kb k cosh(ka) sin(ky) = r n+1/2 k 1
44 Convergence Analysis r n+1/2 = k 1 k The corrections ψ n+1 1, ψ n+1 ( cosh(ka) sinh(ka) + cosh(kb) ) ê n sinh(kb) Γ(k) sin(ky) 2 satisfy ψ n+1 1 (x, y) = ( sinh(k(b x)) cosh(ka) cosh(kb) k 1 sinh(ka) + cosh(kb) sinh(kb) ψ n+1 2 (x, y) = ( sinh(k(x + a)) cosh(ka) cosh(ka) sinh(ka) + cosh(kb) sinh(kb) k 1 ) ê n Γ(k) sin(ky) ) ê n Γ(k) sin(ky)
45 Convergence Analysis ψ n+1 1 (x, y) = ( sinh(k(b x)) cosh(ka) cosh(kb) k 1 sinh(ka) + cosh(kb) sinh(kb) ψ n+1 2 (x, y) = ( sinh(k(x + a)) cosh(ka) cosh(ka) sinh(ka) + cosh(kb) sinh(kb) k 1 ) ê n Γ(k) sin(ky) ) ê n Γ(k) sin(ky) New interface trace satisfies where ρ(k, a, b, θ) = 1 θ e n+1 Γ = e n Γ θ(ψ n+1 1 (0, y) + ψ n+1 2 (0, y)) = k 1 ρ(k, a, b, θ)ê n Γ sin(ky) ( sinh(ka) cosh(ka) + sinh(kb) ) ( cosh(ka) cosh(kb) sinh(ka) + cosh(kb) ) sinh(kb)
46 Convergence Analysis ( sinh(ka) ρ(k, a, b, θ) = 1 θ cosh(ka) + sinh(kb) ) ( cosh(ka) cosh(kb) sinh(ka) + cosh(kb) ) sinh(kb) Expression symmetric in a and b If a = b, then ρ(k, a, b, θ) = 1 4θ = convergence independent of k = exact convergence after 1 iteration if θ = 1/4
47 ; Unsymmetric Domains Example for a = 3, b = 1: a = 3, b = 1 3=0.1 3=0.2 3=0.3 3=0.4 3= k ρ is increasing in k with ( a lim ρ = (1 2θ) θ k 0 b + b ), lim ρ = 1 4θ. a k
48 ; Unsymmetric Domains Equioscillation gives θ opt = 2ab (a + b) 2 + 4ab, ρ (a b) 2 opt = (a + b) 2 + 4ab Example for a = 3, b = 1: θ opt = 3/14, ρ opt = 1/7 1 a = 3, b = 1,3 = k
49 Outline Methods Without Overlap Dirichlet Neumann Method Neumann Neumann Method Discrete Formulation
50 Discrete subdomain problems Denote the (unknown) Neumann traces by u 1 λ(v) := v = n 1 Γ Γ u 2 n 2 v, for all v V h. Then integration by parts on Ω 1 gives u 1 u 1 v v = fv Ω i Γ n 1 Ω i Similarly, for Ω 2, we have u 1 = f 1 + λ A (2) u 2 = f 2 λ.
51 Matrix Formulation Partition the problem on Ω 1 into interior and interface unknowns: [ ] (u ) ( ) k IΓ 1I f1i ΓI u k = ΓΓ 1Γ f 1Γ + λ k ;
52 Matrix Formulation Partition the problem on Ω 1 into interior and interface unknowns: [ ] (u ) ( ) k IΓ 1I f1i ΓI u k = ΓΓ 1Γ f 1Γ + λ k ; Do the same for Ω 2 ; [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( ) f2i f 2Γ λ k ;
53 Matrix Formulation Partition the problem on Ω 1 into interior and interface unknowns: [ ] (u ) ( ) k IΓ 1I f1i ΓI u k = ΓΓ 1Γ f 1Γ + λ k ; Do the same for Ω 2 ; [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( ) f2i f 2Γ λ k ; This is consistent with the assembled matrix 11 0 IΓ u 1I f 1I 0 A (2) A (2) IΓ u 2I = f 2I. ΓI A (2) ΓI ΓΓ + A(2) u Γ f 1Γ + f 2Γ ΓΓ
54 Dirichlet-Neumann in Matrix Form Recall subdomain problem on Ω 1 : [ ] (u ) k IΓ 1I ΓI u k = ΓΓ 1Γ ( f1i ) f 1Γ + λ k 1. Solve Dirichlet problem on Ω 1 with u k 1 = gk on Γ: u k 1I + IΓ gk = f 1I u k 1I = ( ) 1 (f 1I IΓ gk )
55 Dirichlet-Neumann in Matrix Form Recall subdomain problem on Ω 1 : [ ] (u ) k IΓ 1I ΓI u k = ΓΓ 1Γ ( f1i ) f 1Γ + λ k 1. Solve Dirichlet problem on Ω 1 with u k 1 = gk on Γ: 2. Calculate interface condition λ k : u k 1I + IΓ gk = f 1I u k 1I = ( ) 1 (f 1I IΓ gk ) λ k = ΓI u k 1I + ΓΓ gk f 1Γ
56 Dirichlet-Neumann in Matrix Form Recall subdomain problem on Ω 1 : [ ] (u ) k IΓ 1I ΓI u k = ΓΓ 1Γ ( f1i ) f 1Γ + λ k 1. Solve Dirichlet problem on Ω 1 with u k 1 = gk on Γ: 2. Calculate interface condition λ k : u k 1I + IΓ gk = f 1I u k 1I = ( ) 1 (f 1I IΓ gk ) λ k = ΓI ( ) 1 (1) f 1I f 1Γ + (AΓΓ }{{} A(1) ΓI ΓI IΓ }{{} ) f1γ S 1 k g
57 Dirichlet-Neumann in Matrix Form Recall subdomain problem on Ω 1 : [ ] (u ) k IΓ 1I ΓI u k = ΓΓ 1Γ ( f1i ) f 1Γ + λ k 1. Solve Dirichlet problem on Ω 1 with u k 1 = gk on Γ: 2. Calculate interface condition λ k : u k 1I + IΓ gk = f 1I u k 1I = ( ) 1 (f 1I IΓ gk ) λ k = f 1Γ S 1 g k Note: Dirichlet-to-Neumann map in matrix form!
58 Dirichlet-Neumann in Matrix Form 3. Solve Neumann problem on Ω 2 : [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ A (2) u k 2I + A (2) IΓ uk 2Γ = f 2I ( f2i ) f 2Γ λ k A (2) ΓI u k 2I + A (2) ΓΓ uk 2Γ = f 2Γ λ k
59 Dirichlet-Neumann in Matrix Form 3. Solve Neumann problem on Ω 2 : [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( f2i ) f 2Γ λ k u k 2I = (A (2) ) 1 (f 2I A (2) IΓ uk 2Γ) A (2) ΓI u k 2I + A (2) ΓΓ uk 2Γ = f 2Γ λ k
60 Dirichlet-Neumann in Matrix Form 3. Solve Neumann problem on Ω 2 : [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( f2i ) f 2Γ λ k u k 2I = (A (2) ) 1 (f 2I A (2) IΓ uk 2Γ) (A (2) ΓΓ A(2) ΓI (A (2) ) 1 A (2) IΓ }{{} ) S 2 k u 2Γ = f 2Γ A (2) ΓI (A (2) ) 1 f 2I }{{} f2 + f 1 S 1 g k }{{} λ k
61 Dirichlet-Neumann in Matrix Form 3. Solve Neumann problem on Ω 2 : [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( f2i ) f 2Γ λ k u k 2I = (A (2) ) 1 (f 2I A (2) IΓ uk 2Γ) (A (2) ΓΓ A(2) ΓI (A (2) ) 1 A (2) IΓ }{{} ) S 2 k u 2Γ = f 2Γ A (2) ΓI (A (2) ) 1 f 2I }{{} f2 k + f 1 S 1 g }{{} λ k 4. Update interface trace: g k+1 = (1 θ)g k + θu k 2Γ
62 Dirichlet-Neumann in Matrix Form 3. Solve Neumann problem on Ω 2 : [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( f2i ) f 2Γ λ k u k 2I = (A (2) ) 1 (f 2I A (2) IΓ uk 2Γ) (A (2) ΓΓ A(2) ΓI (A (2) ) 1 A (2) IΓ }{{} ) S 2 k u 2Γ = f 2Γ A (2) ΓI (A (2) ) 1 f 2I }{{} f2 k + f 1 S 1 g }{{} λ k 4. Update interface trace: g k+1 = [(1 θ)i θs 1 2 S 1]g k + θs 1 2 ( f 1 + f 2 )
63 Dirichlet-Neumann in Matrix Form 3. Solve Neumann problem on Ω 2 : [ ] (u A (2) A (2) ) k IΓ 2I A (2) ΓI A (2) u k = ΓΓ 2Γ ( f2i ) f 2Γ λ k u k 2I = (A (2) ) 1 (f 2I A (2) IΓ uk 2Γ) (A (2) ΓΓ A(2) ΓI (A (2) ) 1 A (2) IΓ }{{} ) S 2 k u 2Γ = f 2Γ A (2) ΓI (A (2) ) 1 f 2I }{{} f2 k + f 1 S 1 g }{{} λ k 4. Update interface trace: g k+1 = [I θs 1 2 (S 1 + S 2 )]g k + θs 1 2 ( f 1 + f 2 )
64 Dirichlet-Neumann in Matrix Form g k+1 = [I θs 1 2 (S 1 + S 2 )]g k + θs 1 2 ( f 1 + f 2 ) At convergence, the fixed point g satisfies θs 1 2 (S 1 + S 2 )g = S 1 2 ( f 1 + f 2 ) Thus, DN is an iteration for solving the primal Schur complment problem (S 1 + S 2 )g = f 1 + f 2 with preconditioner M = θ 1 S 2.
65 Neumann-Neumann in Matrix form By a similar argument, one can show that the Neumann-Neumann method is equivalent to the stationary iteration g k+1 = [I θ(s S 1 2 )(S 1 + S 2 )]g k + θ(s S 1 2 )( f 1 + f 2 ) So we are still solving the primal Schur system (S 1 + S 2 )g = f 1 + f 2, but with the preconditioner M = θ(s S 1 2 ) instead.
66 Why preconditioning? A fixed point iteration can be accelerated using Krylov methods such as Conjugate Gradient or GMRES (see talk by M.J. Gander) For CG, convergence is determined by the ratio of extreme eigenvalues λ max /λ min For our two-subdomain example with rectangular geometry, it was possible use Fourier to diagonalize A or M 1 A λ min corresponds to low frequency k 0, and λ max to high frequency k = k max = π/h
67 Why preconditioning? No precond: DN: NN: ( ) 1 λ k (A) = k tanh(ka) + 1 tanh(kb) λ min = 1 a + 1 b, λ max 2k max λ k (M 1 A) = 1 + tanh(ka) tanh(kb) λ min = 2, λ max = 1 + a (a > b) b λ k (M 1 A) = 2 + tanh(ka) tanh(kb) + tanh(kb) tanh(ka) λ min = 4, λ max = 2 + a b + b a Preconditioned methods converge independently of mesh size!
68 DN and NN as Preconditioners Example: a = 3, b = DN DN+CG NN 10-2 NN+CG
69 Dual Schur Problem Instead of using u Γ as primary variable, one could use the Neumann trace λ instead, where [ ] (u1i IΓ ΓI ΓΓ ) = u 1Γ ( ) f1i f 1Γ + λ
70 Dual Schur Problem Instead of using u Γ as primary variable, one could use the Neumann trace λ instead, where [ ] (u1i ) IΓ ΓI ΓΓ u 1Γ = S 1 u 1Γ = f 1 + λ ( ) f1i f 1Γ + λ
71 Dual Schur Problem Instead of using u Γ as primary variable, one could use the Neumann trace λ instead, where [ ] (u1i ) IΓ ΓI ΓΓ u 1Γ = u 1Γ = S 1 1 ( f 1 + λ) ( ) f1i f 1Γ + λ
72 Dual Schur Problem Instead of using u Γ as primary variable, one could use the Neumann trace λ instead, where [ ] (u1i ) IΓ ΓI ΓΓ u 1Γ = u 1Γ = S 1 1 ( f 1 + λ) ( ) f1i f 1Γ + λ u 2Γ = S 1 2 ( f 2 λ)
73 Dual Schur Problem Instead of using u Γ as primary variable, one could use the Neumann trace λ instead, where [ ] (u1i IΓ ΓI ΓΓ ) = u 1Γ u 1Γ = S 1 1 ( f 1 + λ) ( ) f1i f 1Γ + λ Impose continuity: u 2Γ = S 1 2 ( f 2 λ) S 1 1 ( f 1 + λ) = S 1 2 ( f 2 λ)
74 Dual Schur Problem Instead of using u Γ as primary variable, one could use the Neumann trace λ instead, where [ ] (u1i IΓ ΓI ΓΓ ) = u 1Γ u 1Γ = S 1 1 ( f 1 + λ) ( ) f1i f 1Γ + λ Impose continuity: u 2Γ = S 1 2 ( f 2 λ) (S S 1 2 )λ = S 1 f 2 2 S 1 1 f 1 This is the dual Schur complement problem, which becomes FETI when preconditioned appropriately.
75 Summary 1. DN and NN methods: explicitly match derivatives, work for non-overlapping subdomains 2. Interpretation in terms of DtN operators 3. Analysis for two subdomains using Fourier 4. DN and NN as preconditioners = near grid-independent convergence
Construction of a New Domain Decomposition Method for the Stokes Equations
Construction of a New Domain Decomposition Method for the Stokes Equations Frédéric Nataf 1 and Gerd Rapin 2 1 CMAP, CNRS; UMR7641, Ecole Polytechnique, 91128 Palaiseau Cedex, France 2 Math. Dep., NAM,
More informationFrom Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D
From Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D Luc Giraud N7-IRIT, Toulouse MUMPS Day October 24, 2006, ENS-INRIA, Lyon, France Outline 1 General Framework 2 The direct
More informationCapacitance Matrix Method
Capacitance Matrix Method Marcus Sarkis New England Numerical Analysis Day at WPI, 2019 Thanks to Maksymilian Dryja, University of Warsaw 1 Outline 1 Timeline 2 Capacitance Matrix Method-CMM 3 Applications
More informationConvergence Behavior of a Two-Level Optimized Schwarz Preconditioner
Convergence Behavior of a Two-Level Optimized Schwarz Preconditioner Olivier Dubois 1 and Martin J. Gander 2 1 IMA, University of Minnesota, 207 Church St. SE, Minneapolis, MN 55455 dubois@ima.umn.edu
More informationNew constructions of domain decomposition methods for systems of PDEs
New constructions of domain decomposition methods for systems of PDEs Nouvelles constructions de méthodes de décomposition de domaine pour des systèmes d équations aux dérivées partielles V. Dolean?? F.
More informationBETI for acoustic and electromagnetic scattering
BETI for acoustic and electromagnetic scattering O. Steinbach, M. Windisch Institut für Numerische Mathematik Technische Universität Graz Oberwolfach 18. Februar 2010 FWF-Project: Data-sparse Boundary
More informationA Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems
A Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems Etereldes Gonçalves 1, Tarek P. Mathew 1, Markus Sarkis 1,2, and Christian E. Schaerer 1 1 Instituto de Matemática Pura
More informationDomain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions
Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions Ernst P. Stephan 1, Matthias Maischak 2, and Thanh Tran 3 1 Institut für Angewandte Mathematik, Leibniz
More informationDomain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions
Domain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions Bernhard Hientzsch Courant Institute of Mathematical Sciences, New York University, 51 Mercer Street, New
More informationAN INTRODUCTION TO DOMAIN DECOMPOSITION METHODS. Gérard MEURANT CEA
Marrakech Jan 2003 AN INTRODUCTION TO DOMAIN DECOMPOSITION METHODS Gérard MEURANT CEA Introduction Domain decomposition is a divide and conquer technique Natural framework to introduce parallelism in the
More informationExtending the theory for domain decomposition algorithms to less regular subdomains
Extending the theory for domain decomposition algorithms to less regular subdomains Olof Widlund Courant Institute of Mathematical Sciences New York University http://www.cs.nyu.edu/cs/faculty/widlund/
More informationA High-Performance Parallel Hybrid Method for Large Sparse Linear Systems
Outline A High-Performance Parallel Hybrid Method for Large Sparse Linear Systems Azzam Haidar CERFACS, Toulouse joint work with Luc Giraud (N7-IRIT, France) and Layne Watson (Virginia Polytechnic Institute,
More informationOptimized Schwarz methods with overlap for the Helmholtz equation
Optimized Schwarz methods with overlap for the Helmholtz equation Martin J. Gander and Hui Zhang Introduction For the Helmholtz equation, simple absorbing conditions of the form n iω were proposed as transmission
More informationOptimal Interface Conditions for an Arbitrary Decomposition into Subdomains
Optimal Interface Conditions for an Arbitrary Decomposition into Subdomains Martin J. Gander and Felix Kwok Section de mathématiques, Université de Genève, Geneva CH-1211, Switzerland, Martin.Gander@unige.ch;
More informationASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM
ASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM C. Canuto 1, L. F. Pavarino 2, and A. B. Pieri 3 1 Introduction Discontinuous Galerkin (DG) methods for partial differential
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 informationCONVERGENCE ANALYSIS OF A BALANCING DOMAIN DECOMPOSITION METHOD FOR SOLVING A CLASS OF INDEFINITE LINEAR SYSTEMS
CONVERGENCE ANALYSIS OF A BALANCING DOMAIN DECOMPOSITION METHOD FOR SOLVING A CLASS OF INDEFINITE LINEAR SYSTEMS JING LI AND XUEMIN TU Abstract A variant of balancing domain decomposition method by constraints
More informationMultispace and Multilevel BDDC. Jan Mandel University of Colorado at Denver and Health Sciences Center
Multispace and Multilevel BDDC Jan Mandel University of Colorado at Denver and Health Sciences Center Based on joint work with Bedřich Sousedík, UCDHSC and Czech Technical University, and Clark R. Dohrmann,
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 information20. A Dual-Primal FETI Method for solving Stokes/Navier-Stokes Equations
Fourteenth International Conference on Domain Decomposition Methods Editors: Ismael Herrera, David E. Keyes, Olof B. Widlund, Robert Yates c 23 DDM.org 2. A Dual-Primal FEI Method for solving Stokes/Navier-Stokes
More informationOPTIMIZED SCHWARZ METHODS
SIAM J. NUMER. ANAL. Vol. 44, No., pp. 699 31 c 006 Society for Industrial and Applied Mathematics OPTIMIZED SCHWARZ METHODS MARTIN J. GANDER Abstract. Optimized Schwarz methods are a new class of Schwarz
More informationADDITIVE SCHWARZ FOR SCHUR COMPLEMENT 305 the parallel implementation of both preconditioners on distributed memory platforms, and compare their perfo
35 Additive Schwarz for the Schur Complement Method Luiz M. Carvalho and Luc Giraud 1 Introduction Domain decomposition methods for solving elliptic boundary problems have been receiving increasing attention
More informationConvergence analysis of a balancing domain decomposition method for solving a class of indefinite linear systems
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2000; 00:1 6 [Version: 2002/09/18 v1.02] Convergence analysis of a balancing domain decomposition method for solving a class of indefinite
More informationIntroduction to Domain Decomposition Methods. Alfio Quarteroni
. Aachen, EU Regional School Series February 18, 2013 Introduction to Domain Decomposition Methods Alfio Quarteroni Chair of Modeling and Scientific Computing Mathematics Institute of Computational Science
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 11, pp. 1-24, 2000. Copyright 2000,. ISSN 1068-9613. ETNA NEUMANN NEUMANN METHODS FOR VECTOR FIELD PROBLEMS ANDREA TOSELLI Abstract. In this paper,
More informationMultipréconditionnement adaptatif pour les méthodes de décomposition de domaine. Nicole Spillane (CNRS, CMAP, École Polytechnique)
Multipréconditionnement adaptatif pour les méthodes de décomposition de domaine Nicole Spillane (CNRS, CMAP, École Polytechnique) C. Bovet (ONERA), P. Gosselet (ENS Cachan), A. Parret Fréaud (SafranTech),
More informationIndefinite and physics-based preconditioning
Indefinite and physics-based preconditioning Jed Brown VAW, ETH Zürich 2009-01-29 Newton iteration Standard form of a nonlinear system F (u) 0 Iteration Solve: Update: J(ũ)u F (ũ) ũ + ũ + u Example (p-bratu)
More informationAn additive average Schwarz method for the plate bending problem
J. Numer. Math., Vol. 10, No. 2, pp. 109 125 (2002) c VSP 2002 Prepared using jnm.sty [Version: 02.02.2002 v1.2] An additive average Schwarz method for the plate bending problem X. Feng and T. Rahman Abstract
More informationSpace-Time Nonconforming Optimized Schwarz Waveform Relaxation for Heterogeneous Problems and General Geometries
Space-Time Nonconforming Optimized Schwarz Waveform Relaxation for Heterogeneous Problems and General Geometries Laurence Halpern, Caroline Japhet, and Jérémie Szeftel 3 LAGA, Université Paris XIII, Villetaneuse
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 informationCoupled FETI/BETI for Nonlinear Potential Problems
Coupled FETI/BETI for Nonlinear Potential Problems U. Langer 1 C. Pechstein 1 A. Pohoaţǎ 1 1 Institute of Computational Mathematics Johannes Kepler University Linz {ulanger,pechstein,pohoata}@numa.uni-linz.ac.at
More informationThe All-floating BETI Method: Numerical Results
The All-floating BETI Method: Numerical Results Günther Of Institute of Computational Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria, of@tugraz.at Summary. The all-floating
More informationcfl Jing Li All rights reserved, 22
NYU-CS-TR83 Dual-Primal FETI Methods for Stationary Stokes and Navier-Stokes Equations by Jing Li A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
More informationSpace-Time Domain Decomposition Methods for Transport Problems in Porous Media
1 / 49 Space-Time Domain Decomposition Methods for Transport Problems in Porous Media Thi-Thao-Phuong Hoang, Elyes Ahmed, Jérôme Jaffré, Caroline Japhet, Michel Kern, Jean Roberts INRIA Paris-Rocquencourt
More informationAcceleration of a Domain Decomposition Method for Advection-Diffusion Problems
Acceleration of a Domain Decomposition Method for Advection-Diffusion Problems Gert Lube 1, Tobias Knopp 2, and Gerd Rapin 2 1 University of Göttingen, Institute of Numerical and Applied Mathematics (http://www.num.math.uni-goettingen.de/lube/)
More informationMultilevel and Adaptive Iterative Substructuring Methods. Jan Mandel University of Colorado Denver
Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver The multilevel BDDC method is joint work with Bedřich Sousedík, Czech Technical University, and Clark Dohrmann,
More informationANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow
ANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow Michel Kern Inria Paris Rocquencourt Maison de la Simulation C2S@Exa Days, Inria Paris Centre, Novembre 2016 M. Kern
More informationOUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU
Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative
More informationEFFICIENT NUMERICAL TREATMENT OF HIGH-CONTRAST DIFFUSION PROBLEMS
EFFICIENT NUMERICAL TREATMENT OF HIGH-CONTRAST DIFFUSION PROBLEMS A Dissertation Presented to the Faculty of the Department of Mathematics University of Houston In Partial Fulfillment of the Requirements
More informationParallel scalability of a FETI DP mortar method for problems with discontinuous coefficients
Parallel scalability of a FETI DP mortar method for problems with discontinuous coefficients Nina Dokeva and Wlodek Proskurowski University of Southern California, Department of Mathematics Los Angeles,
More informationAdditive Schwarz method for scattering problems using the PML method at interfaces
Additive Schwarz method for scattering problems using the PML method at interfaces Achim Schädle 1 and Lin Zschiedrich 2 1 Zuse Institute, Takustr. 7, 14195 Berlin, Germany schaedle@zib.de 2 Zuse Institute,
More informationContents. Preface... xi. Introduction...
Contents Preface... xi Introduction... xv Chapter 1. Computer Architectures... 1 1.1. Different types of parallelism... 1 1.1.1. Overlap, concurrency and parallelism... 1 1.1.2. Temporal and spatial parallelism
More informationTHE OPTIMISED SCHWARZ METHOD AND THE TWO-LAGRANGE MULTIPLIER METHOD FOR HETEROGENEOUS PROBLEMS. by Neil Greer
THE OPTIMISED SCHWARZ METHOD AND THE TWO-LAGRANGE MULTIPLIER METHOD FOR HETEROGENEOUS PROBLEMS by Neil Greer Submitted for the degree of Doctor of Philosophy Department of Mathematics School of Mathematical
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.fu-berlin.de/rd/we-02/numerik/)
More informationarxiv: v2 [math.na] 5 Jan 2017
Noname manuscript No. (will be inserted by the editor) Pipeline Implementations of Neumann Neumann and Dirichlet Neumann Waveform Relaxation Methods Benjamin W. Ong Bankim C. Mandal arxiv:1605.08503v2
More informationLinear and Non-Linear Preconditioning
and Non- martin.gander@unige.ch University of Geneva July 2015 Joint work with Victorita Dolean, Walid Kheriji, Felix Kwok and Roland Masson (1845): First Idea of After preconditioning, it takes only three
More informationA Parallel Schwarz Method for Multiple Scattering Problems
A Parallel Schwarz Method for Multiple Scattering Problems Daisuke Koyama The University of Electro-Communications, Chofu, Japan, koyama@imuecacjp 1 Introduction Multiple scattering of waves is one of
More informationPreface to the Second Edition. Preface to the First Edition
n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................
More informationDomain decomposition for the Jacobi-Davidson method: practical strategies
Chapter 4 Domain decomposition for the Jacobi-Davidson method: practical strategies Abstract The Jacobi-Davidson method is an iterative method for the computation of solutions of large eigenvalue problems.
More informationAdaptive Coarse Space Selection in BDDC and FETI-DP Iterative Substructuring Methods: Towards Fast and Robust Solvers
Adaptive Coarse Space Selection in BDDC and FETI-DP Iterative Substructuring Methods: Towards Fast and Robust Solvers Jan Mandel University of Colorado at Denver Bedřich Sousedík Czech Technical University
More informationA Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation
A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition
More informationParallel Scalability of a FETI DP Mortar Method for Problems with Discontinuous Coefficients
Parallel Scalability of a FETI DP Mortar Method for Problems with Discontinuous Coefficients Nina Dokeva and Wlodek Proskurowski Department of Mathematics, University of Southern California, Los Angeles,
More informationDomain Decomposition solvers (FETI)
Domain Decomposition solvers (FETI) a random walk in history and some current trends Daniel J. Rixen Technische Universität München Institute of Applied Mechanics www.amm.mw.tum.de rixen@tum.de 8-10 October
More informationarxiv: v1 [math.na] 14 May 2016
NONLINEAR PRECONDITIONING: HOW TO USE A NONLINEAR SCHWARZ METHOD TO PRECONDITION NEWTON S METHOD V. DOLEAN, M.J. GANDER, W. KHERIJI, F. KWOK, AND R. MASSON arxiv:65.449v [math.na] 4 May 6 Abstract. For
More informationIncomplete Cholesky preconditioners that exploit the low-rank property
anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
More informationShort title: Total FETI. Corresponding author: Zdenek Dostal, VŠB-Technical University of Ostrava, 17 listopadu 15, CZ Ostrava, Czech Republic
Short title: Total FETI Corresponding author: Zdenek Dostal, VŠB-Technical University of Ostrava, 17 listopadu 15, CZ-70833 Ostrava, Czech Republic mail: zdenek.dostal@vsb.cz fax +420 596 919 597 phone
More informationAn Adaptive Multipreconditioned Conjugate Gradient Algorithm
An Adaptive Multipreconditioned Conjugate Gradient Algorithm Nicole Spillane To cite this version: Nicole Spillane. An Adaptive Multipreconditioned Conjugate Gradient Algorithm. 2016. HAL Id: hal-01170059
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 informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationSchur Complement Technique for Advection-Diffusion Equation using Matching Structured Finite Volumes
Advances in Dynamical Systems and Applications ISSN 973-5321, Volume 8, Number 1, pp. 51 62 (213) http://campus.mst.edu/adsa Schur Complement Technique for Advection-Diffusion Equation using Matching Structured
More informationSchwarz Preconditioner for the Stochastic Finite Element Method
Schwarz Preconditioner for the Stochastic Finite Element Method Waad Subber 1 and Sébastien Loisel 2 Preprint submitted to DD22 conference 1 Introduction The intrusive polynomial chaos approach for uncertainty
More informationSome examples in domain decomposition
Some examples in domain decomposition Frédéric Nataf nataf@ann.jussieu.fr, www.ann.jussieu.fr/ nataf Laboratoire J.L. Lions, CNRS UMR7598. Université Pierre et Marie Curie, France Joint work with V. Dolean
More informationGenerating Equidistributed Meshes in 2D via Domain Decomposition
Generating Equidistributed Meshes in 2D via Domain Decomposition Ronald D. Haynes and Alexander J. M. Howse 2 Introduction There are many occasions when the use of a uniform spatial grid would be prohibitively
More informationHeriot-Watt University
Heriot-Watt University Heriot-Watt University Research Gateway The optimised Schwarz method and the two-lagrange multiplier method for heterogeneous problems in general domains with two general subdomains
More informationCoupling Stokes and Darcy equations: modeling and numerical methods
Coupling Stokes and Darcy equations: modeling and numerical methods Marco Discacciati NM2PorousMedia 24 Dubrovnik, September 29, 24 Acknowledgment: European Union Seventh Framework Programme (FP7/27-23),
More informationDivergence-conforming multigrid methods for incompressible flow problems
Divergence-conforming multigrid methods for incompressible flow problems Guido Kanschat IWR, Universität Heidelberg Prague-Heidelberg-Workshop April 28th, 2015 G. Kanschat (IWR, Uni HD) Hdiv-DG Práha,
More informationON THE OPTIMAL CONVERGENCE RATE OF A ROBIN-ROBIN DOMAIN DECOMPOSITION METHOD * 1. Introduction
Journal of Computational Mathematics Vol.32, No.4, 2014, 456 475. http://www.global-sci.org/jcm doi:10.4208/jcm.1403-m4391 ON THE OPTIMAL CONVERGENCE RATE OF A ROBIN-ROBIN DOMAIN DECOMPOSITION METHOD *
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationIterative versus direct parallel substructuring methods in semiconductor device modeling
Iterative versus direct parallel substructuring methods in semiconductor device modeling L. Giraud, A. Marrocco, J.-C. Rioual TR/PA/02/114 Abstract The numerical simulation of semiconductor devices is
More information7.4 The Saddle Point Stokes Problem
346 CHAPTER 7. APPLIED FOURIER ANALYSIS 7.4 The Saddle Point Stokes Problem So far the matrix C has been diagonal no trouble to invert. This section jumps to a fluid flow problem that is still linear (simpler
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More informationFEM-FEM and FEM-BEM Coupling within the Dune Computational Software Environment
FEM-FEM and FEM-BEM Coupling within the Dune Computational Software Environment Alastair J. Radcliffe Andreas Dedner Timo Betcke Warwick University, Coventry University College of London (UCL) U.K. Radcliffe
More informationOn deflation and singular symmetric positive semi-definite matrices
Journal of Computational and Applied Mathematics 206 (2007) 603 614 www.elsevier.com/locate/cam On deflation and singular symmetric positive semi-definite matrices J.M. Tang, C. Vuik Faculty of Electrical
More informationShifted Laplace and related preconditioning for the Helmholtz equation
Shifted Laplace and related preconditioning for the Helmholtz equation Ivan Graham and Euan Spence (Bath, UK) Collaborations with: Paul Childs (Schlumberger Gould Research), Martin Gander (Geneva) Douglas
More informationOn the Use of Inexact Subdomain Solvers for BDDC Algorithms
On the Use of Inexact Subdomain Solvers for BDDC Algorithms Jing Li a, and Olof B. Widlund b,1 a Department of Mathematical Sciences, Kent State University, Kent, OH, 44242-0001 b Courant Institute of
More informationFrom the Boundary Element Domain Decomposition Methods to Local Trefftz Finite Element Methods on Polyhedral Meshes
From the Boundary Element Domain Decomposition Methods to Local Trefftz Finite Element Methods on Polyhedral Meshes Dylan Copeland 1, Ulrich Langer 2, and David Pusch 3 1 Institute of Computational Mathematics,
More informationDOMAIN DECOMPOSITION APPROACHES FOR MESH GENERATION VIA THE EQUIDISTRIBUTION PRINCIPLE
DOMAIN DECOMPOSITION APPROACHES FOR MESH GENERATION VIA THE EQUIDISTRIBUTION PRINCIPLE MARTIN J. GANDER AND RONALD D. HAYNES Abstract. Moving mesh methods based on the equidistribution principle are powerful
More informationOptimized Schwarz methods in spherical geometry with an overset grid system
Optimized Schwarz methods in spherical geometry with an overset grid system J. Côté 1, M. J. Gander 2, L. Laayouni 3, and A. Qaddouri 4 1 Recherche en prévision numérique, Meteorological Service of Canada,
More informationGoal. Robust A Posteriori Error Estimates for Stabilized Finite Element Discretizations of Non-Stationary Convection-Diffusion Problems.
Robust A Posteriori Error Estimates for Stabilized Finite Element s of Non-Stationary Convection-Diffusion Problems L. Tobiska and R. Verfürth Universität Magdeburg Ruhr-Universität Bochum www.ruhr-uni-bochum.de/num
More informationIntroduction to Domain Decomposition Methods in the numerical approximation of PDEs. Luca Gerardo-Giorda
Introduction to Domain Decomposition Methods in the numerical approximation of PDEs Luca Gerardo-Giorda Plan 0 Motivation Non-overlapping domain decomposition methods Multi-domain formulation Variational
More informationTwo-scale Dirichlet-Neumann preconditioners for boundary refinements
Two-scale Dirichlet-Neumann preconditioners for boundary refinements Patrice Hauret 1 and Patrick Le Tallec 2 1 Graduate Aeronautical Laboratories, MS 25-45, California Institute of Technology Pasadena,
More informationA Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems
Contemporary Mathematics Volume 8, 998 B 0-88-0988--03030- A Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems Daoqi Yang. Introduction
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 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 informationSchwarz-type methods and their application in geomechanics
Schwarz-type methods and their application in geomechanics R. Blaheta, O. Jakl, K. Krečmer, J. Starý Institute of Geonics AS CR, Ostrava, Czech Republic E-mail: stary@ugn.cas.cz PDEMAMIP, September 7-11,
More informationStabilization and Acceleration of Algebraic Multigrid Method
Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration
More informationThe Deflation Accelerated Schwarz Method for CFD
The Deflation Accelerated Schwarz Method for CFD J. Verkaik 1, C. Vuik 2,, B.D. Paarhuis 1, and A. Twerda 1 1 TNO Science and Industry, Stieltjesweg 1, P.O. Box 155, 2600 AD Delft, The Netherlands 2 Delft
More informationSharp condition number estimates for the symmetric 2-Lagrange multiplier method
Sharp condition number estimates for the symmetric -Lagrange multiplier method Stephen W. Drury and Sébastien Loisel Abstract Domain decomposition methods are used to find the numerical solution of large
More informationANALYSIS OF THE PARALLEL SCHWARZ METHOD FOR GROWING CHAINS OF FIXED-SIZED SUBDOMAINS: PART I
3 4 5 6 7 8 9 0 3 4 5 6 7 8 9 0 3 4 5 6 7 8 9 30 3 3 33 34 35 36 37 38 39 40 4 4 43 44 ANALYSIS OF THE PARALLEL SCHWARZ METHOD FOR GROWING CHAINS OF FIXED-SIZED SUBDOMAINS: PART I G. CIARAMELLA AND M.
More informationLinear and Non-Linear Preconditioning
and Non- martin.gander@unige.ch University of Geneva June 2015 Invents an Iterative Method in a Letter (1823), in a letter to Gerling: in order to compute a least squares solution based on angle measurements
More information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
More informationMaster Thesis Literature Study Presentation
Master Thesis Literature Study Presentation Delft University of Technology The Faculty of Electrical Engineering, Mathematics and Computer Science January 29, 2010 Plaxis Introduction Plaxis Finite Element
More informationarxiv:submit/ [math.na] 19 Dec 2011
ON A ROBIN-ROBIN DOMAIN DECOMPOSITION METHOD WITH OPTIMAL CONVERGENCE RATE WENBIN CHEN, XUEJUN XU, AND SHANGYOU ZHANG arxiv:submit/0383380 [math.na] 19 Dec 2011 Abstract. In this paper, we shall solve
More informationTwo-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations
Two-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations Marcella Bonazzoli 2, Victorita Dolean 1,4, Ivan G. Graham 3, Euan A. Spence 3, Pierre-Henri Tournier
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 e-mail: john.pearson@worc.ox.ac.uk, takacs@maths.ox.ac.uk
More informationMultilevel Low-Rank Preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota. Modelling 2014 June 2,2014
Multilevel Low-Rank Preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota Modelling 24 June 2,24 Dedicated to Owe Axelsson at the occasion of his 8th birthday
More informationOVERLAPPING SCHWARZ ALGORITHMS FOR ALMOST INCOMPRESSIBLE LINEAR ELASTICITY TR
OVERLAPPING SCHWARZ ALGORITHMS FOR ALMOST INCOMPRESSIBLE LINEAR ELASTICITY MINGCHAO CAI, LUCA F. PAVARINO, AND OLOF B. WIDLUND TR2014-969 Abstract. Low order finite element discretizations of the linear
More information1. Fast Solvers and Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl)
DDM Preprint Editors: editor1, editor2, editor3, editor4 c DDM.org 1. Fast Solvers and Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl) Bernhard Hientzsch 1 1. Introduction.
More informationTR THREE-LEVEL BDDC IN THREE DIMENSIONS
R2005-862 REE-LEVEL BDDC IN REE DIMENSIONS XUEMIN U Abstract BDDC methods are nonoverlapping iterative substructuring domain decomposition methods for the solution of large sparse linear algebraic systems
More information