Algebraic Multigrid as Solvers and as Preconditioner
|
|
- Pierce Pearson
- 6 years ago
- Views:
Transcription
1 Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico/ Department of Computer Science Katholieke Universiteit Leuven Celestijnenlaan 2 A B-31 Heverlee Belgium
2 Structure of the Presentation Motivation for Iterative solvers Stationary Iterative Solvers Multigrid Methods Algebraic Multigrid Methods Krylov Subspace Methods Algebraic Multigrid Methods as Preconditioner of the Presentation Domenico Lahaye Å Structure
3 Motivation for Iterative solvers 2D Eliptic partial differential equation x ( ν u x ) y ( ν u y ) = f Discretization by e.g. finite difference or finite elements Resulting system of linear equation A x = b A discrete differential operator x and b unknown function u and f in discrete points respectively dim(a) large (acurate discretizations) A x = b has to be solved repeatedly (parameter studies) Fast and memory efficient solution procedures required for Iterative solvers Domenico Lahaye Å Motivation
4 Motivation for Iterative solvers (2) Example: Numerical models for electrical motors A = (,, u) B = A H = ν B computation of forces and torques A x = b dim(a) solved in time stepping or optimization loop for Iterative solvers (2) Domenico Lahaye Å Motivation
5 Motivation for Iterative solvers (3) Iterative methods Given x, compute {x m } m 1 such that e m = x x m if m stationary methods e k = M k e multigrid methods domain decomposition methods non-stationary methods Krylov subspace methods Direct methods Rely on a factorization of A Matrix-vector multiply as computational kernel sparsity exploited A v in O(N) flops, N = dim(a) for Iterative solvers (3) Domenico Lahaye Å Motivation
6 Motivation for Iterative solvers (4) Representative sparsity structure of A for Iterative solvers (4) Domenico Lahaye Å Motivation
7 Structure of the Presentation Motivation for Iterative solvers Stationary Iterative Solvers Multigrid Methods Algebraic Multigrid Methods Krylov Subspace Methods Algebraic Multigrid Methods as Preconditioner Conclusions of the Presentation Domenico Lahaye Å Structure
8 Basic Iterative Schemes for A x = b Matrix splitting A = M N with M 1 v easy to compute Iterative scheme x m+1 = M 1 N x m + M 1 b (iterand) e m+1 = (I M 1 A) e m (error) A = D L U Jacobi method M JAC = D (diagonal) Gauss-Seidel method M GS = D L (triangular) Successive relaxation M SOR = 1 ω D L ω > Asymptotic rate of convergence given by ρ(i M 1 A) or I M 1 A Iterative Schemes for A x = b Domenico Lahaye Å Basic
9 Basic Iterative Schemes for A x = b (2) Model Problem Analysis Continuous problem: u = f on Ω = [,1] [,1] + boundary conditions Discretization on uniform mesh, mesh width h, using central finite differences Linear system A x = b with [A] = 1 h Ω h = Iterative Schemes for A x = b (2) Domenico Lahaye Å Basic
10 Basic Iterative Schemes for A x = b (3) Convergence history of lexicografic Gauss-Seidel (fixed mesh) 1 4 for a fixed mesh (fixed h ) initial stage: fast convergence later stage: stalling convergence Residual Number of iterations Iterative Schemes for A x = b (3) Domenico Lahaye Å Basic
11 Basic Iterative Schemes for A x = b (4) Convergence history of lexicografic Gauss-Seidel (varrying mesh size) for finer meshes ( h ) I M 1 A = 1 O(h 2 ) increasing number of iterations Residual h = 1/32 h = 1/ h = 1/ Number of iterations Iterative Schemes for A x = b (4) Domenico Lahaye Å Basic
12 Basic Iterative Schemes for A x = b (5) Slow convergence is caused by smooth error components Initial error After 5 iterations After 1 iterations Smooth error components can be represented on coarser grids Iterative Schemes for A x = b (5) Domenico Lahaye Å Basic
13 Structure of the Presentation Motivation for Iterative solvers Stationary Iterative Solvers Multigrid Methods Algebraic Multigrid Methods Krylov Subspace Methods Algebraic Multigrid Methods as Preconditioner Conclusions of the Presentation Domenico Lahaye Å Structure
14 Multigrid Methods exploit PDE background of the linear problem multigrid methods = smoother (basic iterative scheme) + coarse grid correction two-grid scheme apply add apply xk k+1 h pre smoothing correction post x h smoothing project on coarser grid interpolate to fine grid compute coarse grid correction multigrid scheme by recursive application to solve coarse grid problem Methods Domenico Lahaye Å Multigrid
15 Multigrid Methods (2) Geometric multigrid methods A h x h = b h on Ω h = A H x H = b H on Ω H = construct restriction I H h : Ωh Ω H interpolation I h H : ΩH Ω h coarse grid correction K h,h = I h I h H (AH ) 1 I H h Ah smoother S h = (I (Q h ) 1 A h ) Q h splitting of A h multigrid iteration matrix M h,h (ν 1, ν 2 ) = (S h 2 )ν 2 K h,h (S h 1 )ν 1 Methods (2) Domenico Lahaye Å Multigrid
16 Multigrid Methods (3) Geometric multigrid methods (2) Different orders in visiting coarser grids different cycles (V-, W-, F-cycle) M h,h multigrid iteration matrix I (M h,h ) 1 A = C C small indepent of h mesh-width independent (h-independent) convergence Methods (3) Domenico Lahaye Å Multigrid
17 Multigrid Methods (4) multigrid methods require a hierarchy of grids this hierarchy can be cumbersome to construct example left: Ω H =??? Methods (4) Domenico Lahaye Å Multigrid
18 Structure of the Presentation Motivation for Iterative solvers Stationary Iterative Solvers Multigrid Methods Algebraic Multigrid Methods Krylov Subspace Methods Algebraic Multigrid Methods as Preconditioner Conclusions of the Presentation Domenico Lahaye Å Structure
19 Algebraic Multigrid Methods Automatic construction of Ω H and A H x H = b H Using information contained in A h only and no information on differential equation geometry of Ω h notion of strength of coupling between grid points exploited Strength of coupling influences the smoother Illustration for anisotropic diffusion equation diffusion equation with discontinuous diffusion coefficient Multigrid Methods Domenico Lahaye Å Algebraic
20 Algebraic Multigrid Methods (2) Anisotropic Diffusion Equation Equation ǫ 2 u x 2 2 u = f with ǫ 1 on [,1] [,1] y2 Finite difference discretization on Ω h A h x h = b h with [A] = 1 h 2 1 ǫ 4 ǫ 1 weak coupling in x-direction, strong coupling in y-direction after point Gauss-Seidel smoothing, error is smooth in y-direction oscilatory in x-direction coarsening feasable in y-direction only! Multigrid Methods (2) Domenico Lahaye Å Algebraic
21 Algebraic Multigrid Methods (3) Initial error After 5 iterations After 1 iterations Ω h = Ω H = Multigrid Methods (3) Domenico Lahaye Å Algebraic
22 Algebraic Multigrid Methods (4) Problem with discontinuous diffusion coefficient 1. x ( ν u x ) y ( ν u y ) = f with ν = ν = 1 ν = after point Gauss-Seidel smoothing, error oscilatory accros interface of discontinuity coarsening not feasable close to the interface Multigrid Methods (4) Domenico Lahaye Å Algebraic
23 Algebraic Multigrid Methods (5) Initial error After 5 iterations After 1 iterations Ω h = Ω H = Multigrid Methods (5) Domenico Lahaye Å Algebraic
24 Algebraic Multigrid Methods (6) geometric multigrid construct hierarchy of coarser grids smoother adapted to constructed hierarchy work invested in the smoother e.g. using line smoothers algebraic multigrid simple, fixed smoother: point Gauss-Seidel coarse grid correction adapted to the local properties of the smoother work invested in the coarse grid correction Multigrid Methods (6) Domenico Lahaye Å Algebraic
25 Algebraic Multigrid Methods (7) Setup phase construction of splitting Ω h = C h F h and set Ω H = C h construction of interpolation I h H strength of coupling between nodes coded in A h exploited matrix dependent interpolation: (I H h ) ij A h ij /Ah ii Galerkin coarsening: A H = I H h Ah I h H apply recursively using A H as input Solve phase multigrid cycling Multigrid Methods (7) Domenico Lahaye Å Algebraic
26
27 Algebraic Multigrid Methods (8) Permanent Magnet Machine Test Case Multigrid Methods (8) Domenico Lahaye Å Algebraic
28 Algebraic Multigrid Methods (9) Adaptive construction of triangulation in 13 refinement steps Nodes in triangulation Adaptive refinement step Multigrid Methods (9) Domenico Lahaye Å Algebraic
29 Algebraic Multigrid Methods (1) Initial and intermediate triangulation Multigrid Methods (1) Domenico Lahaye Å Algebraic
30 Algebraic Multigrid Methods (11) Number of iterations for AMG Number of iterations V(1,1) V(2,2) W(1,1) multigrid behavior Adaptive refinement step Multigrid Methods (11) Domenico Lahaye Å Algebraic
31 Algebraic Multigrid Methods (12) CPU-time measurements for AMG 72 6 One level solver AMG CPU time (in secs.) RAMG speedup by factor Number of grid points Multigrid Methods (12) Domenico Lahaye Å Algebraic
32 Structure of the Presentation Motivation for Iterative solvers Stationary Iterative Solvers Multigrid Methods Algebraic Multigrid Methods Krylov Subspace Methods Algebraic Multigrid Methods as Preconditioner Conclusions of the Presentation Domenico Lahaye Å Structure
33 Krylov Subspace Methods Non-stationary iterative methods for solving A x = b Given x and r = b A x find x m x + K m (A, r ) = span { r, A r,..., A m 1 r } Given V m = [v 1,..., v m ] a basis for K m (A, r ) y m a vector of m coefficients x m = x + V m y m basis V m Arnoldi method bi-lanczos method Lanczos method vector y m residual projection methods residual norm minimization No Krylov method optimal for large class of problems Subspace Methods Domenico Lahaye Å Krylov
34 Krylov Subspace Methods (2) The Arnoldi Method for constructing V m Initial vector v 1 = r / r Given V m = [v 1,..., v m ] a basis for K m (A, r ) compute A v m and orthogonalize with respect to V m normalize and set resulting vector equal to new basis vector v m+1 recurrence relation A V m = V m+1 H m+1,m H m+1,m = long term recurrences: expensive in memory and CPU-time ( H m,m...h m+1,m H m,m upper Hessenberg ) Subspace Methods (2) Domenico Lahaye Å Krylov
35 Krylov Subspace Methods (3) The Bi-Orthogonal Lanczos Method for constructing V m Avoid long term recurrences using bi-orthogonality V T m W m = D m = diag[d 1,..., d m ] W m basis for K m (A T, r ) recurrence relation A V m = V m+1 T m+1 T m+1 tridiagonal short term recurrences (near) breakdown if v T i w i = ( v T i w i ) Subspace Methods (3) Domenico Lahaye Å Krylov
36 Krylov Subspace Methods (4) Determing the vector y m x m x + K m (A, r ) r m = b A x m = r A V m y m residual projection methods V T m r m = H m,m y m = β 1 e 1 m m linear system: solve by LU-factorization residual minimization methods minimize r m H m+1,m y m = β 1 e 1 (m + 1) m linear system: solve in least-squares sense Subspace Methods (4) Domenico Lahaye Å Krylov
37 Krylov Subspace Methods (5) A x = b with A symmetric, positive definite A = A T H m,m = (H m,m ) T H m,m tridiagonal A pos. def. H m,m = V T m A V m pos. def. LU-fact. without pivoting update LU-fact. from step m to m + 1 coupled 2-term recurrences {r m 1, p m 1, r m, p m } { r m+1, p m+1 } p T i A p j = for i j conjugate gradient method (CG) Subspace Methods (5) Domenico Lahaye Å Krylov
38 Krylov Subspace Methods (6) Convergence of Krylov Subspace Methods Krylov subspace methods converge superlinearly Bound for CG x x m A 2 [ cond2 (A) 1 cond2 (A)+1] m x x A Preconditioning: A x = b M 1 A x = M 1 b M 1 A I M z = r easy to solve Preconditioned CG: m replace r m by z m = M 1 r m Possible preconditioners for CG: M JAC, M SSOR,... Subspace Methods (6) Domenico Lahaye Å Krylov
39 Krylov Subspace Methods (7) The Convergence of CG: A closer look CG: m T m y m = β 1 e 1 T m = V T m A V m eigenvalues of T m are called Ritz-values Ritz-values converge to spec(a m ) for increasing m fast converges towards outliers in spec(a m ), if any cfr. Krylov subspace methods for eigenvalue computations convergence of Ritz values governs convergence of CG Subspace Methods (7) Domenico Lahaye Å Krylov
40 Structure of the Presentation Motivation for Iterative solvers Stationary Iterative Solvers Multigrid Methods Algebraic Multigrid Methods Krylov Subspace Methods Algebraic Multigrid Methods as Preconditioner Conclusions of the Presentation Domenico Lahaye Å Structure
41 AMG as Preconditioner Problem with anti-periodic boundary conditions A z Γ1 = A z Γ2 Number of iterations Adaptive classical classical refinement step AMG AMG/CG div 16 2 div 17 3 div 17 4 div 18 5 div 17 6 div 17 as Preconditioner Domenico Lahaye Å AMG
42 AMG as Preconditioner (2) convergence of the Ritz values towards spec(i M 1 A ) during CG-iteration Ritz values of (I inv(m)*a) AMG/CG Iteration step spec(i M 1 A ) has a few outliers outliers are captured fast by CG-iteration as Preconditioner (2) Domenico Lahaye Å AMG
43 AMG as Preconditioner (3) Permanent Magnet Machine Test Case as Preconditioner (3) Domenico Lahaye Å AMG
44 AMG as Preconditioner (4) Number of iterations for AMG Number of iterations V(1,1) V(2,2) W(1,1) V(1,1)/CG CG accelerates and stabilizes convergence Adaptive refinement step as Preconditioner (4) Domenico Lahaye Å AMG
45 AMG as Preconditioner (5) CPU-time measurements for AMG 72 6 SSOR/CG RAMG RAMG/CG CPU time (in secs.) AMG speedup by factor 7.5 AMG/CG speedup by factor Number of grid points as Preconditioner (5) Domenico Lahaye Å AMG
46 Conclusions We presented multigrid and algebraic multigrid for two-dimensional diffusion problems. Algebraic multigrid methods allow to solve problems on complicated geometries. Algebraic multigrid methods are more efficient than single-level iterative solvers. Using algebraic multigrid as a precondioner improves its stability and speed. Domenico Lahaye Å Conclusions
1. Fast Iterative Solvers of SLE
1. Fast Iterative Solvers of crucial drawback of solvers discussed so far: they become slower if we discretize more accurate! now: look for possible remedies relaxation: explicit application of the multigrid
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationSolving PDEs with Multigrid Methods p.1
Solving PDEs with Multigrid Methods Scott MacLachlan maclachl@colorado.edu Department of Applied Mathematics, University of Colorado at Boulder Solving PDEs with Multigrid Methods p.1 Support and Collaboration
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 informationContents. Preface... xi. Introduction...
Contents Preface... xi Introduction... xv Chapter 1. Computer Architectures... 1 1.1. Different types of parallelism... 1 1.1.1. Overlap, concurrency and parallelism... 1 1.1.2. Temporal and spatial parallelism
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More 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 informationAlgebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes
Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes Elena Virnik, TU BERLIN Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov
More information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
More informationIterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009)
Iterative methods for Linear System of Equations Joint Advanced Student School (JASS-2009) Course #2: Numerical Simulation - from Models to Software Introduction In numerical simulation, Partial Differential
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 informationThe Conjugate Gradient Method
The Conjugate Gradient Method Classical Iterations We have a problem, We assume that the matrix comes from a discretization of a PDE. The best and most popular model problem is, The matrix will be as large
More informationNumerical Methods in Matrix Computations
Ake Bjorck Numerical Methods in Matrix Computations Springer Contents 1 Direct Methods for Linear Systems 1 1.1 Elements of Matrix Theory 1 1.1.1 Matrix Algebra 2 1.1.2 Vector Spaces 6 1.1.3 Submatrices
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 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 informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationLab 1: Iterative Methods for Solving Linear Systems
Lab 1: Iterative Methods for Solving Linear Systems January 22, 2017 Introduction Many real world applications require the solution to very large and sparse linear systems where direct methods such as
More informationAdaptive algebraic multigrid methods in lattice computations
Adaptive algebraic multigrid methods in lattice computations Karsten Kahl Bergische Universität Wuppertal January 8, 2009 Acknowledgements Matthias Bolten, University of Wuppertal Achi Brandt, Weizmann
More informationMultigrid Methods and their application in CFD
Multigrid Methods and their application in CFD Michael Wurst TU München 16.06.2009 1 Multigrid Methods Definition Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential
More informationIterative methods for Linear System
Iterative methods for Linear System JASS 2009 Student: Rishi Patil Advisor: Prof. Thomas Huckle Outline Basics: Matrices and their properties Eigenvalues, Condition Number Iterative Methods Direct and
More informationNumerical Methods I Non-Square and Sparse Linear Systems
Numerical Methods I Non-Square and Sparse Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 25th, 2014 A. Donev (Courant
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2018/19 Part 4: Iterative Methods PD
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationBootstrap AMG. Kailai Xu. July 12, Stanford University
Bootstrap AMG Kailai Xu Stanford University July 12, 2017 AMG Components A general AMG algorithm consists of the following components. A hierarchy of levels. A smoother. A prolongation. A restriction.
More informationAPPLIED NUMERICAL LINEAR ALGEBRA
APPLIED NUMERICAL LINEAR ALGEBRA James W. Demmel University of California Berkeley, California Society for Industrial and Applied Mathematics Philadelphia Contents Preface 1 Introduction 1 1.1 Basic Notation
More informationM.A. Botchev. September 5, 2014
Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev
More information6.4 Krylov Subspaces and Conjugate Gradients
6.4 Krylov Subspaces and Conjugate Gradients Our original equation is Ax = b. The preconditioned equation is P Ax = P b. When we write P, we never intend that an inverse will be explicitly computed. P
More informationCourse Notes: Week 1
Course Notes: Week 1 Math 270C: Applied Numerical Linear Algebra 1 Lecture 1: Introduction (3/28/11) We will focus on iterative methods for solving linear systems of equations (and some discussion of eigenvalues
More informationNew Multigrid Solver Advances in TOPS
New Multigrid Solver Advances in TOPS R D Falgout 1, J Brannick 2, M Brezina 2, T Manteuffel 2 and S McCormick 2 1 Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, P.O.
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 information7.3 The Jacobi and Gauss-Siedel Iterative Techniques. Problem: To solve Ax = b for A R n n. Methodology: Iteratively approximate solution x. No GEPP.
7.3 The Jacobi and Gauss-Siedel Iterative Techniques Problem: To solve Ax = b for A R n n. Methodology: Iteratively approximate solution x. No GEPP. 7.3 The Jacobi and Gauss-Siedel Iterative Techniques
More informationIterative Methods and Multigrid
Iterative Methods and Multigrid Part 3: Preconditioning 2 Eric de Sturler Preconditioning The general idea behind preconditioning is that convergence of some method for the linear system Ax = b can be
More informationNumerical Programming I (for CSE)
Technische Universität München WT 1/13 Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer January 1, 13 Numerical Programming I (for CSE) Tutorial 1: Iterative Methods 1) Relaxation Methods a) Let
More informationAspects of Multigrid
Aspects of Multigrid Kees Oosterlee 1,2 1 Delft University of Technology, Delft. 2 CWI, Center for Mathematics and Computer Science, Amsterdam, SIAM Chapter Workshop Day, May 30th 2018 C.W.Oosterlee (CWI)
More informationThe amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.
AMSC/CMSC 661 Scientific Computing II Spring 2005 Solution of Sparse Linear Systems Part 2: Iterative methods Dianne P. O Leary c 2005 Solving Sparse Linear Systems: Iterative methods The plan: Iterative
More information6. Iterative Methods for Linear Systems. The stepwise approach to the solution...
6 Iterative Methods for Linear Systems The stepwise approach to the solution Miriam Mehl: 6 Iterative Methods for Linear Systems The stepwise approach to the solution, January 18, 2013 1 61 Large Sparse
More informationIntroduction to Scientific Computing
(Lecture 5: Linear system of equations / Matrix Splitting) Bojana Rosić, Thilo Moshagen Institute of Scientific Computing Motivation Let us resolve the problem scheme by using Kirchhoff s laws: the algebraic
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 informationSolving Ax = b, an overview. Program
Numerical Linear Algebra Improving iterative solvers: preconditioning, deflation, numerical software and parallelisation Gerard Sleijpen and Martin van Gijzen November 29, 27 Solving Ax = b, an overview
More informationKasetsart University Workshop. Multigrid methods: An introduction
Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available
More informationScientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 1: Direct Methods Dianne P. O Leary c 2008
More informationMonte Carlo simulation inspired by computational optimization. Colin Fox Al Parker, John Bardsley MCQMC Feb 2012, Sydney
Monte Carlo simulation inspired by computational optimization Colin Fox fox@physics.otago.ac.nz Al Parker, John Bardsley MCQMC Feb 2012, Sydney Sampling from π(x) Consider : x is high-dimensional (10 4
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 11 Partial Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002.
More informationarxiv: v4 [math.na] 1 Sep 2018
A Comparison of Preconditioned Krylov Subspace Methods for Large-Scale Nonsymmetric Linear Systems Aditi Ghai, Cao Lu and Xiangmin Jiao arxiv:1607.00351v4 [math.na] 1 Sep 2018 September 5, 2018 Department
More informationConjugate Gradients: Idea
Overview Steepest Descent often takes steps in the same direction as earlier steps Wouldn t it be better every time we take a step to get it exactly right the first time? Again, in general we choose a
More informationITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS
ITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS YOUSEF SAAD University of Minnesota PWS PUBLISHING COMPANY I(T)P An International Thomson Publishing Company BOSTON ALBANY BONN CINCINNATI DETROIT LONDON MADRID
More informationAdaptive Multigrid for QCD. Lattice University of Regensburg
Lattice 2007 University of Regensburg Michael Clark Boston University with J. Brannick, R. Brower, J. Osborn and C. Rebbi -1- Lattice 2007, University of Regensburg Talk Outline Introduction to Multigrid
More informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
More informationBindel, Fall 2016 Matrix Computations (CS 6210) Notes for
1 Iteration basics Notes for 2016-11-07 An iterative solver for Ax = b is produces a sequence of approximations x (k) x. We always stop after finitely many steps, based on some convergence criterion, e.g.
More informationIMPLEMENTATION OF A PARALLEL AMG SOLVER
IMPLEMENTATION OF A PARALLEL AMG SOLVER Tony Saad May 2005 http://tsaad.utsi.edu - tsaad@utsi.edu PLAN INTRODUCTION 2 min. MULTIGRID METHODS.. 3 min. PARALLEL IMPLEMENTATION PARTITIONING. 1 min. RENUMBERING...
More informationA greedy strategy for coarse-grid selection
A greedy strategy for coarse-grid selection S. MacLachlan Yousef Saad August 3, 2006 Abstract Efficient solution of the very large linear systems that arise in numerical modelling of real-world applications
More informationIntroduction to Multigrid Method
Introduction to Multigrid Metod Presented by: Bogojeska Jasmina /08/005 JASS, 005, St. Petersburg 1 Te ultimate upsot of MLAT Te amount of computational work sould be proportional to te amount of real
More informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccs Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary c 2008,2010
More informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary
More informationINTRODUCTION TO MULTIGRID METHODS
INTRODUCTION TO MULTIGRID METHODS LONG CHEN 1. ALGEBRAIC EQUATION OF TWO POINT BOUNDARY VALUE PROBLEM We consider the discretization of Poisson equation in one dimension: (1) u = f, x (0, 1) u(0) = u(1)
More informationUniversity of Illinois at Urbana-Champaign. Multigrid (MG) methods are used to approximate solutions to elliptic partial differential
Title: Multigrid Methods Name: Luke Olson 1 Affil./Addr.: Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 email: lukeo@illinois.edu url: http://www.cs.uiuc.edu/homes/lukeo/
More informationLecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.
Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference
More informationIterative Methods and Multigrid
Iterative Methods and Multigrid Part 1: Introduction to Multigrid 2000 Eric de Sturler 1 12/02/09 MG01.prz Basic Iterative Methods (1) Nonlinear equation: f(x) = 0 Rewrite as x = F(x), and iterate x i+1
More informationarxiv: 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 informationConstrained Minimization and Multigrid
Constrained Minimization and Multigrid C. Gräser (FU Berlin), R. Kornhuber (FU Berlin), and O. Sander (FU Berlin) Workshop on PDE Constrained Optimization Hamburg, March 27-29, 2008 Matheon Outline Successive
More informationFEM and sparse linear system solving
FEM & sparse linear system solving, Lecture 9, Nov 19, 2017 1/36 Lecture 9, Nov 17, 2017: Krylov space methods http://people.inf.ethz.ch/arbenz/fem17 Peter Arbenz Computer Science Department, ETH Zürich
More informationThe Removal of Critical Slowing Down. Lattice College of William and Mary
The Removal of Critical Slowing Down Lattice 2008 College of William and Mary Michael Clark Boston University James Brannick, Rich Brower, Tom Manteuffel, Steve McCormick, James Osborn, Claudio Rebbi 1
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.4: Krylov Subspace Methods 2 / 51 Krylov Subspace Methods In this chapter we give
More informationMultilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, 751 05 Uppsala,
More informationBackground. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58
Background C. T. Kelley NC State University tim kelley@ncsu.edu C. T. Kelley Background NCSU, Spring 2012 1 / 58 Notation vectors, matrices, norms l 1 : max col sum... spectral radius scaled integral norms
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 informationChapter 7. Iterative methods for large sparse linear systems. 7.1 Sparse matrix algebra. Large sparse matrices
Chapter 7 Iterative methods for large sparse linear systems In this chapter we revisit the problem of solving linear systems of equations, but now in the context of large sparse systems. The price to pay
More information1 Conjugate gradients
Notes for 2016-11-18 1 Conjugate gradients We now turn to the method of conjugate gradients (CG), perhaps the best known of the Krylov subspace solvers. The CG iteration can be characterized as the iteration
More informationComputers and Mathematics with Applications
Computers and Mathematics with Applications 68 (2014) 1151 1160 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa A GPU
More informationIterative methods for positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationComparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes
Comparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes Do Y. Kwak, 1 JunS.Lee 1 Department of Mathematics, KAIST, Taejon 305-701, Korea Department of Mathematics,
More informationIterative Methods for Linear Systems of Equations
Iterative Methods for Linear Systems of Equations Projection methods (3) ITMAN PhD-course DTU 20-10-08 till 24-10-08 Martin van Gijzen 1 Delft University of Technology Overview day 4 Bi-Lanczos method
More informationAMG for a Peta-scale Navier Stokes Code
AMG for a Peta-scale Navier Stokes Code James Lottes Argonne National Laboratory October 18, 2007 The Challenge Develop an AMG iterative method to solve Poisson 2 u = f discretized on highly irregular
More informationAn efficient multigrid solver based on aggregation
An efficient multigrid solver based on aggregation Yvan Notay Université Libre de Bruxelles Service de Métrologie Nucléaire Graz, July 4, 2012 Co-worker: Artem Napov Supported by the Belgian FNRS http://homepages.ulb.ac.be/
More informationAN AGGREGATION MULTILEVEL METHOD USING SMOOTH ERROR VECTORS
AN AGGREGATION MULTILEVEL METHOD USING SMOOTH ERROR VECTORS EDMOND CHOW Abstract. Many algebraic multilevel methods for solving linear systems assume that the slowto-converge, or algebraically smooth error
More informationA MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY
A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,
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 informationSimple iteration procedure
Simple iteration procedure Solve Known approximate solution Preconditionning: Jacobi Gauss-Seidel Lower triangle residue use of pre-conditionner correction residue use of pre-conditionner Convergence Spectral
More informationCME342 Parallel Methods in Numerical Analysis. Matrix Computation: Iterative Methods II. Sparse Matrix-vector Multiplication.
CME342 Parallel Methods in Numerical Analysis Matrix Computation: Iterative Methods II Outline: CG & its parallelization. Sparse Matrix-vector Multiplication. 1 Basic iterative methods: Ax = b r = b Ax
More informationPolynomial accelerated MCMC... and other sampling algorithms inspired by computational optimization
Polynomial accelerated MCMC... and other sampling algorithms inspired by computational optimization Colin Fox fox@physics.otago.ac.nz Al Parker, John Bardsley Fore-words Motivation: an inverse oceanography
More informationParallel Numerics, WT 2016/ Iterative Methods for Sparse Linear Systems of Equations. page 1 of 1
Parallel Numerics, WT 2016/2017 5 Iterative Methods for Sparse Linear Systems of Equations page 1 of 1 Contents 1 Introduction 1.1 Computer Science Aspects 1.2 Numerical Problems 1.3 Graphs 1.4 Loop Manipulations
More informationIterative Methods. Splitting Methods
Iterative Methods Splitting Methods 1 Direct Methods Solving Ax = b using direct methods. Gaussian elimination (using LU decomposition) Variants of LU, including Crout and Doolittle Other decomposition
More informationElliptic Problems / Multigrid. PHY 604: Computational Methods for Physics and Astrophysics II
Elliptic Problems / Multigrid Summary of Hyperbolic PDEs We looked at a simple linear and a nonlinear scalar hyperbolic PDE There is a speed associated with the change of the solution Explicit methods
More informationAggregation-based algebraic multigrid
Aggregation-based algebraic multigrid from theory to fast solvers Yvan Notay Université Libre de Bruxelles Service de Métrologie Nucléaire CEMRACS, Marseille, July 18, 2012 Supported by the Belgian FNRS
More informationA Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear Systems
A Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear Systems Pasqua D Ambra, Alfredo Buttari, Daniela Di Serafino, Salvatore Filippone, Simone Gentile,
More information2.29 Numerical Fluid Mechanics Spring 2015 Lecture 9
Spring 2015 Lecture 9 REVIEW Lecture 8: Direct Methods for solving (linear) algebraic equations Gauss Elimination LU decomposition/factorization Error Analysis for Linear Systems and Condition Numbers
More informationNumerical Methods - Numerical Linear Algebra
Numerical Methods - Numerical Linear Algebra Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Numerical Linear Algebra I 2013 1 / 62 Outline 1 Motivation 2 Solving Linear
More information4.8 Arnoldi Iteration, Krylov Subspaces and GMRES
48 Arnoldi Iteration, Krylov Subspaces and GMRES We start with the problem of using a similarity transformation to convert an n n matrix A to upper Hessenberg form H, ie, A = QHQ, (30) with an appropriate
More informationGeometric Multigrid Methods
Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010 Ideas
More informationSpectral element agglomerate AMGe
Spectral element agglomerate AMGe T. Chartier 1, R. Falgout 2, V. E. Henson 2, J. E. Jones 4, T. A. Manteuffel 3, S. F. McCormick 3, J. W. Ruge 3, and P. S. Vassilevski 2 1 Department of Mathematics, Davidson
More informationFEM and Sparse Linear System Solving
FEM & sparse system solving, Lecture 7, Nov 3, 2017 1/46 Lecture 7, Nov 3, 2015: Introduction to Iterative Solvers: Stationary Methods http://people.inf.ethz.ch/arbenz/fem16 Peter Arbenz Computer Science
More informationNotes for CS542G (Iterative Solvers for Linear Systems)
Notes for CS542G (Iterative Solvers for Linear Systems) Robert Bridson November 20, 2007 1 The Basics We re now looking at efficient ways to solve the linear system of equations Ax = b where in this course,
More informationA SHORT NOTE COMPARING MULTIGRID AND DOMAIN DECOMPOSITION FOR PROTEIN MODELING EQUATIONS
A SHORT NOTE COMPARING MULTIGRID AND DOMAIN DECOMPOSITION FOR PROTEIN MODELING EQUATIONS MICHAEL HOLST AND FAISAL SAIED Abstract. We consider multigrid and domain decomposition methods for the numerical
More informationSolving Large Nonlinear Sparse Systems
Solving Large Nonlinear Sparse Systems Fred W. Wubs and Jonas Thies Computational Mechanics & Numerical Mathematics University of Groningen, the Netherlands f.w.wubs@rug.nl Centre for Interdisciplinary
More informationNumerical Solution I
Numerical Solution I Stationary Flow R. Kornhuber (FU Berlin) Summerschool Modelling of mass and energy transport in porous media with practical applications October 8-12, 2018 Schedule Classical Solutions
More information9. Iterative Methods for Large Linear Systems
EE507 - Computational Techniques for EE Jitkomut Songsiri 9. Iterative Methods for Large Linear Systems introduction splitting method Jacobi method Gauss-Seidel method successive overrelaxation (SOR) 9-1
More informationA parameter tuning technique of a weighted Jacobi-type preconditioner and its application to supernova simulations
A parameter tuning technique of a weighted Jacobi-type preconditioner and its application to supernova simulations Akira IMAKURA Center for Computational Sciences, University of Tsukuba Joint work with
More informationFast solvers for steady incompressible flow
ICFD 25 p.1/21 Fast solvers for steady incompressible flow Andy Wathen Oxford University wathen@comlab.ox.ac.uk http://web.comlab.ox.ac.uk/~wathen/ Joint work with: Howard Elman (University of Maryland,
More informationAn Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems
An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems P.-O. Persson and J. Peraire Massachusetts Institute of Technology 2006 AIAA Aerospace Sciences Meeting, Reno, Nevada January 9,
More information