Substructuring for multiscale problems

Size: px
Start display at page:

Download "Substructuring for multiscale problems"

Transcription

1 Substructuring for multiscale problems Clemens Pechstein Johannes Kepler University Linz (A) jointly with Rob Scheichl Marcus Sarkis Clark Dohrmann DD 21, Rennes, June 2012

2 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 2 / 38

3 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 3 / 38

4 Model Problem Find u H 1 (Ω), u ΓD = 0 Ω R d d = 2, 3 Ω α u v dx = f (v) v H 1 (Ω), v ΓD = 0 strongly varying coefficient α L + (Ω) (uniformly positive) Conditioning of FE system: ( α(x) ) sup x,y Ω α(y) }{{} O(10 3 ) O(10 10 ) h 2 Goal: iterative solvers, robust in h and α towards applications: porous media flows oil reservoir simulation elasticitiy with heterogeneous material nonlinear magnetostatics Clemens Pechstein Substructuring for multiscale problems 4 / 38

5 Spectral properties I spectrum square.dat -- H/h=32 B=I unit square uniform mesh h = 1/32 pure Neumann problem 1e σ(k h,α ) 1e-06 1e-08 1e-10 1e spectrum many_large_islands.dat -- H/h=32 B=I spectrum many_large_islands_qm.dat -- H/h=32 B=I 1e+06 1e e-06 1e-06 1e-08 1e-08 1e-10 1e-10 1e e Clemens Pechstein Substructuring for multiscale problems 5 / 38

6 Spectral properties II spectrum square.dat -- H/h=32 B=Kdiag unit square uniform mesh h = 1/32 pure Neumann problem σ(diag(k h,α ) 1 K h,α ) 1e e-06 1e-08 1e-10 1e spectrum many_large_islands.dat -- H/h=32 B=Kdiag spectrum many_large_islands_qm.dat -- H/h=32 B=Kdiag 1e+06 1e e-06 1e-06 1e-08 1e-08 1e-10 1e-10 1e e Clemens Pechstein Substructuring for multiscale problems 5 / 38

7 Spectral properties III unit square uniform mesh h = 1/32 pure Neumann problem σ(m 1 h,α K h,α) 1e e-06 1e-08 1e-10 1e-12 spectrum square.dat -- H/h=32 B=Malpha spectrum many_large_islands.dat -- H/h=32 B=Malpha 1e e-06 1e-08 1e-10 1e e-06 1e-08 1e-10 spectrum many_large_islands_qm.dat -- H/h=32 B=Malpha 1e e Clemens Pechstein Substructuring for multiscale problems 5 / 38

8 Weighted Poincaré Inequality (WPI) domain D, coefficient α L + (D) Definition C P,α (D) smallest constant such that u H 1 (D): inf c R u c L 2 (D),α C P,α (D) diam(d) u }{{} H 1 (D),α λ 2 (M 1 h,α K h,α) 1/2 where [Chua] [Chua & Wheeden] [Veeser & Verfürth] [Zikhov]... v 2 L 2 (D),α = α v 2 dx, v 2 H 1 (D),α = α v 2 dx D D infimum attained at weighted average: c = u D,α = D α u dx D α dx For quasi-monotone coefficients (details soon): C P,α (D) C independently of contrast [P. & Scheichl 11, 12*] early results by [Galvis & Efendiev 10] Clemens Pechstein Substructuring for multiscale problems 6 / 38

9 Weighted Poincaré Inequality (WPI) domain D, coefficient α L + (D) Definition C P,α (D) smallest constant such that u H 1 (D): inf c R u c L 2 (D),α C P,α (D) diam(d) u }{{} H 1 (D),α λ 2 (M 1 h,α K h,α) 1/2 where [Chua] [Chua & Wheeden] [Veeser & Verfürth] [Zikhov]... v 2 L 2 (D),α = α v 2 dx, v 2 H 1 (D),α = α v 2 dx D D infimum attained at weighted average: c = u D,α = D α u dx D α dx For quasi-monotone coefficients (details soon): C P,α (D) C independently of contrast [P. & Scheichl 11, 12*] early results by [Galvis & Efendiev 10] Clemens Pechstein Substructuring for multiscale problems 6 / 38

10 Preconditioners for multiscale problems Overlapping Schwarz Graham Lechner Scheichl 07 Scheichl Vainikko 07 Multilevel Methods (GMG AMG AMLI ρamge) Scheichl Vassilevski Zikatanov 12 Galvis Efendiev 10 Scheichl Vassilevski Zikatanov 12 eigensolves Willems 12* Galvis 12* Spillane Dolean Hauret Nataf P. Scheichl 12* * submitted/to appear Galvis Efendiev 10 Galvis Efendiev Willems Lazarov 12 heterogeneities NOT resolved by coarse(st) mesh or subdomains Iterative Substructuring (FETI, FETI DP) BDD, BDDC WPI P. & Scheichl 09, 12* & more P. & Scheichl 08, 09, 11 Dryja Sarkis 11 P. 12* Gippert Klawonn Rheinbach 12* Minisymposium M13 (Tu 16.30, We 10.30) links to upscaling Clemens Pechstein Substructuring for multiscale problems 7 / 38

11 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 8 / 38

12 Quasi-monotone coefficients Let α L + (D) be piecewise constant w.r.t. partition {Y k } n k=1 (Y k connected Lipschitz) α k := α Yk = const Y L... subregion with largest coefficient Definition α is quasi-monotone on D iff for each k there exists a path P kl from Y k to Y L : subsequent subregions share common (d 1)-dim. facet coefficient does not decrease along the path 3 4 (a) η η min min (b) (c) (d) Clemens Pechstein Substructuring for multiscale problems 9 / 38

13 path inequalities weighted inequality α quasi-monotone P kl corresp. path from Y k to Y L Y k X* YL X Y L Definition c kl best constant: u u X 2 L 2 (Y k ) c kl diam(d) 2 u 2 H 1 (P kl ) u H 1 (P kl ) Lemma u u X 2 L 2 (D),α ( n ) c kl diam(d) 2 u 2 H 1 (D),α u H1 (D) = C P,α (D) 2 k=1 ( n ) c kl k=1 independent of constrast! Clemens Pechstein Substructuring for multiscale problems 10 / 38

14 Explicit dependence on geometric scales P Y 1 L Y L 1 X* X 1 X 2 X 3 Lemma P kl... path from Y k to Y L c kl 2 Y l P kl X i Y l Y k Y l X i... interfaces or X diam(y l ) 2 diam(d) 2 C P(Y l, X i ) Lemma α quasi-monotone on D {Y l } form shape regular partition, not extremely long paths C P,α (D) 2 meas(d) ( diam(d) ) d 1 s max diam(d) 2 η d 2 η min min Clemens Pechstein Substructuring for multiscale problems 11 / 38

15 WPI for FE functions Definition α type-m quasi-monotone on D iff for each k there exists a path P kl from Y k to Y L : subsequent subregions share common m-dim. facet weights within the path do not decrease (a) η (b) (c) (d) Analogous statements hold true on FE space V h (D), but constants depend on h: m = d 2: 1 + log(η/h) More details: m = d 3: η/h [P. & Scheichl: IMAJNA 2012 (to appear)] Clemens Pechstein Substructuring for multiscale problems 12 / 38

16 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 13 / 38

17 FETI algorithms I Finite Element Tearing and Interconnecting FETI: [Farhat & Roux] FETI-DP: [Farhat, Lesoinne, Le Tallec, Pierson, Rixen] TFETI: [Dostál, Horák, Kučera], [Of, Steinbach] Dirichlet B.C. Neumann B.C. K 1 0 B 1 u K N BN u N = B 1 B N 0 λ [ ] [ ] K B u compactly: = B 0 λ f 1. f N 0 [ ] f 0 Clemens Pechstein Substructuring for multiscale problems 14 / 38

18 FETI algorithms II TFETI Dirichlet B.C. FETI-DP Dirichlet B.C. Neumann B.C. coarse DOF: p.w. constants ("rigid body modes") Neumann B.C. primal DOF: vertex values (weighted) edge averages??? solve P B K B λ = d precond. P B D S BD P = I Q G (G Q G) 1 G }{{} coarse solve B D, Q contain scalings solve B K 1 B λ = d precond. B D S BD K 1 : block Cholesky coarse solve + subdomain solves B D contains scalings Clemens Pechstein Substructuring for multiscale problems 15 / 38

19 Definition of jump operators jump operators: B : W U B D : W U W... torn FE space U... Lagrange multiplier space x h... interface DOF (node) on Ω i Ω k : (B w) ik (x h ) = w i (x h ) w k (x h ) Ω i x h Ω j Ω k Clemens Pechstein Substructuring for multiscale problems 16 / 38

20 Definition of jump operators jump operators: B : W U B D : W U W... torn FE space U... Lagrange multiplier space x h... interface DOF (node) on Ω i Ω k : (B D w) ik (x h ) = 1 [ ] ρ j (x h ρ k (x h ) w i (x h ) ρ i (x h ) w k (x h ) ) j N x h scalings ρ j (x h ) per subdomain j per interface DOF x h possible choices discussed later on partition of unity property averaging property: I BD B = E D : W Ŵ Clemens Pechstein Substructuring for multiscale problems 16 / 38

21 Analysis framework For FETI, FETI-DP (also BDD, BDDC): λ min 1 λ max P D {}}{ B sup D B w 2 S w W sub w 2 S W sub W suitable Common technique: S... Schur complement norm on W splitting into subdomain face, edge, vertex contributions using cut-off functions transfer operators (Sobolev extension + Scott-Zhang) Poincaré inequality [Mandel & Tezaur] [Klawonn & Widlund] [Klawonn, Widlund, Dryja] [Dohrmann, Mandel, Tezaur] [Mandel & Sousedik] [Klawonn, Rheinbach, Widlund] Clemens Pechstein Substructuring for multiscale problems 17 / 38

22 Theory vs. Implementation FETI, FETI DP, BDD, BDDC Theory Implementation cut off estimates transfer operators scalings? Weighted Poincare Inequalities (WPI) primal DOFs (FETI DP, BDDC) robust condition number bound robust method Clemens Pechstein Substructuring for multiscale problems 18 / 38

23 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 19 / 38

24 Boundary layers & patch decompositions subdomain Ω i Assumptions througout: patch decomposition globally conforming mesh T η patch decomposition T η (Ω i,η ) quasi-uniform variation on single patch c noise small Clemens Pechstein Substructuring for multiscale problems 20 / 38

25 Boundary layers & patch decompositions boundary layer Ω i,η η 4 Assumptions througout: patch decomposition globally conforming mesh T η patch decomposition T η (Ω i,η ) quasi-uniform variation on single patch c noise small Clemens Pechstein Substructuring for multiscale problems 20 / 38

26 Boundary layers & patch decompositions boundary layer Ω i,η patch decomposition: Ω i,η = k Y (k) i h η H η 2 (k) Y i Assumptions througout: patch decomposition globally conforming mesh T η patch decomposition T η (Ω i,η ) quasi-uniform variation on single patch c noise small Clemens Pechstein Substructuring for multiscale problems 20 / 38

27 Need good scalings ρ j (x h ) Theory Implementation (a) 1 1 (multiplicity scaling) (b) max(k diag (c) (d) (e) α max Ω j max τ Ω j :x h τ max Y (k) j :x h Y (k) j α τ α max Y (k) j j ) K diag j (x h ) (stiffness scaling) processed stiffness scaling? new promising technique, C. Dohrmann s talk, Mo, M13 Choice (a): does not work for certain jumps across interfaces Choice (b): κ may depend on max i α max Ω i α min Ω i Choice (c): κ may depend on oscillations of α or deteriorate for ragged interfaces! Clemens Pechstein Substructuring for multiscale problems 21 / 38

28 Intermediate result Lemma (P. & Scheichl 11, P. 12*) For (theoretical) choice (d), ρ j (x h ) = w W : P D w 2 S C c noise Proof: N j=1 finer splitting into patch globs transfer operators (carefully!) conventional cut-off estimates (d) difficult to mimic in practice (edge detection, TV minimization) Y (k) j max :x h Y (k) j α max Y (k) j [ (1 + log( η h ))2 w j 2 H 1 (Ω j,η ),α + (1 + log( η h )) η 2 w j 2 L 2 (Ω j,η ),α H h η ] faces edges vertices Clemens Pechstein Substructuring for multiscale problems 22 / 38

29 WPI in boundary layers Assumption: nice subdomains Ω j paths not extremely long Then: C P,α (Ω j ) 2 C P,α (Ω j,η ) 2 ( H η ) d 1 ( H η ) d 2 Clemens Pechstein Substructuring for multiscale problems 23 / 38

30 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 24 / 38

31 Condition number bounds I TFETI, Q = B D S B D [P. & Scheichl 08, 11, P. 12] Theorem α constant in boundary layers Ω i,η κ C c noise ( H η ) 2 (1 ( η )) 2 + log h improves to H/η if α inside larger than in Ω i,η Theorem α quasi-monotone in boundary layers Ω i,η κ C c noise ( H η ) d (1 ( η )) 2 + log h Similar: Q = Q diag ; type-m quasi-monotone Clemens Pechstein Substructuring for multiscale problems 25 / 38

32 Condition number bounds I TFETI, Q = B D S B D [P. & Scheichl 08, 11, P. 12] Theorem α constant in boundary layers Ω i,η κ C c noise ( H η ) 2 (1 ( η )) 2 + log h improves to H/η if α inside larger than in Ω i,η Theorem α quasi-monotone in boundary layers Ω i,η κ C c noise ( H η ) d (1 ( η )) 2 + log h Similar: Q = Q diag ; type-m quasi-monotone Clemens Pechstein Substructuring for multiscale problems 25 / 38

33 Condition number bounds II artificial coefficient α art : η α art = α α art α in Ω j,η elsewhere Enough to have inf c R w c 2 L 2 (Ω j,η ),α C j H 2 w 2 H 1 (Ω j ),α art Theorem α art quasi-monotone on Ω j : κ C c noise ( H η ) d+1 (1 ( η )) 2 + log h [P. & Scheichl 08, 11] [Dryja & Sarkis 11] [Gippert, Klawonn, Rheinbach 12*] Clemens Pechstein Substructuring for multiscale problems 26 / 38

34 Necessity of quasi-monotonicity? Q: is quasi-monotonicity is necessary for the robust of TFETI? Conjecture TFETI is robust iff for each subdomain, there exists a quasi-monotone artificial coefficient. is wrong TFETI... p Clemens Pechstein Substructuring for multiscale problems 27 / 38

35 Necessity of quasi-monotonicity? Q: is quasi-monotonicity is necessary for the robust of TFETI? Conjecture TFETI is robust iff for each subdomain, there exists a quasi-monotone artificial coefficient. That s wrong! TFETI has more robustness properties! Clemens Pechstein Substructuring for multiscale problems 27 / 38

36 Inclusion features I Docking inclusions can be elminated! condition FETI, many edge-island example, H/h=32 1e+08 1e+07 1e e+06 1e+07 ALPHA Theoretical reason: We actually have to estimate Ω i,η min(α i, α neighbors )... 2 dx [work in progress] Clemens Pechstein Substructuring for multiscale problems 28 / 38

37 Inclusion features II Even docking channels can be elminated! condition FETI, docking channels example, H/h=32 1e+08 1e+07 1e e+06 1e+07 ALPHA Theoretical reason: We actually have to estimate Ω i,η min(α i, α neighbors )... 2 dx [work in progress] Clemens Pechstein Substructuring for multiscale problems 29 / 38

38 Inclusion features III Face inclusions can be elminated! condition FETI, many edge-island-plus-channel example, H/h=32 1e+08 1e+07 1e e+06 1e+07 ALPHA Theoretical reasons: [work in progress] Special cut-off function [Graham, Lechner, Scheichl 07] Special transfer operator, L 2 α, H 1 α-stable for binary media Clemens Pechstein Substructuring for multiscale problems 30 / 38

39 What s bad... E.g. two vertex inclusions or long channels condition FETI, many edge-island-plus-2vertex example, H/h=32 1e+08 1e+07 1e e+06 1e+07 ALPHA condition FETI, long channels example, H/h=32 1e+08 1e+07 1e e+06 1e+07 ALPHA Clemens Pechstein Substructuring for multiscale problems 31 / 38

40 Outline 1 Introduction 2 Weighted Poincaré Inequalities (WPI) 3 FETI Basics 4 Multiscale Toolkit 5 TFETI 6 FETI-DP Clemens Pechstein Substructuring for multiscale problems 32 / 38

41 Choice of primal DOFs Choice of primal DOFs should ensure that K is invertible make WPI applicable (on neighborhoods of edges/faces) With tools from above this will allow for robustness analysis Adapted tool: WPI with weighted averages [P., Sarkis, Scheichl, DD20 proc.] u u X, α L 2 (D),α C P,α (D, X, α) diam(d) u H 1 (D),α Essential requirements: α quasi-monotone averaging manifold X must see largest coefficient α and α have to match Geometry dependence can again be made explicit Clemens Pechstein Substructuring for multiscale problems 33 / 38

42 Choice of primal DOFs Choice of primal DOFs should ensure that K is invertible make WPI applicable (on neighborhoods of edges/faces) With tools from above this will allow for robustness analysis Adapted tool: WPI with weighted averages [P., Sarkis, Scheichl, DD20 proc.] u u X, α L 2 (D),α C P,α (D, X, α) diam(d) u H 1 (D),α Essential requirements: α quasi-monotone averaging manifold X must see largest coefficient α and α have to match Geometry dependence can again be made explicit Clemens Pechstein Substructuring for multiscale problems 33 / 38

43 Weighted edge averages? Simple examples: Ωi E E Ωk Ω i Ω k Primal DOF associated to edge E: u E, α E α u ds := E α ds or u E, α,alg := x h E α(x h ) u(x h ) x h E α(x h ) [Klawonn & Rheinbach, 2006] Clemens Pechstein Substructuring for multiscale problems 34 / 38

44 FETI-DP coarse space What to do here? Ωi E Ω k Ω E i Ωk Problems: Primal DOF should have same weight for both sides Usage of multiple primal DOFs dead end? Recall: for edge E, we actually have to bound Ω i,η U E min(α i, α k )... 2 dx If minimum coefficient has quasi-monotone extensions then α(x h ) = min(k diag i (x h ), K diag k (x h )) (algebraic average) does the job, at least robust w.r.t. contrast! Clemens Pechstein Substructuring for multiscale problems 35 / 38

45 FETI-DP coarse space What to do here? Ωi E Ω k Ω E i Ωk Problems: Primal DOF should have same weight for both sides Usage of multiple primal DOFs dead end? Recall: for edge E, we actually have to bound Ω i,η U E min(α i, α k )... 2 dx If minimum coefficient has quasi-monotone extensions then α(x h ) = min(k diag i (x h ), K diag k (x h )) (algebraic average) does the job, at least robust w.r.t. contrast! Clemens Pechstein Substructuring for multiscale problems 35 / 38

46 Numerical test condition 1e+08 1e+07 1e FETI-DP, edge crosspoint example, H/h= e+06 1e+07 ALPHA vertices unweighted max weight min weight Clemens Pechstein Substructuring for multiscale problems 36 / 38

47 Summary In this talk: Weighted Poincaré Inequalities Robustness theory for TFETI Robustness theory for FETI-DP (yet to be completed) Theory and testing guides to more insight / new methods! Open problems: Choice of scalings Choice of primal constraints Incorporation of eigensolves monograph: Finite and Boundary Element Tearing and Interconnecting Solvers for Multiscale Problems Springer LNCSE series, to appear Clemens Pechstein Substructuring for multiscale problems 37 / 38

48 Summary In this talk: Weighted Poincaré Inequalities Robustness theory for TFETI Robustness theory for FETI-DP (yet to be completed) Theory and testing guides to more insight / new methods! Open problems: Choice of scalings Choice of primal constraints Incorporation of eigensolves monograph: Finite and Boundary Element Tearing and Interconnecting Solvers for Multiscale Problems Springer LNCSE series, to appear Clemens Pechstein Substructuring for multiscale problems 37 / 38

49 Interconnecting... THANKS FOR YOUR ATTENTION Clemens Pechstein Substructuring for multiscale problems 38 / 38

50 Interconnecting... THANKS FOR YOUR ATTENTION Clemens Pechstein Substructuring for multiscale problems 38 / 38

On Iterative Substructuring Methods for Multiscale Problems

On Iterative Substructuring Methods for Multiscale Problems On Iterative Substructuring Methods for Multiscale Problems Clemens Pechstein Introduction Model Problem Let Ω R 2 or R 3 be a Lipschitz polytope with boundary Ω = Γ D Γ N, where Γ D Γ N = /0. We are interested

More information

Auxiliary space multigrid method for elliptic problems with highly varying coefficients

Auxiliary space multigrid method for elliptic problems with highly varying coefficients Auxiliary space multigrid method for elliptic problems with highly varying coefficients Johannes Kraus 1 and Maria Lymbery 2 1 Introduction The robust preconditioning of linear systems of algebraic equations

More information

Multispace 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 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 information

Multilevel and Adaptive Iterative Substructuring Methods. Jan Mandel University of Colorado Denver

Multilevel 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 information

Some Domain Decomposition Methods for Discontinuous Coefficients

Some Domain Decomposition Methods for Discontinuous Coefficients Some Domain Decomposition Methods for Discontinuous Coefficients Marcus Sarkis WPI RICAM-Linz, October 31, 2011 Marcus Sarkis (WPI) Domain Decomposition Methods RICAM-2011 1 / 38 Outline Discretizations

More information

Two new enriched multiscale coarse spaces for the Additive Average Schwarz method

Two new enriched multiscale coarse spaces for the Additive Average Schwarz method 346 Two new enriched multiscale coarse spaces for the Additive Average Schwarz method Leszek Marcinkowski 1 and Talal Rahman 2 1 Introduction We propose additive Schwarz methods with spectrally enriched

More information

Adaptive 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 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 information

JOHANNES KEPLER UNIVERSITY LINZ. Weighted Poincaré Inequalities and Applications in Domain Decomposition

JOHANNES KEPLER UNIVERSITY LINZ. Weighted Poincaré Inequalities and Applications in Domain Decomposition JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Weighted Poincaré Inequalities and Applications in Domain Decomposition Clemens Pechstein Institute of Computational Mathematics,

More information

Extending the theory for domain decomposition algorithms to less regular subdomains

Extending 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 information

Dual-Primal Isogeometric Tearing and Interconnecting Solvers for Continuous and Discontinuous Galerkin IgA Equations

Dual-Primal Isogeometric Tearing and Interconnecting Solvers for Continuous and Discontinuous Galerkin IgA Equations Dual-Primal Isogeometric Tearing and Interconnecting Solvers for Continuous and Discontinuous Galerkin IgA Equations Christoph Hofer and Ulrich Langer Doctoral Program Computational Mathematics Numerical

More information

A Balancing Algorithm for Mortar Methods

A 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 information

Short 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 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 information

Domain Decomposition solvers (FETI)

Domain 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 information

Adaptive Coarse Spaces and Multiple Search Directions: Tools for Robust Domain Decomposition Algorithms

Adaptive Coarse Spaces and Multiple Search Directions: Tools for Robust Domain Decomposition Algorithms Adaptive Coarse Spaces and Multiple Search Directions: Tools for Robust Domain Decomposition Algorithms Nicole Spillane Center for Mathematical Modelling at the Universidad de Chile in Santiago. July 9th,

More information

ASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM

ASM-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 information

JOHANNES KEPLER UNIVERSITY LINZ. Weighted Poincaré inequalities

JOHANNES KEPLER UNIVERSITY LINZ. Weighted Poincaré inequalities JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Weighted Poincaré inequalities Clemens Pechstein Institute of Computational Mathematics, Johannes Kepler University Altenberger Str.

More information

Algebraic Coarse Spaces for Overlapping Schwarz Preconditioners

Algebraic Coarse Spaces for Overlapping Schwarz Preconditioners Algebraic Coarse Spaces for Overlapping Schwarz Preconditioners 17 th International Conference on Domain Decomposition Methods St. Wolfgang/Strobl, Austria July 3-7, 2006 Clark R. Dohrmann Sandia National

More information

arxiv: v1 [math.na] 16 Dec 2015

arxiv: v1 [math.na] 16 Dec 2015 ANALYSIS OF A NEW HARMONICALLY ENRICHED MULTISCALE COARSE SPACE FOR DOMAIN DECOMPOSITION METHODS MARTIN J. GANDER, ATLE LONELAND, AND TALAL RAHMAN arxiv:52.05285v [math.na] 6 Dec 205 Abstract. We propose

More information

A Balancing Algorithm for Mortar Methods

A 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 information

Coupled FETI/BETI for Nonlinear Potential Problems

Coupled 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 information

The All-floating BETI Method: Numerical Results

The 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 information

Application of Preconditioned Coupled FETI/BETI Solvers to 2D Magnetic Field Problems

Application of Preconditioned Coupled FETI/BETI Solvers to 2D Magnetic Field Problems Application of Preconditioned Coupled FETI/BETI Solvers to 2D Magnetic Field Problems U. Langer A. Pohoaţǎ O. Steinbach 27th September 2004 Institute of Computational Mathematics Johannes Kepler University

More information

Toward black-box adaptive domain decomposition methods

Toward black-box adaptive domain decomposition methods Toward black-box adaptive domain decomposition methods Frédéric Nataf Laboratory J.L. Lions (LJLL), CNRS, Alpines Inria and Univ. Paris VI joint work with Victorita Dolean (Univ. Nice Sophia-Antipolis)

More information

IsogEometric Tearing and Interconnecting

IsogEometric Tearing and Interconnecting IsogEometric Tearing and Interconnecting Christoph Hofer and Ludwig Mitter Johannes Kepler University, Linz 26.01.2017 Doctoral Program Computational Mathematics Numerical Analysis and Symbolic Computation

More information

DOMAIN DECOMPOSITION FOR LESS REGULAR SUBDOMAINS: OVERLAPPING SCHWARZ IN TWO DIMENSIONS TR

DOMAIN DECOMPOSITION FOR LESS REGULAR SUBDOMAINS: OVERLAPPING SCHWARZ IN TWO DIMENSIONS TR DOMAIN DECOMPOSITION FOR LESS REGULAR SUBDOMAINS: OVERLAPPING SCHWARZ IN TWO DIMENSIONS TR2007-888 CLARK R. DOHRMANN, AXEL KLAWONN, AND OLOF B. WIDLUND Abstract. In the theory of domain decomposition methods,

More information

FETI-DP for Elasticity with Almost Incompressible 2 Material Components 3 UNCORRECTED PROOF. Sabrina Gippert, Axel Klawonn, and Oliver Rheinbach 4

FETI-DP for Elasticity with Almost Incompressible 2 Material Components 3 UNCORRECTED PROOF. Sabrina Gippert, Axel Klawonn, and Oliver Rheinbach 4 1 FETI-DP for Elasticity with Almost Incompressible 2 Material Components 3 Sabrina Gippert, Axel Klawonn, and Oliver Rheinbach 4 Lehrstuhl für Numerische Mathematik, Fakultät für Mathematik, Universität

More information

Additive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems

Additive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems Additive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems Atle Loneland 1, Leszek Marcinkowski 2, and Talal Rahman 3 1 Introduction In this paper

More information

A FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem

A FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem A FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem Leszek Marcinkowski 1 and Nina Dokeva 2 1 Department of Mathematics, Warsaw University, Banacha 2, 02 097 Warszawa, Poland,

More information

Selecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions

Selecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions Selecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions Axel Klawonn 1 and Olof B. Widlund 2 1 Universität Duisburg-Essen, Campus Essen, Fachbereich Mathematik, (http://www.uni-essen.de/ingmath/axel.klawonn/)

More information

Inexact Data-Sparse BETI Methods by Ulrich Langer. (joint talk with G. Of, O. Steinbach and W. Zulehner)

Inexact Data-Sparse BETI Methods by Ulrich Langer. (joint talk with G. Of, O. Steinbach and W. Zulehner) Inexact Data-Sparse BETI Methods by Ulrich Langer (joint talk with G. Of, O. Steinbach and W. Zulehner) Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences http://www.ricam.oeaw.ac.at

More information

Parallel 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 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 information

CONVERGENCE 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 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 information

On the Robustness and Prospects of Adaptive BDDC Methods for Finite Element Discretizations of Elliptic PDEs with High-Contrast Coefficients

On the Robustness and Prospects of Adaptive BDDC Methods for Finite Element Discretizations of Elliptic PDEs with High-Contrast Coefficients On the Robustness and Prospects of Adaptive BDDC Methods for Finite Element Discretizations of Elliptic PDEs with High-Contrast Coefficients Stefano Zampini Computer, Electrical and Mathematical Sciences

More information

Parallel Sums and Adaptive BDDC Deluxe

Parallel Sums and Adaptive BDDC Deluxe 249 Parallel Sums and Adaptive BDDC Deluxe Olof B. Widlund 1 and Juan G. Calvo 2 1 Introduction There has recently been a considerable activity in developing adaptive methods for the selection of primal

More information

On the Use of Inexact Subdomain Solvers for BDDC Algorithms

On 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 information

SOME PRACTICAL ASPECTS OF PARALLEL ADAPTIVE BDDC METHOD

SOME PRACTICAL ASPECTS OF PARALLEL ADAPTIVE BDDC METHOD Conference Applications of Mathematics 2012 in honor of the 60th birthday of Michal Křížek. Institute of Mathematics AS CR, Prague 2012 SOME PRACTICAL ASPECTS OF PARALLEL ADAPTIVE BDDC METHOD Jakub Šístek1,2,

More information

Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms

Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms www.oeaw.ac.at Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms Y. Efendiev, J. Galvis, R. Lazarov, J. Willems RICAM-Report 2011-05 www.ricam.oeaw.ac.at

More information

Parallel 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 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 information

Convergence 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 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 information

AN ANALYSIS OF A FETI DP ALGORITHM ON IRREGULAR SUBDOMAINS IN THE PLANE TR

AN ANALYSIS OF A FETI DP ALGORITHM ON IRREGULAR SUBDOMAINS IN THE PLANE TR AN ANALYSIS OF A FETI DP ALGORITHM ON IRREGULAR SUBDOMAINS IN THE PLANE TR27 889 AXEL KLAWONN, OLIVER RHEINBACH, AND OLOF B. WIDLUND Abstract. In the theory for domain decomposition algorithms of the iterative

More information

ETNA Kent State University

ETNA Kent State University Electronic Transactions on Numerical Analysis. Volume 31, pp. 384-402, 2008. Copyright 2008,. ISSN 1068-9613. ETNA ON THE EQUIVALENCE OF PRIMAL AND DUAL SUBSTRUCTURING PRECONDITIONERS BEDŘICH SOUSEDÍK

More information

20. A Dual-Primal FETI Method for solving Stokes/Navier-Stokes Equations

20. 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 information

AN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS

AN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS lectronic Transactions on Numerical Analysis. Volume 45, pp. 524 544, 2016. Copyright c 2016,. ISSN 1068 9613. TNA AN ADAPTIV CHOIC O PRIMAL CONSTRAINTS OR BDDC DOMAIN DCOMPOSITION ALGORITHMS JUAN G. CALVO

More information

TR THREE-LEVEL BDDC IN THREE DIMENSIONS

TR 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

ON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD. January 2000

ON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD. January 2000 ON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD JAN MANDEL AND RADEK TEZAUR January 2000 Abstract In the Dual-Primal FETI method, introduced by Farhat et al [5], the domain is decomposed into

More information

Asymptotic expansions for high-contrast elliptic equations

Asymptotic expansions for high-contrast elliptic equations Asymptotic expansions for high-contrast elliptic equations Victor M. Calo Yalchin Efendiev Juan Galvis 1 Abstract In this paper, we present a high-order expansion for elliptic equations in highcontrast

More information

Algebraic Adaptive Multipreconditioning applied to Restricted Additive Schwarz

Algebraic Adaptive Multipreconditioning applied to Restricted Additive Schwarz Algebraic Adaptive Multipreconditioning applied to Restricted Additive Schwarz Nicole Spillane To cite this version: Nicole Spillane. Algebraic Adaptive Multipreconditioning applied to Restricted Additive

More information

Groupe de Travail Méthodes Numériques

Groupe de Travail Méthodes Numériques Groupe de Travail Méthodes Numériques Laboratoire Jacques-Louis Lions, Paris 6 Monday, May 11th, 2009 Domain Decomposition with Lagrange Multipliers: A continuous framework for a FETI-DP+Mortar method

More information

Multispace and Multilevel BDDC

Multispace 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 information

Capacitance Matrix Method

Capacitance 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 information

INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions

INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions Juan Gabriel Calvo Preprint No. 25-2017 PRAHA 2017 A VIRTUAL

More information

BETI for acoustic and electromagnetic scattering

BETI 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 information

Multipré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) 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 information

Une méthode parallèle hybride à deux niveaux interfacée dans un logiciel d éléments finis

Une méthode parallèle hybride à deux niveaux interfacée dans un logiciel d éléments finis Une méthode parallèle hybride à deux niveaux interfacée dans un logiciel d éléments finis Frédéric Nataf Laboratory J.L. Lions (LJLL), CNRS, Alpines Inria and Univ. Paris VI Victorita Dolean (Univ. Nice

More information

Fakultät für Mathematik und Informatik

Fakultät für Mathematik und Informatik Fakultät für Mathematik und Informatik Preprint 2016-09 Alexander Heinlein, Axel Klawonn, Jascha Knepper, Oliver Rheinbach Multiscale Coarse Spaces for Overlapping Schwarz Methods Based on the ACMS Space

More information

Numerical Simulation of Flows in Highly Heterogeneous Porous Media

Numerical Simulation of Flows in Highly Heterogeneous Porous Media Numerical Simulation of Flows in Highly Heterogeneous Porous Media R. Lazarov, Y. Efendiev, J. Galvis, K. Shi, J. Willems The Second International Conference on Engineering and Computational Mathematics

More information

INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES

INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES On the approximation of a virtual coarse space for domain decomposition methods in two dimensions Juan Gabriel Calvo Preprint No. 31-2017 PRAHA 2017

More information

Parallel Scalable Iterative Substructuring: Robust Exact and Inexact FETI-DP Methods with Applications to Elasticity

Parallel Scalable Iterative Substructuring: Robust Exact and Inexact FETI-DP Methods with Applications to Elasticity Parallel Scalable Iterative Substructuring: Robust Exact and Inexact FETI-DP Methods with Applications to Elasticity Oliver Rheinbach geboren in Hilden Fachbereich Mathematik Universität Duisburg-Essen

More information

ETNA Kent State University

ETNA 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 information

for three dimensional problems are often more complicated than the quite simple constructions that work well for problems in the plane; see [23] for a

for three dimensional problems are often more complicated than the quite simple constructions that work well for problems in the plane; see [23] for a DUAL-PRIMAL FETI METHODS FOR THREE-DIMENSIONAL ELLIPTIC PROBLEMS WITH HETEROGENEOUS COEFFICIENTS AEL KLAWONN Λ, OLOF B. WIDLUND y, AND MAKSYMILIAN DRYJA z Abstract. In this paper, certain iterative substructuring

More information

Adaptive Finite Element Methods Lecture 1: A Posteriori Error Estimation

Adaptive Finite Element Methods Lecture 1: A Posteriori Error Estimation Adaptive Finite Element Methods Lecture 1: A Posteriori Error Estimation Department of Mathematics and Institute for Physical Science and Technology University of Maryland, USA www.math.umd.edu/ rhn 7th

More information

OVERLAPPING SCHWARZ ALGORITHMS FOR ALMOST INCOMPRESSIBLE LINEAR ELASTICITY TR

OVERLAPPING 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 information

All-Floating Coupled Data-Sparse Boundary and Interface-Concentrated Finite Element Tearing and Interconnecting Methods

All-Floating Coupled Data-Sparse Boundary and Interface-Concentrated Finite Element Tearing and Interconnecting Methods All-Floating Coupled Data-Sparse Boundary and Interface-Concentrated Finite Element Tearing and Interconnecting Methods Ulrich Langer 1,2 and Clemens Pechstein 2 1 Institute of Computational Mathematics,

More information

Accomodating Irregular Subdomains in Domain Decomposition Theory

Accomodating Irregular Subdomains in Domain Decomposition Theory Accomodating Irregular Subdomains in Domain Decomposition Theory Olof B. Widlund 1 Courant Institute, 251 Mercer Street, New York, NY 10012, USA widlund@cims.nyu.edu Summary. In the theory for domain decomposition

More information

The mortar element method for quasilinear elliptic boundary value problems

The mortar element method for quasilinear elliptic boundary value problems The mortar element method for quasilinear elliptic boundary value problems Leszek Marcinkowski 1 Abstract We consider a discretization of quasilinear elliptic boundary value problems by the mortar version

More information

Avancées récentes dans le domaine des solveurs linéaires Pierre Jolivet Journées inaugurales de la machine de calcul June 10, 2015

Avancées récentes dans le domaine des solveurs linéaires Pierre Jolivet Journées inaugurales de la machine de calcul June 10, 2015 spcl.inf.ethz.ch @spcl eth Avancées récentes dans le domaine des solveurs linéaires Pierre Jolivet Journées inaugurales de la machine de calcul June 10, 2015 Introduction Domain decomposition methods The

More information

Two-scale Dirichlet-Neumann preconditioners for boundary refinements

Two-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 information

BDDC deluxe for Isogeometric Analysis

BDDC deluxe for Isogeometric Analysis BDDC deluxe for sogeometric Analysis L. Beirão da Veiga 1, L.. Pavarino 1, S. Scacchi 1, O. B. Widlund 2, and S. Zampini 3 1 ntroduction The main goal of this paper is to design, analyze, and test a BDDC

More information

Scalable Domain Decomposition Preconditioners For Heterogeneous Elliptic Problems

Scalable Domain Decomposition Preconditioners For Heterogeneous Elliptic Problems Scalable Domain Decomposition Preconditioners For Heterogeneous Elliptic Problems Pierre Jolivet, F. Hecht, F. Nataf, C. Prud homme Laboratoire Jacques-Louis Lions Laboratoire Jean Kuntzmann INRIA Rocquencourt

More information

Nonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems

Nonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems Nonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems Qiya Hu 1, Shi Shu 2 and Junxian Wang 3 Abstract In this paper we propose a substructuring

More information

GRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 8

GRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 8 GRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 8 MÉXICO 2014 MEMORIAS GGMC INSTITUTO DE GEOFÍSICA UNAM MIEMBROS DEL GGMC Dr. Ismael Herrera Revilla iherrerarevilla@gmail.com Dr. Luis Miguel de

More information

Parallel Implementation of BDDC for Mixed-Hybrid Formulation of Flow in Porous Media

Parallel Implementation of BDDC for Mixed-Hybrid Formulation of Flow in Porous Media Parallel Implementation of BDDC for Mixed-Hybrid Formulation of Flow in Porous Media Jakub Šístek1 joint work with Jan Březina 2 and Bedřich Sousedík 3 1 Institute of Mathematics of the AS CR Nečas Center

More information

Electronic Transactions on Numerical Analysis Volume 49, 2018

Electronic Transactions on Numerical Analysis Volume 49, 2018 Electronic Transactions on Numerical Analysis Volume 49, 2018 Contents 1 Adaptive FETI-DP and BDDC methods with a generalized transformation of basis for heterogeneous problems. Axel Klawonn, Martin Kühn,

More information

Domain 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 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 information

AN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS TR

AN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS TR AN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS JUAN G. CALVO AND OLOF B. WIDLUND TR2015-979 Abstract. An adaptive choice for primal spaces, based on parallel sums, is

More information

A non-standard Finite Element Method based on boundary integral operators

A non-standard Finite Element Method based on boundary integral operators A non-standard Finite Element Method based on boundary integral operators Clemens Hofreither Ulrich Langer Clemens Pechstein June 30, 2010 supported by Outline 1 Method description Motivation Variational

More information

Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids

Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids Long Chen 1, Ricardo H. Nochetto 2, and Chen-Song Zhang 3 1 Department of Mathematics, University of California at Irvine. chenlong@math.uci.edu

More information

Multigrid and Iterative Strategies for Optimal Control Problems

Multigrid 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 information

Some examples in domain decomposition

Some 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 information

A Unified Framework for Adaptive BDDC

A Unified Framework for Adaptive BDDC www.oeaw.ac.at A Unified Framework for Adaptive BDDC C. Pechstein, C.R. Dohrmann RICAM-Report 2016-20 www.ricam.oeaw.ac.at A UNIFIED FRAMEWORK FOR ADAPTIVE BDDC CLEMENS PECHSTEIN 1 AND CLARK R. DOHRMANN

More information

Domain Decomposition Methods for Mortar Finite Elements

Domain 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 information

Multilevel spectral coarse space methods in FreeFem++ on parallel architectures

Multilevel spectral coarse space methods in FreeFem++ on parallel architectures Multilevel spectral coarse space methods in FreeFem++ on parallel architectures Pierre Jolivet Laboratoire Jacques-Louis Lions Laboratoire Jean Kuntzmann DD 21, Rennes. June 29, 2012 In collaboration with

More information

Domain Decomposition and /),p-adaptive Finite Elements Randolph E. Bank, Hieu Nguyen 3

Domain Decomposition and /),p-adaptive Finite Elements Randolph E. Bank, Hieu Nguyen 3 Contents Part I Plenary Presentations Domain Decomposition and /),p-adaptive Finite Elements Randolph E. Bank, Hieu Nguyen 3 Domain Decomposition Methods for Electromagnetic Wave Propagation Problems in

More information

A BDDC ALGORITHM FOR RAVIART-THOMAS VECTOR FIELDS TR

A BDDC ALGORITHM FOR RAVIART-THOMAS VECTOR FIELDS TR A BDDC ALGORITHM FOR RAVIART-THOMAS VECTOR FIELDS DUK-SOON OH, OLOF B WIDLUND, AND CLARK R DOHRMANN TR013-951 Abstract A BDDC preconditioner is defined by a coarse component, expressed in terms of primal

More information

On Nonlinear Dirichlet Neumann Algorithms for Jumping Nonlinearities

On 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 information

A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements

A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements W I S S E N T E C H N I K L E I D E N S C H A F T A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements Matthias Gsell and Olaf Steinbach Institute of Computational Mathematics

More information

A Neumann-Dirichlet Preconditioner for FETI-DP 2 Method for Mortar Discretization of a Fourth Order 3 Problems in 2D 4 UNCORRECTED PROOF

A Neumann-Dirichlet Preconditioner for FETI-DP 2 Method for Mortar Discretization of a Fourth Order 3 Problems in 2D 4 UNCORRECTED PROOF 1 A Neumann-Dirichlet Preconditioner for FETI-DP 2 Method for Mortar Discretization of a Fourth Order 3 Problems in 2D 4 Leszek Marcinkowski * 5 Faculty of Mathematics, University of Warsaw, Banacha 2,

More information

An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions

An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions Leszek Marcinkowski Department of Mathematics, Warsaw University, Banacha

More information

FETI Methods for the Simulation of Biological Tissues

FETI Methods for the Simulation of Biological Tissues SpezialForschungsBereich F 32 Karl Franzens Universita t Graz Technische Universita t Graz Medizinische Universita t Graz FETI Methods for the Simulation of Biological Tissues Ch. Augustin O. Steinbach

More information

Scalable BETI for Variational Inequalities

Scalable BETI for Variational Inequalities Scalable BETI for Variational Inequalities Jiří Bouchala, Zdeněk Dostál and Marie Sadowská Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VŠB-Technical University

More information

Goal. Robust A Posteriori Error Estimates for Stabilized Finite Element Discretizations of Non-Stationary Convection-Diffusion Problems.

Goal. 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 information

An additive average Schwarz method for the plate bending problem

An 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 information

JOHANNES KEPLER UNIVERSITY LINZ. Abstract Robust Coarse Spaces for Systems of PDEs via Generalized Eigenproblems in the Overlaps

JOHANNES KEPLER UNIVERSITY LINZ. Abstract Robust Coarse Spaces for Systems of PDEs via Generalized Eigenproblems in the Overlaps JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Abstract Robust Coarse Spaces for Systems of PDEs via Generalized Eigenproblems in the Overlaps Nicole Spillane Frédérik Nataf Laboratoire

More information

PARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS

PARTITION 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 information

Optimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36

Optimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36 Optimal multilevel preconditioning of strongly anisotropic problems. Part II: non-conforming FEM. Svetozar Margenov margenov@parallel.bas.bg Institute for Parallel Processing, Bulgarian Academy of Sciences,

More information

Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions

Domain 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 information

Technische Universität Graz

Technische Universität Graz Technische Universität Graz Robust boundary element domain decomposition solvers in acoustics O. Steinbach, M. Windisch Berichte aus dem Institut für Numerische Mathematik Bericht 2009/9 Technische Universität

More information

An Iterative Domain Decomposition Method for the Solution of a Class of Indefinite Problems in Computational Structural Dynamics

An Iterative Domain Decomposition Method for the Solution of a Class of Indefinite Problems in Computational Structural Dynamics An Iterative Domain Decomposition Method for the Solution of a Class of Indefinite Problems in Computational Structural Dynamics Charbel Farhat a, and Jing Li a a Department of Aerospace Engineering Sciences

More information

A Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems

A 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 information

Uniform inf-sup condition for the Brinkman problem in highly heterogeneous media

Uniform inf-sup condition for the Brinkman problem in highly heterogeneous media Uniform inf-sup condition for the Brinkman problem in highly heterogeneous media Raytcho Lazarov & Aziz Takhirov Texas A&M May 3-4, 2016 R. Lazarov & A.T. (Texas A&M) Brinkman May 3-4, 2016 1 / 30 Outline

More information