Master Thesis Literature Study Presentation
|
|
- Monica Sims
- 5 years ago
- Views:
Transcription
1 Master Thesis Literature Study Presentation Delft University of Technology The Faculty of Electrical Engineering, Mathematics and Computer Science January 29, 2010
2 Plaxis Introduction Plaxis Finite Element Method Plaxis B.V. is a company specialized in finite element software intended for 2D and 3D analysis of deformation, stability and groundwater flow in geotechnical engineering.
3 Plaxis Finite Element Method
4 Finite Element Method Plaxis Finite Element Method The Finite Element Method (FEM) is a numerical technique for finding approximate solutions of partial differential equations (PDE).
5 Example Introduction Plaxis Finite Element Method
6 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration
7 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Main problem Solve: Ax = b, (1) where A R n n is SPD.
8 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Basic Iterative Methods Let us take x i+1 = x i + M 1 (b Ax i ) (2) Which generates a sequence with the following property x i x 0 + span{m 1 r 0, M 1 A(M 1 r 0 ),..., (M 1 A) i 1 (M 1 r 0 )}. (3)
9 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Set M = I.
10 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Set M = I. x x i A = min y K i (A;r 0 ) x y A, for all i.
11 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Set M = I. x x i A = min y K i (A;r 0 ) x y A, for all i. Solution of the problem leads to the.
12 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Conjugate Gradient Algorithm Choose x 0, set i = 0, r 0 = b Ax 0. WHILE r k =0 DO i := i + 1 IF i = 0 DO p 1 = r 0 ELSE β i = r T i 1 r i 1 r T i 2 r i 2 p i = r i 1 + β i p i 1 ENDIF α i = r i 1 T r i 1 p i T Ap i x i = x i 1 + α i p i r i = r i 1 α i Ap i END WHILE (4)
13 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Theorem Let A and x be the coefficient matrix and the solution of (1), and let (x i, i = 0, 1, 2...) be the sequence generated by the CG method. Then, elements of the sequence satisfy the following inequality: x x i A 2 ( κ(a) 1 κ(a) + 1 ) i x x 0 A, (5) where κ(a) is the condition number of A in the 2 - norm.
14 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Speed up? Yes, with preconditioning.
15 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Transform the system (1) into A x = b, (6) where A = P 1 AP T, x = P T x and b = P 1 b, where P is a non-singular matrix. The SPD matrix M defined by M = PP T is called the preconditioner.
16 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Preconditioned Conjugate Gradient Algorithm Choose x 0, set i = 0, r 0 = b Ax 0. WHILE r i =0 DO z i = M 1 r i i := i + 1 IF i = 0 DO p 1 = z 0 ELSE β i = r T i 1 z i 1 r T i 2 z i 2 p i = z i 1 + β i p i 1 ENDIF α i = r i 1 T z i 1 p i T Ap i x i = x i 1 + α i p i r i = r i 1 α i Ap i END WHILE (7)
17 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration There are several possibilities for the preconditioner. Examples Jacobi, M - diag(a).
18 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration There are several possibilities for the preconditioner. Examples Jacobi, M - diag(a). SSOR, M = 1 2 ω ( 1 ω D + L)( 1 ω D) 1 ( 1 ω D + L)T
19 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration There are several possibilities for the preconditioner. Examples Jacobi, M - diag(a). SSOR, M = 1 2 ω ( 1 ω D + L)( 1 ω D) 1 ( 1 ω D + L)T Incomplete Cholesky
20 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration There are several possibilities for the preconditioner. Examples Jacobi, M - diag(a). SSOR, M = 1 2 ω ( 1 ω D + L)( 1 ω D) 1 ( 1 ω D + L)T Incomplete Cholesky Many, many more.
21 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Second Simple Problem Figure: Second Simple Problem Representation
22 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration log 10 (i th residue) CG CG with Jacobi Official Approach with PreSSOR Iteration step Figure: Plot of log 10 of i-th residue
23 Main Problem and Basic Iterative Methods Convergence of CG Precondtioned Numerical Ilustration Figure: Plot of log 10 of eigenvalues
24 Main idea Deflated Preconditoned vector DEFLATION
25 Main idea Deflated Preconditoned vector How to get rid of unfavorable eigenvalues that deteriorate the convergence of PCG?
26 Main idea Deflated Preconditoned vector Split x = (I P T )x + P T x, (8) where, P = I AQ, Q = ZE 1 Z T E = Z T AZ and Z R n m. (9)
27 Main idea Deflated Preconditoned vector After some transformation we get an equivalent, deflated system: PA x = Pb, (10) which can be solved with CG or PCG.
28 Main idea Deflated Preconditoned vector Deflated Preconditioned Conjugate Gradient Algorithm Choose x 0, set i = 0, r 0 = P(b A x 0 ). WHILE r k =0 DO i := i + 1 IF i = 1 DO y 0 = M 1 r 0 p 1 = y 0 ELSE y i 1 = M 1 r i 1 β i = r T i 1 y i 1 r T i 2 y i 2 p i = y i 1 + β i p i 1 ENDIF α i = r i 1 r T i 1 p i T PAp i x i = x i 1 + α i p i r i = r i 1 α i PAp i END WHILE x orginal = Qb + P T x last (11)
29 Main idea Deflated Preconditoned vector How to choose Z?
30 Main idea Deflated Preconditoned vector Several choices for Z: Approximated Eigenvector
31 Main idea Deflated Preconditoned vector Several choices for Z: Approximated Eigenvector Subdomain
32 Main idea Deflated Preconditoned vector Several choices for Z: Approximated Eigenvector Subdomain Rigid Body Mode
33 Main Idea Schwarz Alternating Procedure Numerical Experiments
34 Main Idea Schwarz Alternating Procedure Numerical Experiments Definition We will call a method a method, if its main idea will be based on the principle of divide and conquer applied on the domain of the problem.
35 Main Idea Schwarz Alternating Procedure Numerical Experiments Figure: An example of domain decomposition
36 Main Idea Schwarz Alternating Procedure Numerical Experiments There are several ways to do it. The most known are: Schwarz Alternating Procedure Schur Complement
37 Main Idea Schwarz Alternating Procedure Numerical Experiments Lets consider a domain as shown in the last figure with two overlapping subdomains Ω 1 and Ω 2 on which we want to solve a PDE of the following form: { Lu = b, in Ω u = g, on Ω. (12)
38 Main Idea Schwarz Alternating Procedure Numerical Experiments Schwarz Alternating Procedure Choose u 0 WHILE no convergence DO FOR i = 1,...s DO Solve Lu = b in Ω i with u = u ij in Γ ij Update u values on Γ ij, j END FOR END WHILE (13) In our case, s = 2.
39 Main Idea Schwarz Alternating Procedure Numerical Experiments Within the SAP there are two distinguished variants Multiplicative Schwarz Method (MSM) Additive Schwarz Method (ASM)
40 Multiplicative Schwarz Method Main Idea Schwarz Alternating Procedure Numerical Experiments [ u n+1/2 = u n A 1 + Ω u n+1 = u n+1/2 + [ A 1 Ω 2 ] (b Au n ) ] (b Au n+1/2 ) (14) where A Ωi stays for the discrete form of the operator L restricted to Ω i
41 Additive Schwarz Method Main Idea Schwarz Alternating Procedure Numerical Experiments ([ u n+1 = u n A 1 + Ω ] [ A 1 Ω 2 ]) (b Au n ) (15)
42 Main Idea Schwarz Alternating Procedure Numerical Experiments Additive Schwarz Method Or in a more general: Additive Schwarz Method Choose u 0, i = 0, WHILE no convergence DO r i = b Au n FOR i = 1,...s DO δ i = B i r i END FOR s u n+1 = u n + δ i i=1 i = i + 1 END WHILE (16) where B i = R t i A 1 Ω i R i
43 Numerical Experiments Main Idea Schwarz Alternating Procedure Numerical Experiments Figure: Domain Ω split into two subdomains, Ω 1 and Ω 2.
44 MSM Introduction Main Idea Schwarz Alternating Procedure Numerical Experiments Size of the overlap Iteration step 12 Figure: Contour plot of the log 10 (i-th residue) for MSM.
45 ASM Introduction Main Idea Schwarz Alternating Procedure Numerical Experiments Size of the overlap Iteration step 12 Figure: Contour plot of the log 10 (i-th residue) for ASM
46 Choice of method Test Problems Conclusions Goals
47 Choice of the method Choice of method Test Problems Conclusions Goals DPCG with Additive Schwarz as the preconditoner and physics based decomposition.
48 First Simple Problem Introduction Choice of method Test Problems Conclusions Goals Figure: First Simple Problem Representation
49 Choice of method Test Problems Conclusions Goals Log 10 (j th residuum) Iteration count Figure: First Simple Problem convergence behavior for PCG
50 Choice of method Test Problems Conclusions Goals Analysis of the decomposition position Size of first subdomain Iteration count Figure: First Simple Problem distribution of error in PCG
51 Second Simple Problem Choice of method Test Problems Conclusions Goals Figure: Second Simple Problem Representation
52 Choice of method Test Problems Conclusions Goals Log 10 (j th residuum) Iteration count Figure: Second Simple Problem convergence behavior for PCG with 2 subdomains
53 Choice of method Test Problems Conclusions Goals Log 10 (j th residuum) Iteration count Figure: Second Simple Problem convergence behavior for PCG with 4 subdomains
54 Choice of method Test Problems Conclusions Goals Log 10 (j th residuum) Iteration count Figure: Second Simple Problem convergence behavior for PCG with 8 subdomains
55 Choice of method Test Problems Conclusions Goals Iteration count 8 Figure: Second Simple Problem distribution of error in PCG
56 Choice of method Test Problems Conclusions Goals The choice of the method is right.
57 Choice of method Test Problems Conclusions Goals The choice of the method is right. Number and size of the subdomains matters.
58 Choice of method Test Problems Conclusions Goals The choice of the method is right. Number and size of the subdomains matters. Introduction of deflation.
59 Goals Introduction Choice of method Test Problems Conclusions Goals
60 Questions Introduction Choice of method Test Problems Conclusions Goals Subdomain overlap.
61 Choice of method Test Problems Conclusions Goals Questions Subdomain overlap. Performance of.
62 Choice of method Test Problems Conclusions Goals The End
On 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 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 informationLecture # 20 The Preconditioned Conjugate Gradient Method
Lecture # 20 The Preconditioned Conjugate Gradient Method We wish to solve Ax = b (1) A R n n is symmetric and positive definite (SPD). We then of n are being VERY LARGE, say, n = 10 6 or n = 10 7. Usually,
More informationRobust Preconditioned Conjugate Gradient for the GPU and Parallel Implementations
Robust Preconditioned Conjugate Gradient for the GPU and Parallel Implementations Rohit Gupta, Martin van Gijzen, Kees Vuik GPU Technology Conference 2012, San Jose CA. GPU Technology Conference 2012,
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 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 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 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 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 informationThe Deflation Accelerated Schwarz Method for CFD
The Deflation Accelerated Schwarz Method for CFD J. Verkaik 1, C. Vuik 2,, B.D. Paarhuis 1, and A. Twerda 1 1 TNO Science and Industry, Stieltjesweg 1, P.O. Box 155, 2600 AD Delft, The Netherlands 2 Delft
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 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 informationA Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems
A Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems Mario Arioli m.arioli@rl.ac.uk CCLRC-Rutherford Appleton Laboratory with Daniel Ruiz (E.N.S.E.E.I.H.T)
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 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 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 informationPreconditioning Techniques Analysis for CG Method
Preconditioning Techniques Analysis for CG Method Huaguang Song Department of Computer Science University of California, Davis hso@ucdavis.edu Abstract Matrix computation issue for solve linear system
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
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 informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
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 informationNotes on PCG for Sparse Linear Systems
Notes on PCG for Sparse Linear Systems Luca Bergamaschi Department of Civil Environmental and Architectural Engineering University of Padova e-mail luca.bergamaschi@unipd.it webpage www.dmsa.unipd.it/
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 informationLinear and Non-Linear Preconditioning
and Non- martin.gander@unige.ch University of Geneva July 2015 Joint work with Victorita Dolean, Walid Kheriji, Felix Kwok and Roland Masson (1845): First Idea of After preconditioning, it takes only three
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 informationJae Heon Yun and Yu Du Han
Bull. Korean Math. Soc. 39 (2002), No. 3, pp. 495 509 MODIFIED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX Jae Heon Yun and Yu Du Han Abstract. We propose
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 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 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 informationITERATIVE METHODS BASED ON KRYLOV SUBSPACES
ITERATIVE METHODS BASED ON KRYLOV SUBSPACES LONG CHEN We shall present iterative methods for solving linear algebraic equation Au = b based on Krylov subspaces We derive conjugate gradient (CG) method
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 01-13 The influence of deflation vectors at interfaces on the deflated conjugate gradient method F.J. Vermolen and C. Vuik ISSN 1389-6520 Reports of the Department
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 informationLecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc.
Lecture 11: CMSC 878R/AMSC698R Iterative Methods An introduction Outline Direct Solution of Linear Systems Inverse, LU decomposition, Cholesky, SVD, etc. Iterative methods for linear systems Why? Matrix
More informationIncomplete Cholesky preconditioners that exploit the low-rank property
anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université
More informationLecture 17 Methods for System of Linear Equations: Part 2. Songting Luo. Department of Mathematics Iowa State University
Lecture 17 Methods for System of Linear Equations: Part 2 Songting Luo Department of Mathematics Iowa State University MATH 481 Numerical Methods for Differential Equations Songting Luo ( Department of
More informationScientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1
Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û
More informationIterative techniques in matrix algebra
Iterative techniques in matrix algebra Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Norms of vectors and matrices 2 Eigenvalues and
More informationPoisson Equation in 2D
A Parallel Strategy Department of Mathematics and Statistics McMaster University March 31, 2010 Outline Introduction 1 Introduction Motivation Discretization Iterative Methods 2 Additive Schwarz Method
More informationConjugate gradient method. Descent method. Conjugate search direction. Conjugate Gradient Algorithm (294)
Conjugate gradient method Descent method Hestenes, Stiefel 1952 For A N N SPD In exact arithmetic, solves in N steps In real arithmetic No guaranteed stopping Often converges in many fewer than N steps
More informationImplementation of the Deflated Pre-conditioned Conjugate Gradient Method applied to the Poisson equation related to bubbly flow on the GPU
Faculty of Electrical Engineering, Mathematics, and Computer Science Delft University of Technology Implementation of the Deflated Pre-conditioned Conjugate Gradient Method applied to the Poisson equation
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 informationConjugate Gradient Method
Conjugate Gradient Method direct and indirect methods positive definite linear systems Krylov sequence spectral analysis of Krylov sequence preconditioning Prof. S. Boyd, EE364b, Stanford University Three
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 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 informationTopics. The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems
Topics The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems What about non-spd systems? Methods requiring small history Methods requiring large history Summary of solvers 1 / 52 Conjugate
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 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 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 informationLinear and Non-Linear Preconditioning
and Non- martin.gander@unige.ch University of Geneva June 2015 Invents an Iterative Method in a Letter (1823), in a letter to Gerling: in order to compute a least squares solution based on angle measurements
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationIndefinite and physics-based preconditioning
Indefinite and physics-based preconditioning Jed Brown VAW, ETH Zürich 2009-01-29 Newton iteration Standard form of a nonlinear system F (u) 0 Iteration Solve: Update: J(ũ)u F (ũ) ũ + ũ + u Example (p-bratu)
More information7.2 Steepest Descent and Preconditioning
7.2 Steepest Descent and Preconditioning Descent methods are a broad class of iterative methods for finding solutions of the linear system Ax = b for symmetric positive definite matrix A R n n. Consider
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 informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 09-08 Preconditioned conjugate gradient method enhanced by deflation of rigid body modes applied to composite materials. T.B. Jönsthövel ISSN 1389-6520 Reports of
More informationEfficient Estimation of the A-norm of the Error in the Preconditioned Conjugate Gradient Method
Efficient Estimation of the A-norm of the Error in the Preconditioned Conjugate Gradient Method Zdeněk Strakoš and Petr Tichý Institute of Computer Science AS CR, Technical University of Berlin. International
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 informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationCLASSICAL ITERATIVE METHODS
CLASSICAL ITERATIVE METHODS LONG CHEN In this notes we discuss classic iterative methods on solving the linear operator equation (1) Au = f, posed on a finite dimensional Hilbert space V = R N equipped
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 10-14 On the Convergence of GMRES with Invariant-Subspace Deflation M.C. Yeung, J.M. Tang, and C. Vuik ISSN 1389-6520 Reports of the Delft Institute of Applied Mathematics
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 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 informationNumerical behavior of inexact linear solvers
Numerical behavior of inexact linear solvers Miro Rozložník joint results with Zhong-zhi Bai and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic The fourth
More informationOn the accuracy of saddle point solvers
On the accuracy of saddle point solvers Miro Rozložník joint results with Valeria Simoncini and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic Seminar at
More information4.6 Iterative Solvers for Linear Systems
4.6 Iterative Solvers for Linear Systems Why use iterative methods? Virtually all direct methods for solving Ax = b require O(n 3 ) floating point operations. In practical applications the matrix A often
More informationKey words. conjugate gradients, normwise backward error, incremental norm estimation.
Proceedings of ALGORITMY 2016 pp. 323 332 ON ERROR ESTIMATION IN THE CONJUGATE GRADIENT METHOD: NORMWISE BACKWARD ERROR PETR TICHÝ Abstract. Using an idea of Duff and Vömel [BIT, 42 (2002), pp. 300 322
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 informationPreface to Second Edition... vii. Preface to First Edition...
Contents Preface to Second Edition..................................... vii Preface to First Edition....................................... ix Part I Linear Algebra 1 Basic Vector/Matrix Structure and
More informationEfficient Estimation of the A-norm of the Error in the Preconditioned Conjugate Gradient Method
Efficient Estimation of the A-norm of the Error in the Preconditioned Conjugate Gradient Method Zdeněk Strakoš and Petr Tichý Institute of Computer Science AS CR, Technical University of Berlin. Emory
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 informationIterative solution methods and their rate of convergence
Uppsala University Graduate School in Mathematics and Computing Institute for Information Technology Numerical Linear Algebra FMB and MN Fall 2007 Mandatory Assignment 3a: Iterative solution methods 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 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 informationStudy on Preconditioned Conjugate Gradient Methods for Solving Large Sparse Matrix in CSR Format
Study on Preconditioned Conjugate Gradient Methods for Solving Large Sparse Matrix in CSR Format (Course Project of ECE697NA) Lin Du, Shujian Liu April 30, 2015 Contents 1 Introdution 1 1.1 Methods for
More informationCS137 Introduction to Scientific Computing Winter Quarter 2004 Solutions to Homework #3
CS137 Introduction to Scientific Computing Winter Quarter 2004 Solutions to Homework #3 Felix Kwok February 27, 2004 Written Problems 1. (Heath E3.10) Let B be an n n matrix, and assume that B is both
More informationScalable Non-blocking Preconditioned Conjugate Gradient Methods
Scalable Non-blocking Preconditioned Conjugate Gradient Methods Paul Eller and William Gropp University of Illinois at Urbana-Champaign Department of Computer Science Supercomputing 16 Paul Eller and William
More informationITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 4 : CONJUGATE GRADIENT METHOD
ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 4 : CONJUGATE GRADIENT METHOD Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Numerical Simulation
More informationA COMPARISON OF TWO-LEVEL PRECONDITIONERS BASED ON MULTIGRID AND DEFLATION
A COMPARISON OF TWO-LEVEL PRECONDITIONERS BASED ON MULTIGRID AND DEFLATION J. M. TANG, S. P. MACLACHLAN, R. NABBEN, AND C. VUIK Abstract. It is well-known that two-level and multi-level preconditioned
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 informationIntroduction to Iterative Solvers of Linear Systems
Introduction to Iterative Solvers of Linear Systems SFB Training Event January 2012 Prof. Dr. Andreas Frommer Typeset by Lukas Krämer, Simon-Wolfgang Mages and Rudolf Rödl 1 Classes of Matrices and their
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 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 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 informationTsung-Ming Huang. Matrix Computation, 2016, NTNU
Tsung-Ming Huang Matrix Computation, 2016, NTNU 1 Plan Gradient method Conjugate gradient method Preconditioner 2 Gradient method 3 Theorem Ax = b, A : s.p.d Definition A : symmetric positive definite
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 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 informationNumerical Linear Algebra And Its Applications
Numerical Linear Algebra And Its Applications Xiao-Qing JIN 1 Yi-Min WEI 2 August 29, 2008 1 Department of Mathematics, University of Macau, Macau, P. R. China. 2 Department of Mathematics, Fudan University,
More informationAN INTRODUCTION TO DOMAIN DECOMPOSITION METHODS. Gérard MEURANT CEA
Marrakech Jan 2003 AN INTRODUCTION TO DOMAIN DECOMPOSITION METHODS Gérard MEURANT CEA Introduction Domain decomposition is a divide and conquer technique Natural framework to introduce parallelism in the
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 informationMultigrid Methods for Discretized PDE Problems
Towards Metods for Discretized PDE Problems Institute for Applied Matematics University of Heidelberg Feb 1-5, 2010 Towards Outline A model problem Solution of very large linear systems Iterative Metods
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 information1. 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 informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 10-19 Fast Iterative Methods for Discontinuous Galerin Discretizations for Elliptic PDEs P. van Slingerland, and C. Vui ISSN 1389-650 Reports of the Department of
More informationModified Roe Flux Function for Perfectly Preconditioned Systems
Modified oe Flux Function for Perfectly Preconditioned Systems Hiroaki Nishikawa January 003 1 General Form Consider a D linearized symmetrizable conservation law in the conservative form, U t + AU x +
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 informationSolution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method
Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts
More informationDepartment of Computer Science, University of Illinois at Urbana-Champaign
Department of Computer Science, University of Illinois at Urbana-Champaign Probing for Schur Complements and Preconditioning Generalized Saddle-Point Problems Eric de Sturler, sturler@cs.uiuc.edu, http://www-faculty.cs.uiuc.edu/~sturler
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 informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
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 informationIterative Methods for Smooth Objective Functions
Optimization Iterative Methods for Smooth Objective Functions Quadratic Objective Functions Stationary Iterative Methods (first/second order) Steepest Descent Method Landweber/Projected Landweber Methods
More information