A robust preconditioner for the conjugate gradient method

Slides:



Advertisements
Similar presentations
Steady-state heat conduction on triangulated planar domain May, 2002
Advertisements

A Discrete Adjoint-Based Approach for Optimization Problems on 3D Unstructured Meshes Dimitri J. Mavriplis Department of Mechanical Engineering University.
Basic FEA Procedures Structural Mechanics Displacement-based Formulations.
CS 240A: Solving Ax = b in parallel Dense A: Gaussian elimination with partial pivoting (LU) Same flavor as matrix * matrix, but more complicated Sparse.
1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
Applied Linear Algebra - in honor of Hans SchneiderMay 25, 2010 A Look-Back Technique of Restart for the GMRES(m) Method Akira IMAKURA † Tomohiro SOGABE.
Local scale air quality modelling based on CMAQ forecast data A. Oliver, A. Perez-Foguet, Laboratori de Càlcul Numèric (LaCàN) Departament de Matemàtica.
Solving Linear Systems (Numerical Recipes, Chap 2)
Section 4: Implementation of Finite Element Analysis – Other Elements
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Multilevel Incomplete Factorizations for Non-Linear FE problems in Geomechanics DMMMSA – University of Padova Department of Mathematical Methods and Models.
Avoiding Communication in Sparse Iterative Solvers Erin Carson Nick Knight CS294, Fall 2011.
Sparse Matrix Methods Day 1: Overview Day 2: Direct methods
The Landscape of Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage (if sparse) More Robust.
CS240A: Conjugate Gradients and the Model Problem.
Iterative Solvers for Coupled Fluid-Solid Scattering Jan Mandel Work presentation Center for Aerospace Structures University of Colorado at Boulder October.
Direct and iterative sparse linear solvers applied to groundwater flow simulations Matrix Analysis and Applications October 2007.
The Finite Element Method
Introduction to virtual engineering László Horváth Budapest Tech John von Neumann Faculty of Informatics Institute of Intelligent Engineering.
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction Ananth Grama, Purdue University Vivek Sarin, Texas A&M University Hemant.
1 A Domain Decomposition Analysis of a Nonlinear Magnetostatic Problem with 100 Million Degrees of Freedom H.KANAYAMA *, M.Ogino *, S.Sugimoto ** and J.Zhao.
Two Phase Flow using two levels of preconditioning on the GPU Prof. Kees Vuik and Rohit Gupta Delft Institute of Applied Mathematics.
Fast Low-Frequency Impedance Extraction using a Volumetric 3D Integral Formulation A.MAFFUCCI, A. TAMBURRINO, S. VENTRE, F. VILLONE EURATOM/ENEA/CREATE.
Page 1 JASS 2004 Tobias Weinzierl Sophisticated construction ideas of ansatz- spaces How to construct Ritz-Galerkin ansatz-spaces for the Navier-Stokes.
Mesh Generation 58:110 Computer-Aided Engineering Reference: Lecture Notes on Delaunay Mesh Generation, J. Shewchuk (1999)
ParCFD Parallel computation of pollutant dispersion in industrial sites Julien Montagnier Marc Buffat David Guibert.
Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.
Administrivia: May 20, 2013 Course project progress reports due Wednesday. Reading in Multigrid Tutorial: Chapters 3-4: Multigrid cycles and implementation.
1 Incorporating Iterative Refinement with Sparse Cholesky April 2007 Doron Pearl.
Computational Aspects of Multi-scale Modeling Ahmed Sameh, Ananth Grama Computing Research Institute Purdue University.
Parallel Solution of the Poisson Problem Using MPI
October 2008 Integrated Predictive Simulation System for Earthquake and Tsunami Disaster CREST/Japan Science and Technology Agency (JST)
Yuki ONISHI Tokyo Institute of Technology, Japan
CS 290H Administrivia: May 14, 2008 Course project progress reports due next Wed 21 May. Reading in Saad (second edition): Sections
Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.
Finite Element Modelling of Photonic Crystals Ben Hiett J Generowicz, M Molinari, D Beckett, KS Thomas, GJ Parker and SJ Cox High Performance Computing.
Consider Preconditioning – Basic Principles Basic Idea: is to use Krylov subspace method (CG, GMRES, MINRES …) on a modified system such as The matrix.
Programming Massively Parallel Graphics Multiprocessors using CUDA Final Project Amirhassan Asgari Kamiabad
A Parallel Hierarchical Solver for the Poisson Equation Seung Lee Deparment of Mechanical Engineering
Quality of Service for Numerical Components Lori Freitag Diachin, Paul Hovland, Kate Keahey, Lois McInnes, Boyana Norris, Padma Raghavan.
Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation.
ANSYS, Inc. Proprietary © 2004 ANSYS, Inc. Chapter 5 Distributed Memory Parallel Computing v9.0.
Conjugate gradient iteration One matrix-vector multiplication per iteration Two vector dot products per iteration Four n-vectors of working storage x 0.
Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation,
Computational Fluid Dynamics Lecture II Numerical Methods and Criteria for CFD Dr. Ugur GUVEN Professor of Aerospace Engineering.
Evolution at CERN E. Da Riva1 CFD team supports CERN development 19 May 2011.
The Landscape of Sparse Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage More Robust More.
Hui Liu University of Calgary
Xing Cai University of Oslo
Introduction to the Finite Element Method
CHAPTER 2 - EXPLICIT TRANSIENT DYNAMIC ANALYSYS
Department of Mathematics
Analysis of the Solver Performance for Stokes Flow Problems in Glass Forming Process Simulation Models Speaker: Hans Groot Supervisors: Dr. Hegen (TNO.
Introduction to Finite Elements
Gilles Bernard-Michel
Convergence in Computational Science
Meros: Software for Block Preconditioning the Navier-Stokes Equations
Deflated Conjugate Gradient Method
Deflated Conjugate Gradient Method
GPU Implementations for Finite Element Methods
Konferanse i beregningsorientert mekanikk, Trondheim, Mai, 2005
GENERAL VIEW OF KRATOS MULTIPHYSICS
Supported by the National Science Foundation.
Local scale air quality modelling based on CMAQ forecast data
Numerical Linear Algebra
Introduction to Scientific Computing II
A Software Framework for Easy Parallelization of PDE Solvers
Administrivia: November 9, 2009
Parallelizing Unstructured FEM Computation
Ph.D. Thesis Numerical Solution of PDEs and Their Object-oriented Parallel Implementations Xing Cai October 26, 1998.
Presentation transcript:

A robust preconditioner for the conjugate gradient method Pierre Verpeaux CEA DEN/DM2S/SEMT Stéphane Gounand CEA DEN/DM2S/SFME/LTMF Work context Direct solver Krylov solver New preconditionner Conclusion Further development 28/11/2018 ECCM 2010

General context General purpose Cast3m computer code developed at CEA for mechanical problem solving by FEM method. Used in Nuclear Industry and others. Toolbox for researcher Blackbox for end user Important need for qualification and validation. 28/11/2018 ECCM 2010

Quality criteria for industrial code No need for tuning Correct solution if correct problem Incorrect problem detection Predictable time No failure 28/11/2018 ECCM 2010

Context Cement paste studies – EHPOC project Heterogeneous material with inclusions High mechanical properties contrast REV analysis Need for realistic representation of inclusions including sharp edge Need for accuracy. Reference calculation CAO meshes with the Salome framework 28/11/2018 ECCM 2010

Spherical inclusions 28/11/2018 ECCM 2010

Sharp inclusions 28/11/2018 ECCM 2010

23.5 million tetrahedrons 28/11/2018 ECCM 2010

Solver challenge Large number of degrees of freedom Very bad matrix conditioning due to Properties contrast Flattened elements Various boundary condition including periodic condition of different kind. Use of cinematic constraints with Lagrange multiplier. Multiple problem solving on the same matrix. 28/11/2018 ECCM 2010

Direct solver Robust and precise Nested dissection ordering and sparse Crout solver Spatial complexity in O(n4/3) Temporal complexity in O(n5/3) for preconditioning (factorization). Parallelizable. Temporal complexity in O(n4/3) for solving. 28/11/2018 ECCM 2010

Direct solver - 2 Out of core storage Around 100Go of matrix storage for 10.000.000 dof. Practical limit on desktop PC. 1d-12 accuracy Unilateral constraints available 28/11/2018 ECCM 2010

Krylov method Constraint: maintain O(n) spatial complexity In core preconditioner storage No convergence with ILU(n) or ILUT preconditioner No convergence with domain decomposition preconditioner Some hope with algebraic multigrid preconditioner, but not yet implemented for mechanic. 28/11/2018 ECCM 2010

New preconditioner ILU(0) far better than ILU(n) for n small when it converges Non convergence of Krylov iterations is related to small diagonal terms in the preconditioner Idea: control the diagonal terms of the preconditioner by augmentation. Risk of numerical instability due to the augmentation. 28/11/2018 ECCM 2010

New preconditioner - 2 Converge in all tested cases! Most efficient with conjugate gradient method and RCM ordering 1d-15 accuracy O(n) space complexity O(n4/3) temporal complexity approx Poor parallelism 16 000 000 dof on a 16gB desktop PC 28/11/2018 ECCM 2010

Stresses in matrix 28/11/2018 ECCM 2010

Convergence comparaison 28/11/2018 ECCM 2010

CG versus BiCG 28/11/2018 ECCM 2010

Iterations versus DOF 28/11/2018 ECCM 2010

Shell mesh refinement Convergence study No refinement in the thickness of the element Degradation of the stiffness matrix conditioning No convergence of Krylov iteration at some point In our case, loss of respect of cinematic constraints (Lagrange multiplier) 28/11/2018 ECCM 2010

New preconditioner - 3 Idea: exact factorization on constraint unknowns. Incomplete factorization on others Applies well in solid mechanic since few filling due to cinematic constraints. To be tested in fluid mechanic with pressure constraint Penalization of Lagrange multiplier Convergence maintained on highly refined meshes. 28/11/2018 ECCM 2010

Conclusion New preconditioner for CG or BiCG method RCM ordering Augmentation of small diagonal terms Penalization of Lagrange multipliers Standard in Cast3M FEM code for mechanical analysis 28/11/2018 ECCM 2010

Conclusion -2 Robust – accurate Low programming complexity (one instruction development, 6 months thinking) Slower convergence than ILU(0) when ILU(0) works – factor 1.5-2 No failure (yet) 28/11/2018 ECCM 2010

Further development Parallelization by block operations Unilateral constraints on Lagrange multiplier Automatic switch between ILU(0) and ILU(0)augmented? 28/11/2018 ECCM 2010