Multilevel spectral coarse space methods in FreeFem++ on parallel architectures
|
|
- Jemimah O’Connor’
- 5 years ago
- Views:
Transcription
1 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 F. Nataf, N. Spillane, V. Dolean, F. Hecht, C. Prud homme.
2 Outline 1 Introduction Context Problem setting 2 Spectral coarse space A quick overview Construction of a suitable deflation matrix 3 Implementation and numerical results Implementation framework Computing resources Scalability tests 4 Conclusion 2 / 22 Pierre Jolivet DD 21
3 Context Solve large systems arising from the finite element method. 3 / 22 Pierre Jolivet DD 21
4 Context Solve large systems arising from the finite element method. What are the different alternatives? parallel direct solvers (MUMPS, SuperLU, PaStiX..), parallel iterative solvers (HIPS, Hypre..), hybrid solvers (BoomerAMG, ML, PARDISO..),... 3 / 22 Pierre Jolivet DD 21
5 Context Solve large systems arising from the finite element method. What are the different alternatives? parallel direct solvers (MUMPS, SuperLU, PaStiX..), parallel iterative solvers (HIPS, Hypre..), hybrid solvers (BoomerAMG, ML, PARDISO..),... = high-performance algorithms on massively parallel distributed memory multiprocessor architectures. Constraints: robust in size and heterogeneities, easy to maintain. 3 / 22 Pierre Jolivet DD 21
6 Boundary value problems Given a FE space V and f V, find u V such that: a(u, v) = f, v v V = Au = F where a Ω (u, v) = a Ω (u, v) = Ω Ω κ u v C : ε(u) : ε(v) = A is assumed to be SPD 4 / 22 Pierre Jolivet DD 21
7 Notation Ω is split into N overlapping subdomains {Ω i } N i=1 {V i } N i=1. Let: R i be the restriction from V to Vi (thus Ri T is the extension by 0 from V i to V ), A ij := R i ARj T, O i the set of neighboring subdomains (and O i = O i {i}), {χ i } N i=1 be a partition of unity: supp(χ i ) Ω i and N χ i = 1, i=1 {D i } N i=1 be the discretization of this partition: N Ri T D i R i = I. i=1 5 / 22 Pierre Jolivet DD 21
8 One-level Schwarz method Two classical preconditioners are: N MRAS 1 = Ri T i=1 N MASM 1 = Ri T i=1 D i A 1 ii R i A 1 ii R i Some properties obviously parallel, not scalable. 6 / 22 Pierre Jolivet DD 21
9 Outline 1 Introduction 2 Spectral coarse space A quick overview Construction of a suitable deflation matrix 3 Implementation and numerical results 4 Conclusion 7 / 22 Pierre Jolivet DD 21
10 Principle Let Z be a rectangular matrix so that the bad eigenvectors of M 1 A belong to the space spanned by its columns. Define: E := Z T AZ P := I AQ Q := ZE 1 Z T = the number of columns of Z is O(N). 8 / 22 Pierre Jolivet DD 21
11 Principle Let Z be a rectangular matrix so that the bad eigenvectors of M 1 A belong to the space spanned by its columns. Define: E := Z T AZ P := I AQ Q := ZE 1 Z T = the number of columns of Z is O(N). Two-level preconditioners P BNN := (I AQ) T M 1 (I AQ) + Q P A-DEF1 := M 1 (I AQ) + Q P A-DEF2 := (I AQ) T M 1 + Q Differences and similarities studied in (Tang et al. 2009). 8 / 22 Pierre Jolivet DD 21
12 Principle Let Z be a rectangular matrix so that the bad eigenvectors of M 1 A belong to the space spanned by its columns. Define: E := Z T AZ P := I AQ Q := ZE 1 Z T = the number of columns of Z is O(N). Two-level preconditioners P BNN := (I AQ) T M 1 (I AQ) + Q P A-DEF1 := M 1 (I AQ) + Q P A-DEF2 := (I AQ) T M 1 + Q Differences and similarities studied in (Tang et al. 2009). The real problem is: how to build Z? 8 / 22 Pierre Jolivet DD 21
13 A priori construction Based on an analysis of the underlying PDE, (Nataf et al. 2011; Spillane et al. 2011) M13P1. Generalized eigenvalue problem on the overlap On each Ω i, find the eigenpairs (Λ ik, λ ik ) k such that: a Ωi (Λ ik, v i ) = λ ik a Ω i (χ i Λ ik, χ i v i ) v i V i which after discretization yields: A i Λ ik = λ ik D i A i D i Λ ik 9 / 22 Pierre Jolivet DD 21
14 A threshold criterion selects only ν i eigenvectors associated to low frequency eigenvalues: W W Z = W N where W i = [ D i Λ i1 D i Λ i2 D i Λ iνi ] 10 / 22 Pierre Jolivet DD 21
15 Outline 1 Introduction 2 Spectral coarse space 3 Implementation and numerical results Implementation framework Computing resources Scalability tests 4 Conclusion 11 / 22 Pierre Jolivet DD 21
16 Domain Specific Language FreeFem++, with the help of: Metis (Karypis and Kumar 1998) SCOTCH (Chevalier and Pellegrini 2008) UMFPACK (Davis 2004) ARPACK (Lehoucq et al. 1998) SLEPc (Hernandez et al. 2005) BLOPEX (Knyazev et al. 2007) MPI (Snir et al. 1995) / 22 Pierre Jolivet DD 21
17 Domain Specific Language FreeFem++, with the help of: Metis (Karypis and Kumar 1998) SCOTCH (Chevalier and Pellegrini 2008) UMFPACK (Davis 2004) ARPACK (Lehoucq et al. 1998) SLEPc (Hernandez et al. 2005) BLOPEX (Knyazev et al. 2007) MPI (Snir et al. 1995)... Why use a DS(E)L instead of C/C++/Fortran/..? performances close to low-level language implementation, hard to beat something as simple as: varf a(u, v) = int3d(mesh)([dx(u), dy(u), dz(u)] * [dx(v), dy(v), dz(v)]) + int3d(mesh)(f * v) + on(boundary_mesh)(u = 0) 12 / 22 Pierre Jolivet DD 21
18 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k Cannot be done with FreeFem++. k O j 13 / 22 Pierre Jolivet DD 21
19 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap A jk D k R k u = R j R T k A kk D k R k u 13 / 22 Pierre Jolivet DD 21
20 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap A jk D k R k u = R j R T k A kk D k R k u 13 / 22 Pierre Jolivet DD 21
21 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap What does it mean? A jk D k R k u = R j R T k A kk D k R k u Au = black box plugged with a Krylov method 13 / 22 Pierre Jolivet DD 21
22 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap What does it mean? A jk D k R k u = R j R T k A kk D k R k u Au = N j=1 AR T j D j R j u 13 / 22 Pierre Jolivet DD 21
23 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap What does it mean? A jk D k R k u = R j R T k A kk D k R k u N R i Au = R i ARj T j=1 D j R j u 13 / 22 Pierre Jolivet DD 21
24 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap What does it mean? A jk D k R k u = R j R T k A kk D k R k u N R i Au = R i ARj T D j R j u = A ij D j R j u j=1 j O i = R i Rj T A jj D j R j u j O i 13 / 22 Pierre Jolivet DD 21
25 Reformulation Parallel FE computations implies parallel matrix assembly: A jk := R j AR T k k O j Cannot be done with FreeFem++. A simple transformation on the overlap What does it mean? A jk D k R k u = R j R T k A kk D k R k u N R i Au = R i ARj T D j R j u = A ij D j R j u j=1 j O i = R i Rj T A jj D j R j u j O i local unknowns on V j 13 / 22 Pierre Jolivet DD 21
26 Coarse space construction The same goes for the construction of E := Z T AZ. A double block matrix multiplication E ij = Λ T R(i) ϕ(i) D R(i) A R(i)R(j) D R(j) Λ R(j)ϕ(j) where { } i R : j max i : ν k < j k=1 ϕ : j j R(j) ν k k=1 A similar reformulation leads to: E ij = Λ T R(i) ϕ(i) D R(i) R i R T j A R(j)R(j) D R(j) Λ R(j)ϕ(j) 0 j O i 14 / 22 Pierre Jolivet DD 21
27 Heterogeneous architectures N cores Memory Peak performance Compilers titane@cea To 140 TFLOP/s Intel babel@idris To 139 TFLOP/s IBM + GNU curie@cea To 2 PFLOP/s Intel CUDA cores ANR Preconditioning scientific applications on petascale Heterogeneous machines PRACE High Performance Computing-PDE Bruyères-le-Châtel, France. Orsay, France. 15 / 22 Pierre Jolivet DD 21
28 Darcy pressure equation I κ(x, y) x y Fig: Two dimensional diffusivity κ 16 / 22 Pierre Jolivet DD 21
29 Darcy pressure equation II Number of d.o.f Number of iterations: 20 Setup time: 1min30s Solve time: 20s % 80 % 60 % 40 % 20 % 0 % Fig: 2D efficiency (weak scaling) P 3 FE, stopping criterion ε = / 22 Pierre Jolivet DD 21
30 System of linear elasticity I (60M unkowns) Timing relative to 1024 cores UMFPACK blowup for the factorization of E: 1min 2048 Linear speedup Fig: 3D strong scaling P 2 FE, stopping criterion ε = Number of iterations 18 / 22 Pierre Jolivet DD 21
31 System of linear elasticity II (375M unkowns) Timing relative to 1024 cores Linear speedup Fig: 2D strong scaling P 3 FE, stopping criterion ε = Number of iterations 19 / 22 Pierre Jolivet DD 21
32 The limits reached 6144-way decomposition: in R 2, 1.2G unkowns, in R 3, 300M unkowns. All systems are solved with: coarse spaces of size 100; , less than 30 iterations. 20 / 22 Pierre Jolivet DD 21
33 Outline 1 Introduction 2 Spectral coarse space 3 Implementation and numerical results 4 Conclusion 21 / 22 Pierre Jolivet DD 21
34 Final words What to remember: FreeFem++ + = easy framework to solve large systems. Two-level DDM New problems being tackled: nonlinear elasticity (Newton-Krylov-Schwarz methods), reuse of Krylov and deflation subspaces. 22 / 22 Pierre Jolivet DD 21
35 Final words What to remember: FreeFem++ + = easy framework to solve large systems. Two-level DDM New problems being tackled: nonlinear elasticity (Newton-Krylov-Schwarz methods), reuse of Krylov and deflation subspaces. Thanks for your attention. 22 / 22 Pierre Jolivet DD 21
36 References Chevalier, C. and F. Pellegrini (2008). PT-Scotch: a tool for efficient parallel graph ordering. In: Parallel Computing 34.6, pp Davis, T.A. (2004). Algorithm 832: UMFPACK an unsymmetric-pattern multifrontal method. In: ACM Transactions on Mathematical Software 30.2, pp Hernandez, V., J.E Roman, and V. Vidal (2005). SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems. In: ACM Transactions on Mathematical Software 31.3, pp Karypis, G. and V. Kumar (1998). A fast and high quality multilevel scheme for partitioning irregular graphs. In: SIAM Journal on Scientific Computing 20.1, pp / 3 (+ 22) Pierre Jolivet DD 21
37 References Knyazev, A.V., M.E. Argentati, I. Lashuk, and E. Ovtchinnikov (2007). Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc. In: SIAM Journal on Scientific Computing 29.5, pp Lehoucq, R.B., D.C. Sorensen, and C. Yang (1998). ARPACK users guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. Vol. 6. Society for Industrial and Applied Mathematics. Nataf, F., H. Xiang, V. Dolean, and N. Spillane (2011). A coarse space construction based on local Dirichlet to Neumann maps. In: SIAM Journal on Scientific Computing 33.4, pp Snir, M., S.W. Otto, D.W. Walker, J. Dongarra, and S. Huss-Lederman (1995). MPI: The complete reference. The MIT Press. 2 / 3 (+ 22) Pierre Jolivet DD 21
38 References Spillane, N., V. Dolean, P. Hauret, F. Nataf, C. Pechstein, and R. Scheichl (2011). A robust two-level domain decomposition preconditioner for systems of PDEs. In: Comptes Rendus Mathematique , pp Tang, J.M., R. Nabben, C. Vuik, and Y.A. Erlangga (2009). Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods. In: Journal of Scientific Computing 39.3, pp / 3 (+ 22) Pierre Jolivet DD 21
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 informationToward 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 informationScalable 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 informationRecent advances in HPC with FreeFem++
Recent advances in HPC with FreeFem++ Pierre Jolivet Laboratoire Jacques-Louis Lions Laboratoire Jean Kuntzmann Fourth workshop on FreeFem++ December 6, 2012 With F. Hecht, F. Nataf, C. Prud homme. Outline
More informationHPDDM une bibliothèque haute performance unifiée pour les méthodes de décomposition de domaine
HPDDM une bibliothèque haute performance unifiée pour les méthodes de décomposition de domaine P. Jolivet and Frédéric Nataf Laboratory J.L. Lions, Univ. Paris VI, Equipe Alpines INRIA-LJLL et CNRS joint
More informationOverlapping Domain Decomposition Methods with FreeFem++
Overlapping Domain Decomposition Methods with FreeFem++ Pierre Jolivet, Frédéric Hecht, Frédéric Nataf, Christophe Prud Homme To cite this version: Pierre Jolivet, Frédéric Hecht, Frédéric Nataf, Christophe
More informationOverlapping domain decomposition methods withfreefem++
Overlapping domain decomposition methods withfreefem++ Pierre Jolivet 1,3, Frédéric Hecht 1, Frédéric Nataf 1, and Christophe Prud homme 2 1 Introduction Developping an efficient and versatile framework
More informationAvancé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 informationDomain decomposition, hybrid methods, coarse space corrections
Domain decomposition, hybrid methods, coarse space corrections Victorita Dolean, Pierre Jolivet & Frédéric Nataf UNICE, ENSEEIHT & UPMC and CNRS CEMRACS 2016 18 22 July 2016 Outline 1 Introduction 2 Schwarz
More informationA Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation
A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition
More informationTwo-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations
Two-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations Marcella Bonazzoli 2, Victorita Dolean 1,4, Ivan G. Graham 3, Euan A. Spence 3, Pierre-Henri Tournier
More informationMultipréconditionnement adaptatif pour les méthodes de décomposition de domaine. Nicole Spillane (CNRS, CMAP, École Polytechnique)
Multipréconditionnement adaptatif pour les méthodes de décomposition de domaine Nicole Spillane (CNRS, CMAP, École Polytechnique) C. Bovet (ONERA), P. Gosselet (ENS Cachan), A. Parret Fréaud (SafranTech),
More informationSome examples in domain decomposition
Some examples in domain decomposition Frédéric Nataf nataf@ann.jussieu.fr, www.ann.jussieu.fr/ nataf Laboratoire J.L. Lions, CNRS UMR7598. Université Pierre et Marie Curie, France Joint work with V. Dolean
More informationArnoldi Methods in SLEPc
Scalable Library for Eigenvalue Problem Computations SLEPc Technical Report STR-4 Available at http://slepc.upv.es Arnoldi Methods in SLEPc V. Hernández J. E. Román A. Tomás V. Vidal Last update: October,
More informationOn the choice of abstract projection vectors for second level preconditioners
On the choice of abstract projection vectors for second level preconditioners C. Vuik 1, J.M. Tang 1, and R. Nabben 2 1 Delft University of Technology 2 Technische Universität Berlin Institut für Mathematik
More informationJOHANNES 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 informationParallel sparse linear solvers and applications in CFD
Parallel sparse linear solvers and applications in CFD Jocelyne Erhel Joint work with Désiré Nuentsa Wakam () and Baptiste Poirriez () SAGE team, Inria Rennes, France journée Calcul Intensif Distribué
More informationEfficient domain decomposition methods for the time-harmonic Maxwell equations
Efficient domain decomposition methods for the time-harmonic Maxwell equations Marcella Bonazzoli 1, Victorita Dolean 2, Ivan G. Graham 3, Euan A. Spence 3, Pierre-Henri Tournier 4 1 Inria Saclay (Defi
More informationVarious ways to use a second level preconditioner
Various ways to use a second level preconditioner C. Vuik 1, J.M. Tang 1, R. Nabben 2, and Y. Erlangga 3 1 Delft University of Technology Delft Institute of Applied Mathematics 2 Technische Universität
More informationC. Vuik 1 R. Nabben 2 J.M. Tang 1
Deflation acceleration of block ILU preconditioned Krylov methods C. Vuik 1 R. Nabben 2 J.M. Tang 1 1 Delft University of Technology J.M. Burgerscentrum 2 Technical University Berlin Institut für Mathematik
More informationLecture 8: Fast Linear Solvers (Part 7)
Lecture 8: Fast Linear Solvers (Part 7) 1 Modified Gram-Schmidt Process with Reorthogonalization Test Reorthogonalization If Av k 2 + δ v k+1 2 = Av k 2 to working precision. δ = 10 3 2 Householder Arnoldi
More informationA High-Performance Parallel Hybrid Method for Large Sparse Linear Systems
Outline A High-Performance Parallel Hybrid Method for Large Sparse Linear Systems Azzam Haidar CERFACS, Toulouse joint work with Luc Giraud (N7-IRIT, France) and Layne Watson (Virginia Polytechnic Institute,
More informationAdaptive 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 informationAn introduction to Schwarz methods
An introduction to Schwarz methods Victorita Dolean Université de Nice and University of Geneva École thematique CNRS Décomposition de domaine November 15-16, 2011 Outline 1 Introduction 2 Schwarz algorithms
More informationA decade of fast and robust Helmholtz solvers
A decade of fast and robust Helmholtz solvers Werkgemeenschap Scientific Computing Spring meeting Kees Vuik May 11th, 212 1 Delft University of Technology Contents Introduction Preconditioning (22-28)
More informationArchitecture Solutions for DDM Numerical Environment
Architecture Solutions for DDM Numerical Environment Yana Gurieva 1 and Valery Ilin 1,2 1 Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia 2 Novosibirsk State
More informationFrom Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D
From Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D Luc Giraud N7-IRIT, Toulouse MUMPS Day October 24, 2006, ENS-INRIA, Lyon, France Outline 1 General Framework 2 The direct
More informationLinear Solvers. Andrew Hazel
Linear Solvers Andrew Hazel Introduction Thus far we have talked about the formulation and discretisation of physical problems...... and stopped when we got to a discrete linear system of equations. Introduction
More informationRecent implementations, applications, and extensions of the Locally Optimal Block Preconditioned Conjugate Gradient method LOBPCG
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Recent implementations, applications, and extensions of the Locally Optimal Block Preconditioned Conjugate Gradient method LOBPCG Knyazev,
More informationTHEORETICAL AND NUMERICAL COMPARISON OF PROJECTION METHODS DERIVED FROM DEFLATION, DOMAIN DECOMPOSITION AND MULTIGRID METHODS
THEORETICAL AND NUMERICAL COMPARISON OF PROJECTION METHODS DERIVED FROM DEFLATION, DOMAIN DECOMPOSITION AND MULTIGRID METHODS J.M. TANG, R. NABBEN, C. VUIK, AND Y.A. ERLANGGA Abstract. For various applications,
More informationScalable domain decomposition preconditioners for heterogeneous elliptic problems 1
Scientific Programming 22 (2014) 157 171 157 DOI 10.3233/SPR-140381 IOS Press Scalable domain decomposition preconditioners for heterogeneous elliptic problems 1 Pierre Jolivet a,b,c,, Frédéric Hecht b,c,
More informationSome Geometric and Algebraic Aspects of Domain Decomposition Methods
Some Geometric and Algebraic Aspects of Domain Decomposition Methods D.S.Butyugin 1, Y.L.Gurieva 1, V.P.Ilin 1,2, and D.V.Perevozkin 1 Abstract Some geometric and algebraic aspects of various domain decomposition
More informationIterative Helmholtz Solvers
Iterative Helmholtz Solvers Scalability of deflation-based Helmholtz solvers Delft University of Technology Vandana Dwarka March 28th, 2018 Vandana Dwarka (TU Delft) 15th Copper Mountain Conference 2018
More informationElectronic 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 informationANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow
ANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow Michel Kern Inria Paris Rocquencourt Maison de la Simulation C2S@Exa Days, Inria Paris Centre, Novembre 2016 M. Kern
More informationAn Introduction to Domain Decomposition Methods: algorithms, theory and parallel implementation
An Introduction to Domain Decomposition Methods: algorithms, theory and parallel implementation Victorita Dolean, Pierre Jolivet, Frédéric ataf To cite this version: Victorita Dolean, Pierre Jolivet, Frédéric
More informationMaster Thesis Literature Study Presentation
Master Thesis Literature Study Presentation Delft University of Technology The Faculty of Electrical Engineering, Mathematics and Computer Science January 29, 2010 Plaxis Introduction Plaxis Finite Element
More informationOpen-source finite element solver for domain decomposition problems
1/29 Open-source finite element solver for domain decomposition problems C. Geuzaine 1, X. Antoine 2,3, D. Colignon 1, M. El Bouajaji 3,2 and B. Thierry 4 1 - University of Liège, Belgium 2 - University
More informationarxiv: 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 informationPreconditioned Eigensolver LOBPCG in hypre and PETSc
Preconditioned Eigensolver LOBPCG in hypre and PETSc Ilya Lashuk, Merico Argentati, Evgueni Ovtchinnikov, and Andrew Knyazev Department of Mathematics, University of Colorado at Denver, P.O. Box 173364,
More informationIs there life after the Lanczos method? What is LOBPCG?
1 Is there life after the Lanczos method? What is LOBPCG? Andrew V. Knyazev Department of Mathematics and Center for Computational Mathematics University of Colorado at Denver SIAM ALA Meeting, July 17,
More informationParallelism in FreeFem++.
Parallelism in FreeFem++. Guy Atenekeng 1 Frederic Hecht 2 Laura Grigori 1 Jacques Morice 2 Frederic Nataf 2 1 INRIA, Saclay 2 University of Paris 6 Workshop on FreeFem++, 2009 Outline 1 Introduction Motivation
More informationDomain Decomposition solvers (FETI)
Domain Decomposition solvers (FETI) a random walk in history and some current trends Daniel J. Rixen Technische Universität München Institute of Applied Mechanics www.amm.mw.tum.de rixen@tum.de 8-10 October
More informationFinite element programming by FreeFem++ advanced course
1 / 37 Finite element programming by FreeFem++ advanced course Atsushi Suzuki 1 1 Cybermedia Center, Osaka University atsushi.suzuki@cas.cmc.osaka-u.ac.jp Japan SIAM tutorial 4-5, June 2016 2 / 37 Outline
More informationTwo 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 informationShifted Laplace and related preconditioning for the Helmholtz equation
Shifted Laplace and related preconditioning for the Helmholtz equation Ivan Graham and Euan Spence (Bath, UK) Collaborations with: Paul Childs (Schlumberger Gould Research), Martin Gander (Geneva) Douglas
More informationMultigrid absolute value preconditioning
Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical
More informationA Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation
A Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation Zih-Hao Wei 1, Feng-Nan Hwang 1, Tsung-Ming Huang 2, and Weichung Wang 3 1 Department of
More informationAlgebraic 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 informationIterative methods for symmetric eigenvalue problems
s Iterative s for symmetric eigenvalue problems, PhD McMaster University School of Computational Engineering and Science February 11, 2008 s 1 The power and its variants Inverse power Rayleigh quotient
More informationOUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU
Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative
More informationarxiv: v1 [cs.ce] 9 Jul 2016
Microwave Tomographic Imaging of Cerebrovascular Accidents by Using High-Performance Computing arxiv:1607.02573v1 [cs.ce] 9 Jul 2016 P.-H. Tournier a,b, I. Aliferis c, M. Bonazzoli d, M. de Buhan e, M.
More informationSparse Matrix Computations in Arterial Fluid Mechanics
Sparse Matrix Computations in Arterial Fluid Mechanics Murat Manguoğlu Middle East Technical University, Turkey Kenji Takizawa Ahmed Sameh Tayfun Tezduyar Waseda University, Japan Purdue University, USA
More informationEIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems
EIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems JAMES H. MONEY and QIANG YE UNIVERSITY OF KENTUCKY eigifp is a MATLAB program for computing a few extreme eigenvalues
More informationIsogEometric 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 informationA Parallel Implementation of the Davidson Method for Generalized Eigenproblems
A Parallel Implementation of the Davidson Method for Generalized Eigenproblems Eloy ROMERO 1 and Jose E. ROMAN Instituto ITACA, Universidad Politécnica de Valencia, Spain Abstract. We present a parallel
More informationChallenges for Matrix Preconditioning Methods
Challenges for Matrix Preconditioning Methods Matthias Bollhoefer 1 1 Dept. of Mathematics TU Berlin Preconditioning 2005, Atlanta, May 19, 2005 supported by the DFG research center MATHEON in Berlin Outline
More informationParallel Algorithms for Solution of Large Sparse Linear Systems with Applications
Parallel Algorithms for Solution of Large Sparse Linear Systems with Applications Murat Manguoğlu Department of Computer Engineering Middle East Technical University, Ankara, Turkey Prace workshop: HPC
More informationSOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA
1 SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA 2 OUTLINE Sparse matrix storage format Basic factorization
More informationParallel Preconditioning Methods for Ill-conditioned Problems
Parallel Preconditioning Methods for Ill-conditioned Problems Kengo Nakajima Information Technology Center, The University of Tokyo 2014 Conference on Advanced Topics and Auto Tuning in High Performance
More informationSchwarz Preconditioner for the Stochastic Finite Element Method
Schwarz Preconditioner for the Stochastic Finite Element Method Waad Subber 1 and Sébastien Loisel 2 Preprint submitted to DD22 conference 1 Introduction The intrusive polynomial chaos approach for uncertainty
More informationSolving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners
Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University of Minnesota 2 Department
More informationRobust solution of Poisson-like problems with aggregation-based AMG
Robust solution of Poisson-like problems with aggregation-based AMG Yvan Notay Université Libre de Bruxelles Service de Métrologie Nucléaire Paris, January 26, 215 Supported by the Belgian FNRS http://homepages.ulb.ac.be/
More informationSome 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 informationPreconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators
Preconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University
More informationA dissection solver with kernel detection for unsymmetric matrices in FreeFem++
. p.1/21 11 Dec. 2014, LJLL, Paris FreeFem++ workshop A dissection solver with kernel detection for unsymmetric matrices in FreeFem++ Atsushi Suzuki Atsushi.Suzuki@ann.jussieu.fr Joint work with François-Xavier
More informationJ.I. Aliaga 1 M. Bollhöfer 2 A.F. Martín 1 E.S. Quintana-Ortí 1. March, 2009
Parallel Preconditioning of Linear Systems based on ILUPACK for Multithreaded Architectures J.I. Aliaga M. Bollhöfer 2 A.F. Martín E.S. Quintana-Ortí Deparment of Computer Science and Engineering, Univ.
More informationImplementation of a preconditioned eigensolver using Hypre
Implementation of a preconditioned eigensolver using Hypre Andrew V. Knyazev 1, and Merico E. Argentati 1 1 Department of Mathematics, University of Colorado at Denver, USA SUMMARY This paper describes
More informationOptimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms
Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Marcus Sarkis Worcester Polytechnic Inst., Mass. and IMPA, Rio de Janeiro and Daniel
More informationMigration with Implicit Solvers for the Time-harmonic Helmholtz
Migration with Implicit Solvers for the Time-harmonic Helmholtz Yogi A. Erlangga, Felix J. Herrmann Seismic Laboratory for Imaging and Modeling, The University of British Columbia {yerlangga,fherrmann}@eos.ubc.ca
More informationDomain Decomposition-based contour integration eigenvalue solvers
Domain Decomposition-based contour integration eigenvalue solvers Vassilis Kalantzis joint work with Yousef Saad Computer Science and Engineering Department University of Minnesota - Twin Cities, USA SIAM
More informationDomain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions
Domain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions Bernhard Hientzsch Courant Institute of Mathematical Sciences, New York University, 51 Mercer Street, New
More informationDeflated Krylov Iterations in Domain Decomposition Methods
305 Deflated Krylov Iterations in Domain Decomposition Methods Y.L.Gurieva 1, V.P.Ilin 1,2, and D.V.Perevozkin 1 1 Introduction The goal of this research is an investigation of some advanced versions of
More informationAn Accelerated Block-Parallel Newton Method via Overlapped Partitioning
An Accelerated Block-Parallel Newton Method via Overlapped Partitioning Yurong Chen Lab. of Parallel Computing, Institute of Software, CAS (http://www.rdcps.ac.cn/~ychen/english.htm) Summary. This paper
More informationSubstructuring 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 informationA Numerical Study of Some Parallel Algebraic Preconditioners
A Numerical Study of Some Parallel Algebraic Preconditioners Xing Cai Simula Research Laboratory & University of Oslo PO Box 1080, Blindern, 0316 Oslo, Norway xingca@simulano Masha Sosonkina University
More informationAn Asynchronous Algorithm on NetSolve Global Computing System
An Asynchronous Algorithm on NetSolve Global Computing System Nahid Emad S. A. Shahzadeh Fazeli Jack Dongarra March 30, 2004 Abstract The Explicitly Restarted Arnoldi Method (ERAM) allows to find a few
More informationFakultä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 informationInexactness and flexibility in linear Krylov solvers
Inexactness and flexibility in linear Krylov solvers Luc Giraud ENSEEIHT (N7) - IRIT, Toulouse Matrix Analysis and Applications CIRM Luminy - October 15-19, 2007 in honor of Gérard Meurant for his 60 th
More informationPreconditioned inverse iteration and shift-invert Arnoldi method
Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical
More informationREPORT DOCUMENTATION PAGE
REPORT DOCUMENTATION PAGE Form Approved OMB NO. 0704-0188 The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions,
More informationOn deflation and singular symmetric positive semi-definite matrices
Journal of Computational and Applied Mathematics 206 (2007) 603 614 www.elsevier.com/locate/cam On deflation and singular symmetric positive semi-definite matrices J.M. Tang, C. Vuik Faculty of Electrical
More informationSchwarz-type methods and their application in geomechanics
Schwarz-type methods and their application in geomechanics R. Blaheta, O. Jakl, K. Krečmer, J. Starý Institute of Geonics AS CR, Ostrava, Czech Republic E-mail: stary@ugn.cas.cz PDEMAMIP, September 7-11,
More informationLecture 17: Iterative Methods and Sparse Linear Algebra
Lecture 17: Iterative Methods and Sparse Linear Algebra David Bindel 25 Mar 2014 Logistics HW 3 extended to Wednesday after break HW 4 should come out Monday after break Still need project description
More informationMARCH 24-27, 2014 SAN JOSE, CA
MARCH 24-27, 2014 SAN JOSE, CA Sparse HPC on modern architectures Important scientific applications rely on sparse linear algebra HPCG a new benchmark proposal to complement Top500 (HPL) To solve A x =
More informationEnhancing Scalability of Sparse Direct Methods
Journal of Physics: Conference Series 78 (007) 0 doi:0.088/7-6596/78//0 Enhancing Scalability of Sparse Direct Methods X.S. Li, J. Demmel, L. Grigori, M. Gu, J. Xia 5, S. Jardin 6, C. Sovinec 7, L.-Q.
More informationDeflation Strategies to Improve the Convergence of Communication-Avoiding GMRES
Deflation Strategies to Improve the Convergence of Communication-Avoiding GMRES Ichitaro Yamazaki, Stanimire Tomov, and Jack Dongarra Department of Electrical Engineering and Computer Science University
More informationFine-grained Parallel Incomplete LU Factorization
Fine-grained Parallel Incomplete LU Factorization Edmond Chow School of Computational Science and Engineering Georgia Institute of Technology Sparse Days Meeting at CERFACS June 5-6, 2014 Contribution
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 12-10 Fast linear solver for pressure computation in layered domains P. van Slingerland and C. Vuik ISSN 1389-6520 Reports of the Department of Applied Mathematical
More informationSOME 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 informationFINDING PARALLELISM IN GENERAL-PURPOSE LINEAR PROGRAMMING
FINDING PARALLELISM IN GENERAL-PURPOSE LINEAR PROGRAMMING Daniel Thuerck 1,2 (advisors Michael Goesele 1,2 and Marc Pfetsch 1 ) Maxim Naumov 3 1 Graduate School of Computational Engineering, TU Darmstadt
More informationAuxiliary 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 informationStabilization and Acceleration of Algebraic Multigrid Method
Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration
More informationMultilevel and Adaptive Iterative Substructuring Methods. Jan Mandel University of Colorado Denver
Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver The multilevel BDDC method is joint work with Bedřich Sousedík, Czech Technical University, and Clark Dohrmann,
More informationElmer. Introduction into Elmer multiphysics. Thomas Zwinger. CSC Tieteen tietotekniikan keskus Oy CSC IT Center for Science Ltd.
Elmer Introduction into Elmer multiphysics FEM package Thomas Zwinger CSC Tieteen tietotekniikan keskus Oy CSC IT Center for Science Ltd. Contents Elmer Background History users, community contacts and
More informationMultispace and Multilevel BDDC. Jan Mandel University of Colorado at Denver and Health Sciences Center
Multispace and Multilevel BDDC Jan Mandel University of Colorado at Denver and Health Sciences Center Based on joint work with Bedřich Sousedík, UCDHSC and Czech Technical University, and Clark R. Dohrmann,
More informationPreface to the Second Edition. Preface to the First Edition
n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................
More informationRobust 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 informationConstruction of a New Domain Decomposition Method for the Stokes Equations
Construction of a New Domain Decomposition Method for the Stokes Equations Frédéric Nataf 1 and Gerd Rapin 2 1 CMAP, CNRS; UMR7641, Ecole Polytechnique, 91128 Palaiseau Cedex, France 2 Math. Dep., NAM,
More informationAdditive 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