Adaptive Multigrid for Lattice QCD James Brannick October 22, 2007 Penn State

Slides:



Advertisements
Similar presentations
05/11/2005 Carnegie Mellon School of Computer Science Aladdin Lamps 05 Combinatorial and algebraic tools for multigrid Yiannis Koutis Computer Science.
Advertisements

CSE 245: Computer Aided Circuit Simulation and Verification Matrix Computations: Iterative Methods (II) Chung-Kuan Cheng.
SciDAC Software Infrastructure for Lattice Gauge Theory
Lecture 1: basics of lattice QCD Peter Petreczky Lattice regularization and gauge symmetry : Wilson gauge action, fermion doubling Different fermion formulations.
Nuclear Physics in the SciDAC Era Robert Edwards Jefferson Lab SciDAC 2009 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this.
Lattice Quantum Chromodynamic for Mathematicians Richard C. Brower Yale University May Day 2007 Tutorial in “ Derivatives, Finite Differences and.
What is QCD? Quantum ChromoDynamics is the theory of the strong force –the strong force describes the binding of quarks by gluons to make particles such.
Non-perturbative improvement of nHYP smeared fermions R. Hoffmann In collaboration with A. Hasenfratz and S. Schaefer University of Colorado Peak Peak.
Lattice QCD (INTRODUCTION) DUBNA WINTER SCHOOL 1-2 FEBRUARY 2005.
1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
CS 290H 7 November Introduction to multigrid methods
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
Geometric (Classical) MultiGrid. Hierarchy of graphs Apply grids in all scales: 2x2, 4x4, …, n 1/2 xn 1/2 Coarsening Interpolate and relax Solve the large.
MATH 685/ CSI 700/ OR 682 Lecture Notes
Test of the Stefan-Boltzmann behavior for T>0 at tree-level of perturbation theory on the lattice DESY Summer Student 2010 Carmen Ka Ki Li Imperial College.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
Image Reconstruction Group 6 Zoran Golic. Overview Problem Multigrid-Algorithm Results Aspects worth mentioning.
Mech300 Numerical Methods, Hong Kong University of Science and Technology. 1 Part Three Linear Algebraic Equations.
Graph problems Partition: min cut Clustering bioinformatics Image segmentation VLSI placement Routing Linear arrangement: bandwidth, cutwidth Graph drawing.
Algebraic MultiGrid. Algebraic MultiGrid – AMG (Brandt 1982)  General structure  Choose a subset of variables: the C-points such that every variable.
Algorithms for Lattice Field Theory at Extreme Scales Rich Brower 1*, Ron Babich 1, James Brannick 2, Mike Clark 3, Saul Cohen 1, Balint Joo 4, Tony Kennedy.
Peyman Mostaghimi, Martin Blunt, Branko Bijeljic 11 th January 2010, Pore-scale project meeting Direct Numerical Simulation of Transport Phenomena on Pore-space.
Fast, Multiscale Image Segmentation: From Pixels to Semantics Ronen Basri The Weizmann Institute of Science Joint work with Achi Brandt, Meirav Galun,
An Algebraic Multigrid Solver for Analytical Placement With Layout Based Clustering Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Bo Yao, Zhengyong Zhu.
Geometric (Classical) MultiGrid. Linear scalar elliptic PDE (Brandt ~1971)  1 dimension Poisson equation  Discretize the continuum x0x0 x1x1 x2x2 xixi.
8. Forces, Connections and Gauge Fields 8.0. Preliminary 8.1. Electromagnetism 8.2. Non-Abelian Gauge Theories 8.3. Non-Abelian Theories and Electromagnetism.
Multiscale Methods of Data Assimilation Achi Brandt The Weizmann Institute of Science UCLA INRODUCTION EXAMPLE FOR INVERSE PROBLEMS.
Exercise where Discretize the problem as usual on square grid of points (including boundaries). Define g and f such that the solution to the differential.
1 Numerical Integration of Partial Differential Equations (PDEs)
Mass of the Vector Meson in Quantum Chromodynamics in the limit of large number of colors Rahul Patel With Carlos Prays and Ari Hietanen Mentor: Dr. Rajamani.
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
Multigrid for Nonlinear Problems Ferien-Akademie 2005, Sarntal, Christoph Scheit FAS, Newton-MG, Multilevel Nonlinear Method.
Improving Coarsening and Interpolation for Algebraic Multigrid Jeff Butler Hans De Sterck Department of Applied Mathematics (In Collaboration with Ulrike.
Simulating Quarks and Gluons with Quantum Chromodynamics February 10, CS635 Parallel Computer Architecture. Mahantesh Halappanavar.
Hans De Sterck Department of Applied Mathematics University of Colorado at Boulder Ulrike Meier Yang Center for Applied Scientific Computing Lawrence Livermore.
Van Emden Henson Panayot Vassilevski Center for Applied Scientific Computing Lawrence Livermore National Laboratory Element-Free AMGe: General algorithms.
Linear Systems Iterative Solutions CSE 541 Roger Crawfis.
Lecture Dirac 1927: search for a wave equation, in which the time derivative appears only in the first order ( Klein- Gordon equation:
Lanczos approach using out-of-core memory for eigenvalues and diagonal of inverse problems Pierre Carrier, Yousef Saad, James Freericks, Ehsan Khatami,
Elliptic PDEs and the Finite Difference Method
CS240A: Conjugate Gradients and the Model Problem.
Implementing Hypre- AMG in NIMROD via PETSc S. Vadlamani- Tech X S. Kruger- Tech X T. Manteuffel- CU APPM S. McCormick- CU APPM Funding: DE-FG02-07ER84730.
1 Lattice Quantum Chromodynamics 1- Literature : Lattice QCD, C. Davis Hep-ph/ Burcham and Jobes By Leila Joulaeizadeh 19 Oct
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl Institut für Informatik Scientific Computing In Computer Science.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl.
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
What is QCD? Quantum ChromoDynamics is the theory of the strong force
Introduction to Scientific Computing II
Discretization for PDEs Chunfang Chen,Danny Thorne Adam Zornes, Deng Li CS 521 Feb., 9,2006.
1 Mark F. Adams SciDAC - 27 June 2005 Ax=b: The Link between Gyrokinetic Particle Simulations of Turbulent Transport in Burning Plasmas and Micro-FE Analysis.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
Shameless Baylor Advertisement Baylor’s Physics Department – 15 research- active faculty. Rank #18 in the percentage of faculty whose works are cited and.
WORKSHOP ERCIM Global convergence for iterative aggregation – disaggregation method Ivana Pultarova Czech Technical University in Prague, Czech Republic.
Regularization of energy-based representations Minimize total energy E p (u) + (1- )E d (u,d) E p (u) : Stabilizing function - a smoothness constraint.
ILAS Threshold partitioning for iterative aggregation – disaggregation method Ivana Pultarova Czech Technical University in Prague, Czech Republic.
Brain (Tech) NCRR Overview Magnetic Leadfields and Superquadric Glyphs.
University of Colorado
Fermi National Accelerator Laboratory & Thomas Jefferson National Accelerator Facility SciDAC LQCD Software The Department of Energy (DOE) Office of Science.
Syo Kamata Rikkyo University In collaboration with Hidekazu Tanaka.
Fundamental Forces of Nature
Introduction to the Finite Element Method
ab initio Chemistry ab initio QCD = flops  10 Mflops
CSE 245: Computer Aided Circuit Simulation and Verification
Introduction to Multigrid Method
Matrix Methods Summary
Pavel Buividovich (Regensburg University)
Jun Nishimura (KEK, SOKENDAI) JLQCD Collaboration:
Fundamental Forces of Nature
Linear Algebra Lecture 16.
Presentation transcript:

Adaptive Multigrid for Lattice QCD James Brannick October 22, 2007 Penn State

Presentation plan Intro to Lattice Quantum Chromodynamics Review of Multigrid Basics (Adaptive) MG for QCD Numerical Experiments

Participants in the MG-QCD project A. Bessen (Columbia University) A. Brandt (UCLA, WIS) J. Brannick (PSU) M. Brezina (CU Boulder) R. Brower (BU) M. Clark (BU) R. Falgout (CASC-LLNL) A. Frommer (Wuppertal) K. Kahl (Wuppertal) C. Ketelson (CU Boulder) D. Keyes (Columbia University) O. Livne (Univ. of Utah) I. Livshits (Ball State) S. MacLachlan (TU Delft) T. Manteuffel (CU Boulder) S. McCormick (CU Boulder) V. Nistor (PSU) K. Osterlee (TU Delft) J. Osborne (ANL) C. Rebbi (BU) J. Ruge (CU Boulder) P. Varanas (LLNL)

Forces in Standard Model: SU(N) Atoms: Maxwell N=1(charge) Nuclei: Weak N=2 (isospin) Sub nuclear: Strong N=3 (color) Standard Model: U(1) £ SU(2) £ SU(3)

QCD path integral Anti-quark quark Gauge Dirac Operator Generalized Curl (Maxwell)

The Dirac PDE (for Quarks) x = (x 1,x 2,x 3,x 4 ) (space,time) 4 x 4 sparse spin matrices: 4 non-zero entries 1,-1, i, -i 3x3 color gauge matrices Wilson (1974): discretization on a hypercubic lattice U(x,x+  ) = exp[i hg A  (x)]

Discrete Dirac operator on hypercubic lattice x x+  Dimension:  1,2,…,d Color a,b = 1,2,3 Spin i,j = 1,2,3,4 x 1 axis  x 2 axis  Spin projection Operator

Wilson fermion matrix: M Typical lattice size : 32 3 х 24 Typical lattice size : 32 3 х 24 Dimension of then Dimension of M then 16 3 х 24 х 2 х 3 х 4 ≈ 10 6 х 10 6 !! 16 3 х 24 х 2 х 3 х 4 ≈ 10 6 х 10 6 !! Need Need M -1 (U), Tr[ M -1 (U) ], Det[ M(U) ] Together account for dominant cost more than 80% of the overall flops! Different types of algorithms used for different fermionic actions: Krylov methods typical, as M* = M M(U) Goal of our NSF PetaApps project is inversion on lattice - overall Goal of our NSF PetaApps project is inversion on lattice - overall simulation at this resolution requires sustained Petaflop years! simulation at this resolution requires sustained Petaflop years! /

2-d “toy” problem: Schwinger Model Space time is 2-d Gauge links: U(x,x+  ) = exp[i e A  (x)], U(1) theory Dirac fields have 2 spins (not 4) Operator is quaternionic (Pauli) matrix involving  1,  2

Spectrum of Schwinger matrix & “critical slowing down’’ mass gap =.1 mass gap =.01 mass gap =.001

Stationary Linear Iterations Consider solving the linear system using a SLI: Let e k =u - u k be the error, and note that r k =Ae k. The error propagation operator is then, with r k =f - Au k

Multigrid V-cycle Multigrid solvers are optimal ( O(N) operations), and hence have good scaling potential MG uses a sequence of coarse-grid problems to accelerate the solution of the original problem smoothing Fine Grid Smaller Coarse Grid restriction prolongation (interpolation)

Why does standard MG work? Low mode is constant -- key to MG success is smooth error, e.g., Laplacian Constant exactly preserved on coarse level All near zero modes also preserved!

Lattice QCD MG Gauge field and hence low modes not geometrically smooth (locally oscillatory) Geometric MG completely fails, preserving low modes for gauge fields requires adaptivity Real Part Imaginary Part Lowest mode of M, ¯ = 6

Lattice QCD & (A)MG Lattice QCD and MG have a long and painful history (15+ yrs.) * PTMG (Lauwers et al, 93) * Renormilazation MG (de Forcrand et al, 91) * Projective MG (Brower et al, 91) * Many others.. All failed for non-smooth fields in the m ! m cr limit, failed because did not consider why MG works in first place! Diamond: Jacobi Circle: CG Square: V-cycle Star: W-cycle

Adaptive Smooth Aggregation AMG Adaptive Smoothed Aggregation (  SA) Multigrid, Brezina, Falgout, MacLachlan, Manteuffel, McCormick, and Ruge, SIAM Review, Adaptive Smoothed Aggregation Multigrid for Lattice QCD, Brannick, Brezina, Keyes, Livne, Livshits, MacLachlan, Manteuffel, McCormick, and Ruge, Zikatanov,J. Comp. Physics, Adaptively use (s)low modes to define the evolving V-cycle Initial Algorithm Setup 1. Relax on Ax = 0, with random initial guess 1. Relax on Ax = 0, with random initial guess (resulting error is repesentative of (s)low modes). (resulting error is repesentative of (s)low modes). 2. Cut vector into pieces over aggregates (blocks). 2. Cut vector into pieces over aggregates (blocks). 3. Define the prolongator so that x = Px. 3. Define the prolongator so that x = Px. 4. Smooth the vector using simple Richardson 4. Smooth the vector using simple Richardson iteration: P = (I - ¸ A)P, ¸ choosen to minimize iteration: P = (I - ¸ A)P, ¸ choosen to minimize condition number of coarse scale operator: condition number of coarse scale operator: A = ((I-¸ A)P)A(I-¸ A)P. A = ((I-¸ A)P)A(I-¸ A)P. * c c General setup adaptive process repeated with current General setup adaptive process repeated with current solver to find additional vectors as needed solver to find additional vectors as needed

Adaptive SA designed for problem without underlying geometry Uses algebraic defintion of “strength of connection” to define aggregates QCD defined on regular lattice with unitary connections and so use regular geometric blocking strategy (i.e., 4 x n x n ) Maintains simple regular geometry on coarse scales, allowing for perfect load balancing and minimal comm. Original algorithm requires HPD operator and thus we solve M M Adaptive Smooth Aggregation MGdsc *

Results for M M Schwinger model, 2-d with U(1) background on128 x 128 lattice with ¯ = 6,10, Q = 0,4, mass gap = Use 4 x 4 ( x 2 ) blocking and 3 levels with 8 vectors Under-relaxed MinRes smoother (Bank and Douglas) Compare MG-PCG with CG *

Results… ¯ = 6¯ = 10 Critical slowing down eliminated! Critical slowing down eliminated! No dependence on No dependence on ¯ Dramatic improvement over CG Dramatic improvement over CG Adaptive Multigrid for QCD, Brannick, Brower, Clark, Osborne, and Rebbi, Phys. Rev. Letters, sub Adaptive Multigrid for Wilson Fermions, Brannick, Brower, Clark, Osborne, and Rebbi, Proc. of Science: Lattice 07, sub

Results: MG for M ¯ = 6, N = 128 Huge reduction of flops Huge reduction of flops Fewer vectors needed Fewer vectors needed Develop. of code for full 4-d QCD underway Develop. of code for full 4-d QCD underway Adaptive Multigrid for the non-hermitian Wilson operator, Brannick, Brower, Clark, Osborne, and Rebbi, in preparation.

Possible future collaborations Current projects (with J. Xu & L. Zikatanov) Radiation transport Radiation transport Electromagnetics Electromagnetics Oil resevoir simulations Oil resevoir simulations Fuel cell dynamics Fuel cell dynamics Stochastic matrices Stochastic matrices Lattice field theories Lattice field theories