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

Size: px
Start display at page:

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

Transcription

1 Dual-Primal Isogeometric Tearing and Interconnecting Solvers for Continuous and Discontinuous Galerkin IgA Equations Christoph Hofer and Ulrich Langer Doctoral Program Computational Mathematics Numerical Analysis and Symbolic Computation Johannes Kepler University, Linz Hofer et. al JKU Linz 1 / 23

2 Introduction IETI-DP dg-ieti-dp Numerical examples Conclusion Hofer et. al JKU Linz 2 / 23

3 Introduction : Overview Introduction IETI-DP dg-ieti-dp Numerical examples Conclusion Hofer et. al JKU Linz 2 / 23

4 Introduction : Motivation What is the Dual Primal IsogEometric Tearing and Interconnecting (IETI-DP) method? adaption of Dual Primal Finite Element Tearing and Interconnecting (FETI-DP) for IgA non overlapping domain decomposition method Why we need it? fast solvers parallelizeable solvers robust solvers w.r.t. jumping coefficients Hofer et. al JKU Linz 3 / 23

5 Introduction : State of the Art Pechstein, C. (2012). Finite and boundary element tearing and interconnecting solvers for multiscale problems (Vol. 90). Springer Science & Business Media. Beirao da Veiga, L., Cho, D., Pavarino, L. F., Scacchi, S. (2013). BDDC preconditioners for isogeometric analysis. Mathematical Models and Methods in Applied Sciences, 23(06), Dryja, M., Galvis, J., Sarkis, M. (2013). A FETI-DP preconditioner for a composite finite element and discontinuous Galerkin method. SIAM Journal on Numerical Analysis, 51(1), Dryja, M., Sarkis, M. (2014). 3-D FETI-DP preconditioners for composite finite element-discontinuous Galerkin methods. In Domain Decomposition Methods in Science and Engineering XXI (pp ). Springer International Publishing. Hofer et. al JKU Linz 4 / 23

6 Introduction : Isogeometric Discretization The computational domain Ω can be represented as Ω := N Ω (k), where Ω (k) = G (k) (ˆΩ), ˆΩ = (0, 1) d, k=0 with Γ (k,l) := Ω (k) Ω (l) and G (k) (ξ) = i I P (k) i N i,p (ξ). Hofer et. al JKU Linz 5 / 23

7 Introduction : Examples Abbildung : B-Splines with p = 2 and knot vector Ξ = {0, 0, 0, 1, 2, 3, 4, 4, 5, 5, 5} 1 1 Book: Isogeometric Analysis, Towards Integration of CAD and FEA, J. A. Cotrell and T. J. R. Hughes and Y. Bazilevs Hofer et. al JKU Linz 6 / 23

8 Introduction : Remarks dim 2: N i,p is obtained via a tensorproduct using Ňi,p(x) := N i,p G 1 (x) as basis for discretization Ň i,p (x) is in general not interpolatory dim = 1: Ň i,p is interpolatory at G((0, 1)) dim = 2: Ň i,p is interpolatory at the corner points, and it is possible to associate certain N i,p to G((0, 1) 2 ) Hofer et. al JKU Linz 7 / 23

9 Introduction : Problem formulation - cg setting Find u h V D,h : a(u h, v h ) = F, v h v h V D,h, where V D,h is a conforming discrete subspaces of V D, e.g. a(u, v) = α u v dx, F, v = fv dx + g N v ds Ω Ω Γ N V D = {u H 1 : γ 0 u = 0 on Γ D }, V D,h = k span{n i,p G (k) 1 } H 1 (Ω). The variational equation is equivalent to Ku = f. Hofer et. al JKU Linz 8 / 23

10 IETI-DP : Overview Introduction IETI-DP dg-ieti-dp Numerical examples Conclusion Hofer et. al JKU Linz 8 / 23

11 IETI-DP : Hofer et. al JKU Linz 9 / 23

12 IETI-DP : Lagrange Multipliers Hofer et. al JKU Linz 10 / 23

13 IETI-DP : IETI-DP Given K (k) and f (k), we can reformulate [ Ke B T ] [ ] ue Ku = f = B 0 λ where K e = diag(k (k) ) and f e = [f (k) ]. [ ] f e, 0 Since K e is not invertible, we need additional primal variables incorporated in K e (partial assembly) K e, B, f e : continuous vertex values continuous edge/face averages Hofer et. al JKU Linz 11 / 23

14 IETI-DP : IETI-DP Given K (k) and f (k), we can reformulate [ Ke B T ] [ ] ue Ku = f = B 0 λ where K e = diag(k (k) ) and f e = [f (k) ]. [ ] f e, 0 Since K e is not invertible, we need additional primal variables incorporated in K e (partial assembly) K e, B, f e : continuous vertex values continuous edge/face averages Hofer et. al JKU Linz 11 / 23

15 IETI-DP : Introducing Primal Variables Hofer et. al JKU Linz 12 / 23

16 IETI-DP : Introducing Primal Variables Find (u, λ) RÑ U : ] [u ] [ Ke BT = B 0 λ K e is SPD, hence, we can define: ] [ f e. 0 F := 1 B K e B T d := 1 B K e f e The saddle point system is equivalent to solving: find λ U : F λ = d. Hofer et. al JKU Linz 13 / 23

17 IETI-DP : Theorem Let H k be the diameter and h k the local mesh size of Ω (k). Let the Scaled Dirichlet preconditioner M 1 sd be defined as: M 1 sd = B DS e B T D Then, under suitible assumption on the mesh, we have ( κ(m 1 sd F ker( B T ) C max 1 + log ) k where the constant C is independent of H k, h k. ( Hk h k )) 2, Hofer, C., Langer U.: DP-IETI Solvers for large-scale systems of multipatch cg IgA equations. RICAM-Report Beirao da Veiga, L., Cho, D., Pavarino, L. F., Scacchi, S. (2013). BDDC preconditioners for isogeometric analysis. Mathematical Models and Methods in Applied Sciences, 23(06), Hofer et. al JKU Linz 14 / 23

18 dg-ieti-dp : Overview Introduction IETI-DP dg-ieti-dp Numerical examples Conclusion Hofer et. al JKU Linz 14 / 23

19 dg-ieti-dp : Problem formulation - dg setting Find u V h := k span{n i,p G (k) 1 }, such that a dg (u, v) = F, v v V h, where N N a dg (u, v) := a k (u, v), F, v := fv k dx, k=1 k=1 Ω k a k (u, v) = α k u k v k dx Ω k + ( α k uk l E Γ (k,l) 2 n (v l v k ) + v ) k n (u l u k ) ds k + µα k l E Γ (k,l) h (u l u k )(v l v k )ds, k Hofer et. al JKU Linz 15 / 23

20 dg-ieti-dp : Illustration of multipatch dg Hofer et. al JKU Linz 16 / 23

21 dg-ieti-dp : Decoupling of interface dofs Hofer et. al JKU Linz 17 / 23

22 dg-ieti-dp : Lagrange multipliers for decoupled dofs Hofer et. al JKU Linz 18 / 23

23 dg-ieti-dp : Remarks the dg-ieti-dp method can be seen as a cg-ieti-dp method on an extended grid principle can be extended to 3D: V + E + F scaled Dirichlet preconditioner: numerical examples also show quasi-optimal behavior w.r.t. H/h = max{h i /h i } and robustness w.r.t. jumps in α. κ(m 1 sd F ) C(1 + log(h/h))2 Hofer, C., Langer, U. (2016). Dual-primal isogeometric tearing and interconnecting solvers for multipatch dg-iga equations, Computer Methods in Applied Mechanics and Engineering. for finite elements: proven for 2D and 3D Dryja, M., Galvis, J., Sarkis, M. (2013). A FETI-DP preconditioner for a composite finite element and discontinuous Galerkin method Dryja, M., Sarkis, M. (2014). 3-D FETI-DP preconditioners for composite finite element-discontinuous Galerkin methods Hofer et. al JKU Linz 19 / 23

24 Numerical examples : Overview Introduction IETI-DP dg-ieti-dp Numerical examples Conclusion Hofer et. al JKU Linz 19 / 23

25 Numerical examples : Numerical example (a) Initial mesh of 2D computational domain (b) Initial mesh of 3D computational domain (c) Jumping coefficient pattern Hofer et. al JKU Linz 20 / 23

26 Numerical examples : 2D/3D domain, α {10 4, 10 4 }, p = 2 2D 3D V V #dofs H/h κ It. #dofs H/h κ It V + E V + E + F Hofer et. al JKU Linz 21 / 23

27 Numerical examples : Gaps & Overlaps with dg-ieti-dp, α = 1 d g h 1 2D 3D V + E V + E + F H/h #dofs κ It. #dofs κ It gap/overlap 0 if h 0 C. Hofer, U. Langer, and I. Toulopoulos (2015): Discontinuous Galerkin isogeometric analysis of elliptic problems on segmentations with gaps. RICAM-Report C. Hofer, and I. Toulopoulos (2015): Discontinuous Galerkin Isogeometric Analysis of Elliptic Problems on Segmentations with Non-Matching Interfaces. RICAM-Report C. Hofer, U. Langer, and I. Toulopoulos (2016): Discontinuous Galerkin Isogeometric Analysis on non matching segmentations: Error estimates and efficient solvers (under preparation) Hofer et. al JKU Linz 22 / 23

28 Conclusion : Overview Introduction IETI-DP dg-ieti-dp Numerical examples Conclusion Hofer et. al JKU Linz 22 / 23

29 Conclusion : Conclusion and further work quasi-optimal condition number estimate for IETI-DP adapted and implemented the IETI-DP algorithm for dg-iga formulation dg-ieti-dp for non-matching interface parametrizations (gaps & overlaps between patches) MPI is used to parallelize the method. proof for condition number bound of dg-ieti-dp is ongoing work. using inexact solvers for local problems (e.g. multigrid) dg-ieti-dp for space-time discretization Hofer et. al JKU Linz 23 / 23

30 Conclusion : Conclusion and further work quasi-optimal condition number estimate for IETI-DP adapted and implemented the IETI-DP algorithm for dg-iga formulation dg-ieti-dp for non-matching interface parametrizations (gaps & overlaps between patches) MPI is used to parallelize the method. proof for condition number bound of dg-ieti-dp is ongoing work. using inexact solvers for local problems (e.g. multigrid) dg-ieti-dp for space-time discretization Hofer et. al JKU Linz 23 / 23

31 Conclusion : Conclusion and further work Gap +Overlap: footprint test case 10 0 r=0.5 r=0.5 r=0.51 u u h dg r=1.52 r=1.50 r=2.1 r=1.50 r=2.1 r=2.0 r=2.07 r=2.0 r=2.03 d o+g =h 1 d o+g =h 2 d o+g =h 2.5 d o+g =h h u u h dg Ch min(s,β) ( u W l,2 + κ 2 ), where we assume that d g h λ, and s = min(p + 1, l) 1 and β = λ 1 2 Hofer et. al JKU Linz 23 / 23

32 Conclusion : p dependence: 2D + 3D & different multiplicity keeping multiplicity & increasing smoothness ( ) C p 1 elements increasing multiplicity & keeping smoothness ( ) C 1 elements 3.2 dependence on p (2D) 45 dependence on p (3D) coeff. scaling (increase mult.) coeff. scaling (increase mult.) 3 stiff. scaling (increase mult.) coeff. scaling (keep mult.) 40 stiff. scaling (increase mult.) coeff. scaling (keep mult.) 2.8 stiff. scaling (keep mult.) 35 stiff. scaling (keep mult.) condition number - κ condition number κ degree - p degree - p Hofer et. al JKU Linz 23 / 23

33 Conclusion : Conclusion and further work dim = 2 dim = 3 V coeff. V + E coeff. #dofs h i /h j H/h κ It. #dofs h i /h j H/h κ It V + E V + E + F Hofer et. al JKU Linz 23 / 23

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

Multipatch Space-Time Isogeometric Analysis of Parabolic Diffusion Problems. Ulrich Langer, Martin Neumüller, Ioannis Toulopoulos. G+S Report No.

Multipatch Space-Time Isogeometric Analysis of Parabolic Diffusion Problems. Ulrich Langer, Martin Neumüller, Ioannis Toulopoulos. G+S Report No. Multipatch Space-Time Isogeometric Analysis of Parabolic Diffusion Problems Ulrich Langer, Martin Neumüller, Ioannis Toulopoulos G+S Report No. 56 May 017 Multipatch Space-Time Isogeometric Analysis of

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 Isogeometric Discretizations

Domain Decomposition Preconditioners for Isogeometric Discretizations Domain Decomposition Preconditioners for Isogeometric Discretizations Luca F Pavarino, Università di Milano, Italy Lorenzo Beirao da Veiga, Università di Milano, Italy Durkbin Cho, Dongguk University,

More information

Substructuring for multiscale problems

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

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

ISOGEOMETRIC BDDC PRECONDITIONERS WITH DELUXE SCALING TR

ISOGEOMETRIC BDDC PRECONDITIONERS WITH DELUXE SCALING TR ISOGOMTRIC BDDC PRCONDITIONRS WITH DLUX SCALING L. BIRÃO DA VIGA, L.. PAVARINO, S. SCACCHI, O. B. WIDLUND, AND S. ZAMPINI TR2013-955 Abstract. A BDDC (Balancing Domain Decomposition by Constraints) preconditioner

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

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

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 Multipatch Space-Time IGA Solvers for Parabloic Initial-Boundary Value Problems

Parallel Multipatch Space-Time IGA Solvers for Parabloic Initial-Boundary Value Problems Parallel Multipatch Space-Time IGA Solvers for Parabloic Initial-Boundary Value Problems Ulrich Langer Institute of Computational Mathematics (NuMa) Johannes Kepler University Linz (RICAM) Austrian Academy

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

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

JOHANNES KEPLER UNIVERSITY LINZ. Institute of Computational Mathematics

JOHANNES KEPLER UNIVERSITY LINZ. Institute of Computational Mathematics JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Multipatch Space-Time Isogeometric Analysis of Parabolic Diffusion Problems Ulrich Langer Institute of Computational Mathematics,

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

Isogeometric Analysis:

Isogeometric Analysis: Isogeometric Analysis: some approximation estimates for NURBS L. Beirao da Veiga, A. Buffa, Judith Rivas, G. Sangalli Euskadi-Kyushu 2011 Workshop on Applied Mathematics BCAM, March t0th, 2011 Outline

More information

Dual-Primal Isogeometric Tearing and Interconnecting Solvers for large-scale systems of multipatch continuous Galerkin IgA equations

Dual-Primal Isogeometric Tearing and Interconnecting Solvers for large-scale systems of multipatch continuous Galerkin IgA equations www.oeaw.ac.at Dual-Primal Isogeometric Tearing and Interconnecting Solvers for large-scale systems of multipatc continuous Galerkin IgA equations C. Hofer, U. Langer RICAM-Report 2015-44 www.ricam.oeaw.ac.at

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

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

Condition number estimates for matrices arising in the isogeometric discretizations

Condition number estimates for matrices arising in the isogeometric discretizations www.oeaw.ac.at Condition number estimates for matrices arising in the isogeometric discretizations K. Gahalaut, S. Tomar RICAM-Report -3 www.ricam.oeaw.ac.at Condition number estimates for matrices arising

More information

Space-time isogeometric analysis of parabolic evolution equations

Space-time isogeometric analysis of parabolic evolution equations www.oeaw.ac.at Space-time isogeometric analysis of parabolic evolution equations U. Langer, S.E. Moore, M. Neumüller RICAM-Report 2015-19 www.ricam.oeaw.ac.at SPACE-TIME ISOGEOMETRIC ANALYSIS OF PARABOLIC

More information

Isogeometric mortaring

Isogeometric mortaring Isogeometric mortaring E. Brivadis, A. Buffa, B. Wohlmuth, L. Wunderlich IMATI E. Magenes - Pavia Technical University of Munich A. Buffa (IMATI-CNR Italy) IGA mortaring 1 / 29 1 Introduction Splines Approximation

More information

PhD dissertation defense

PhD dissertation defense Isogeometric mortar methods with applications in contact mechanics PhD dissertation defense Brivadis Ericka Supervisor: Annalisa Buffa Doctor of Philosophy in Computational Mechanics and Advanced Materials,

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

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

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

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

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

Matrix assembly by low rank tensor approximation

Matrix assembly by low rank tensor approximation Matrix assembly by low rank tensor approximation Felix Scholz 13.02.2017 References Angelos Mantzaflaris, Bert Juettler, Boris Khoromskij, and Ulrich Langer. Matrix generation in isogeometric analysis

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

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

JOHANNES KEPLER UNIVERSITY LINZ. Institute of Computational Mathematics

JOHANNES KEPLER UNIVERSITY LINZ. Institute of Computational Mathematics JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Schur Complement Preconditioners for Multiple Saddle Point Problems of Block Tridiagonal Form with Application to Optimization Problems

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

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

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

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

Space-time Finite Element Methods for Parabolic Evolution Problems

Space-time Finite Element Methods for Parabolic Evolution Problems Space-time Finite Element Methods for Parabolic Evolution Problems with Variable Coefficients Ulrich Langer, Martin Neumüller, Andreas Schafelner Johannes Kepler University, Linz Doctoral Program Computational

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

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1 Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,

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

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

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

A C 1 virtual element method for the Cahn-Hilliard equation with polygonal meshes. Marco Verani

A C 1 virtual element method for the Cahn-Hilliard equation with polygonal meshes. Marco Verani A C 1 virtual element method for the Cahn-Hilliard equation with polygonal meshes Marco Verani MOX, Department of Mathematics, Politecnico di Milano Joint work with: P. F. Antonietti (MOX Politecnico di

More information

arxiv: v1 [math.na] 11 Jul 2011

arxiv: v1 [math.na] 11 Jul 2011 Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov

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

Hybrid (DG) Methods for the Helmholtz Equation

Hybrid (DG) Methods for the Helmholtz Equation Hybrid (DG) Methods for the Helmholtz Equation Joachim Schöberl Computational Mathematics in Engineering Institute for Analysis and Scientific Computing Vienna University of Technology Contributions by

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

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

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

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

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

Nitsche-type Mortaring for Maxwell s Equations

Nitsche-type Mortaring for Maxwell s Equations Nitsche-type Mortaring for Maxwell s Equations Joachim Schöberl Karl Hollaus, Daniel Feldengut Computational Mathematics in Engineering at the Institute for Analysis and Scientific Computing Vienna University

More information

Mesh Grading towards Singular Points Seminar : Elliptic Problems on Non-smooth Domain

Mesh Grading towards Singular Points Seminar : Elliptic Problems on Non-smooth Domain Mesh Grading towards Singular Points Seminar : Elliptic Problems on Non-smooth Domain Stephen Edward Moore Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences,

More information

JOHANNES KEPLER UNIVERSITY LINZ. Institute of Computational Mathematics

JOHANNES KEPLER UNIVERSITY LINZ. Institute of Computational Mathematics JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Robust Multigrid for Isogeometric Analysis Based on Stable Splittings of Spline Spaces Clemens Hofreither Institute of Computational

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

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

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

arxiv: v1 [math.na] 7 Jan 2019

arxiv: v1 [math.na] 7 Jan 2019 Efficient p-multigrid Methods for Isogeometric Analysis R. Tielen a,, M. Möller a, D. Göddeke b, C. Vuik a arxiv:9.685v [math.na] 7 Jan 29 a Delft Institute of Applied Mathematics, Delft University of

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

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

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

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

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

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 uniform additive Schwarz preconditioner for high order Discontinuous Galerkin approximations of elliptic problems

A uniform additive Schwarz preconditioner for high order Discontinuous Galerkin approximations of elliptic problems Noname manuscript No. (will be inserted by the editor) A uniform additive Schwarz preconditioner for high order Discontinuous Galerkin approximations of elliptic problems Paola F. Antonietti Marco Sarti

More information

The Discontinuous Galerkin Finite Element Method

The Discontinuous Galerkin Finite Element Method The Discontinuous Galerkin Finite Element Method Michael A. Saum msaum@math.utk.edu Department of Mathematics University of Tennessee, Knoxville The Discontinuous Galerkin Finite Element Method p.1/41

More information

Parallel Discontinuous Galerkin Method

Parallel Discontinuous Galerkin Method Parallel Discontinuous Galerkin Method Yin Ki, NG The Chinese University of Hong Kong Aug 5, 2015 Mentors: Dr. Ohannes Karakashian, Dr. Kwai Wong Overview Project Goal Implement parallelization on Discontinuous

More information

An introduction to Isogeometric Analysis

An introduction to Isogeometric Analysis An introduction to Isogeometric Analysis A. Buffa 1, G. Sangalli 1,2, R. Vázquez 1 1 Istituto di Matematica Applicata e Tecnologie Informatiche - Pavia Consiglio Nazionale delle Ricerche 2 Dipartimento

More information

Mixed Finite Element Methods. Douglas N. Arnold, University of Minnesota The 41st Woudschoten Conference 5 October 2016

Mixed Finite Element Methods. Douglas N. Arnold, University of Minnesota The 41st Woudschoten Conference 5 October 2016 Mixed Finite Element Methods Douglas N. Arnold, University of Minnesota The 41st Woudschoten Conference 5 October 2016 Linear elasticity Given the load f : Ω R n, find the displacement u : Ω R n and the

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

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

cfl Jing Li All rights reserved, 22

cfl 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 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

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

18. Balancing Neumann-Neumann for (In)Compressible Linear Elasticity and (Generalized) Stokes Parallel Implementation

18. Balancing Neumann-Neumann for (In)Compressible Linear Elasticity and (Generalized) Stokes Parallel Implementation Fourteenth nternational Conference on Domain Decomposition Methods Editors: smael Herrera, David E Keyes, Olof B Widlund, Robert Yates c 23 DDMorg 18 Balancing Neumann-Neumann for (n)compressible Linear

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

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

Space-time XFEM for two-phase mass transport

Space-time XFEM for two-phase mass transport Space-time XFEM for two-phase mass transport Space-time XFEM for two-phase mass transport Christoph Lehrenfeld joint work with Arnold Reusken EFEF, Prague, June 5-6th 2015 Christoph Lehrenfeld EFEF, Prague,

More information

Multigrid Methods for Saddle Point Problems

Multigrid Methods for Saddle Point Problems Multigrid Methods for Saddle Point Problems Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University Advances in Mathematics of Finite Elements (In

More information

A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES

A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES P. HANSBO Department of Applied Mechanics, Chalmers University of Technology, S-4 96 Göteborg, Sweden E-mail: hansbo@solid.chalmers.se

More information

EFFICIENT MULTIGRID BASED SOLVERS FOR ISOGEOMETRIC ANALYSIS

EFFICIENT MULTIGRID BASED SOLVERS FOR ISOGEOMETRIC ANALYSIS 6th European Conference on Computational Mechanics (ECCM 6) 7th European Conference on Computational Fluid Dynamics (ECFD 7) 1115 June 2018, Glasgow, UK EFFICIENT MULTIGRID BASED SOLVERS FOR ISOGEOMETRIC

More information

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

Isogeometric Analysis with Geometrically Continuous Functions on Two-Patch Geometries

Isogeometric Analysis with Geometrically Continuous Functions on Two-Patch Geometries Isogeometric Analysis with Geometrically Continuous Functions on Two-Patch Geometries Mario Kapl a Vito Vitrih b Bert Jüttler a Katharina Birner a a Institute of Applied Geometry Johannes Kepler University

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

Indefinite and physics-based preconditioning

Indefinite 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 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

The CG1-DG2 method for conservation laws

The CG1-DG2 method for conservation laws for conservation laws Melanie Bittl 1, Dmitri Kuzmin 1, Roland Becker 2 MoST 2014, Germany 1 Dortmund University of Technology, Germany, 2 University of Pau, France CG1-DG2 Method - Motivation hp-adaptivity

More information

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semi-linear elliptic equations of the form: find

More information

On a Discontinuous Galerkin Method for Surface PDEs

On a Discontinuous Galerkin Method for Surface PDEs On a Discontinuous Galerkin Method for Surface PDEs Pravin Madhavan (joint work with Andreas Dedner and Bjo rn Stinner) Mathematics and Statistics Centre for Doctoral Training University of Warwick Applied

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

Final Ph.D. Progress Report. Integration of hp-adaptivity with a Two Grid Solver: Applications to Electromagnetics. David Pardo

Final Ph.D. Progress Report. Integration of hp-adaptivity with a Two Grid Solver: Applications to Electromagnetics. David Pardo Final Ph.D. Progress Report Integration of hp-adaptivity with a Two Grid Solver: Applications to Electromagnetics. David Pardo Dissertation Committee: I. Babuska, L. Demkowicz, C. Torres-Verdin, R. Van

More information

Scientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1

Scientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1 Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient

More information

The space of C 1 -smooth isogeometric spline functions on trilinearly parameterized volumetric two-patch domains. Katharina Birner and Mario Kapl

The space of C 1 -smooth isogeometric spline functions on trilinearly parameterized volumetric two-patch domains. Katharina Birner and Mario Kapl The space of C 1 -smooth isogeometric spline functions on trilinearly parameterized volumetric two-patch domains Katharina Birner and Mario Kapl G+S Report No. 69 March 2018 The space of C 1 -smooth isogeometric

More information

Stochastic multiscale modeling of subsurface and surface flows. Part III: Multiscale mortar finite elements for coupled Stokes-Darcy flows

Stochastic multiscale modeling of subsurface and surface flows. Part III: Multiscale mortar finite elements for coupled Stokes-Darcy flows Stochastic multiscale modeling of subsurface and surface flows. Part III: Multiscale mortar finite elements for coupled Stokes-Darcy flows Ivan otov Department of Mathematics, University of Pittsburgh

More information

Numerical Approximation Methods for Elliptic Boundary Value Problems

Numerical Approximation Methods for Elliptic Boundary Value Problems Numerical Approximation Methods for Elliptic Boundary Value Problems Olaf Steinbach Numerical Approximation Methods for Elliptic Boundary Value Problems Finite and Boundary Elements Olaf Steinbach Institute

More information

From the Boundary Element DDM to local Trefftz Finite Element Methods on Polyhedral Meshes

From the Boundary Element DDM to local Trefftz Finite Element Methods on Polyhedral Meshes www.oeaw.ac.at From the Boundary Element DDM to local Trefftz Finite Element Methods on Polyhedral Meshes D. Copeland, U. Langer, D. Pusch RICAM-Report 2008-10 www.ricam.oeaw.ac.at From the Boundary Element

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