Kasetsart University Workshop. Multigrid methods: An introduction
|
|
- Jesse Cameron
- 5 years ago
- Views:
Transcription
1 Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA A copy of these slides is available at pardhan/kaset/workshop/
2 Topics to be covered Outline of PDE solution approach Algebraic system solvers Basic iterative methods Motivation for multigrid Basic multigrid ingredients Cycling strategies Generalization to nonlinear problems Scalars a, b, c, Vectors a, b, c, Matrices A, B, C, General notation
3 PDE Solution Outline General PDE problem: Lu = f in Ω Bu = g on Ω where L = PDE operator, B = boundary operator, Ω = domain, Ω = domain boundary, and u = unknown solution Specific example: 2 u e25x = 625 x2 e 25 1 in 0 < x < 1 u(0) = 0, u(1) = 1 The analytical solution to this problem is: u(x) = e25x 1 e 25 1
4 Numerical solution method: 1. Discretize domain: Ω Ω h = Construct suitable mesh (grid) 2. Discretize PDE on Ω h : Lu = f A h u h = b h = Use finite-difference, finite-element, finite-volume... = PDE becomes algebraic system 3. Solve algebraic system for u h 4. Interpolate discrete solution u h 1-D example: 1. Grid generation (uniform spacing h with N nodes) u h Ω h 1 2 i 1 i i + 1 N 2. PDE discretization: Use finite difference At any node i, from Taylor series u i+1 = u i + hu i + h2 2 u i + h3 6 u i + h4 24 uiv i + u i 1 = u i hu i + h2 2 u i h3 6 u i + h4 24 uiv i + Add the two and get the approximation 2 u x u i 1 2u i + u i+1 2 h 2
5 Therefore, our PDE problem 2 u x = f(x) becomes u i 1 2u i + u i+1 2 h 2 Assemble over entire grid and get algebraic system where A h u h = b h f i u h = [u 1, u 2,, u i,, u N ] T b h A h = = h 2 [0, f 2, f 3,, f i,, 1/h 2 ] T and f i = 625 e25x i e Solve N N algebraic system for u h 4. Interpolate u h between nodes if necessary
6 Taylor series centered at x i for deriving other finite difference approximations Assume following uniform mesh structure: h i 4 i 3 i 2 i 1 i i + 1 i + 2 i + 3 i + 4 Taylor series expansions of function u(x) about node i u i 4 u i 3 u i 2 u i 1 u i+1 u i+2 u i+3 u i+4 = u i 4hu i + 16 h2 2 u i 64 h3 6 u i h4 24 uiv i = u i 3hu i + 9 h2 2 u i 27 h3 6 u i + 81 h4 24 uiv i = u i 2hu i + 4 h2 2 u i 8 h3 6 u i + 16 h4 24 uiv i = u i hu i + h2 2 u i h3 6 u i + h4 24 uiv i = u i + hu i + h2 2 u i + h3 6 u i + h4 24 uiv i = u i + 2hu i + 4 h2 2 u i + 8 h3 6 u i + 16 h4 24 uiv i = u i + 3hu i + 9 h2 2 u i + 27 h3 6 u i + 81 h4 24 uiv i = u i + 4hu i + 16 h2 2 u i + 64 h3 6 u i h4 24 uiv i 1024 h5 120 uv i + (1) 243 h5 120 uv i + (2) 32 h5 120 uv i + (3) h5 120 uv i + (4) + h5 120 uv i + (5) + 32 h5 120 uv i + (6) h5 120 uv i + (7) h5 120 uv i + (8)
7 Remarks: PDE transformed to system of algebraic equations With N grid points: Size of algebraic system = N N Number of unknowns = O(N) For large N, algebraic solution dominates computational effort (CPU time) Efficient algebraic solvers are very important Observe that A h is very sparse; this is typical in PDE problems Key point: Efficient algebraic solvers are crucial for solving PDE s efficiently Multigrid methods are basically very efficient algebraic system solvers
8 Linear Algebraic System Solvers Algebraic problem Au = b Given A (N N matrix) and b (N-vector), solve for u. Two main approaches: (1) Direct methods (Gauss elimination & variants) (2) Iterative methods For large, sparse, well-behaved matrices, iterative methods are much faster Multigrid methods are a special form of iterative methods We ll focus on iterative methods first
9 Basic Iterative Methods: An illustration Suppose we want to solve u 1 u 2 u 3 = Our system can be written as u 1 2u 2 + u 3 = 1 u 1 + u 2 = 2 = 2u 1 + u 2 + u 3 = 3 u 1 = 1 + 2u 2 u 3 u 2 = 2 + u 1 u 3 = 3 2u 1 u 2 Now consider the iteration scheme u k+1 1 = 1 + 2u k 2 u k 3 u k+1 2 = 2 + u k 1 u k+1 3 = 3 2u k 1 u k 2 where k denotes the iteration number Suppose the initial guess is u 0 = [0 0 0] T Then we get u 1 = [1 2 3] T u 2 = [2 3 1] T u 3 = [8 4 4] T etc. This is the classic Jacobi method If it converges, we should eventually get the exact solution
10 Iterative Methods: More general form Recap problem statement: Given A and b, solve for u Iterative procedure: 1. Pick arbitrary initial guess u 0 2. Recursively update using the formula Au = b (9) u k+1 = [I Q 1 A] u k + Q 1 b (10) where k = 0, 1, 2, is the iteration index, and Q is a matrix that depends on the specific iterative method Example: Jacobi method = Q = D Gauss-Seidel method = Q = D + L where D and L are the diagonal and lower-triangular parts of A The form (10) is useful for analysis, but in practice Q is not explicitly computed we often rewrite (10) in the form u k+1 = R u k + g (11) where R is the iteration matrix and g is a constant vector
11 Practical Implementation: Rewrite algebraic system (9) as: N a ij u j = b i, j=1 i = 1, 2,, N Split LHS into 3 parts i 1 j=1 = a ii u i = Iteration formulas: a ij u j + a ii u i + N j=i+1 i 1 b i + j=1 a ij u j = b i N j=i+1 a ij u j (12) Jacobi a ii u new i = i 1 b i + j=1 N a ij u old (13) j=i+1 j Gauss-Seidel a ii u new i = i 1 b i j=1 a ij u new j + N j=i+1 a ij u old (14) j
12 Recap of iterative procedure: 1. Pick initial guess u 0 = [u 0 1, u 0 2,, u 0 N ] 2. Recursively apply iterative formula: for k=1:k end % (Iteration loop) for i=1:n % (Loop over rows of algebraic system) end where end u k+1 i = [b i ρ = { i 1 j=1 k k + 1 a ij u ρ j N j=i+1 a ij u k j] / a ii for Jacobi for Gauss-Seidel Variants of Jacobi & Gauss-Seidel: Damped Jacobi: At each iteration k + 1, do the following: (1) Compute Jacobi iterate, say ū k+1, as before (2) Set u k+1 = ω ū k+1 + (1 ω) u k, (0 < ω 1) SOR (Successive Over-Relaxation): At each iteration k + 1, do the following: (1) Compute Gauss-Seidel iterate ū k+1 (2) Set u k+1 = ω ū k+1 + (1 ω) u k, (0 < ω < 2)
13 Convergence of Iterative Methods Depends on properties of A Assume A arises from discretizing elliptic PDE Typical behavior Fast convergence in 1st few iterations Slow convergence thereafter
14 Reason for such convergence behavior: Let initial error = e 0 e 0 can be viewed as superposition of discrete Fourier modes e 0 = e.g., w n = {cos(nπx i )} N i=1 Low n = low frequency High n = high frequency N 1 n=0 α n w n Iter. methods not equally effective on all error frequencies (1) More effective on high frequencies (HF) (see matlab animation) (2) Less effective on low frequencies (LF) Quick elimination of HF errors leads to rapid convergence initially; lingering LF errors decrease convergence thereafter
15
16 Remarks: High frequency is defined relative to N (i.e., no. of grid points) Highest visible frequency (i.e., w N 1 ) depends on N HF on coarse grid looks like LF on fine grid Example: Ω 1 N points and Ω 2 2N points Highest frequency on Ω 2 = 2 HF on Ω 1 Motivation for Multigrid Iterative methods preferentially damp HF errors This is called smoothing property Overall convergence rate is slowed by LF errors HF and LF are defined relative to grid spacing To improve convergence rate, LF must be disguised as HF This is precisely what multigrid does Multigrid = use progressively coarser grids to attenuate LF error modes
17 Convergence analysis in more detail Consider the algebraic system and the iteration algorithm Au = b u (k+1) = R u (k) + g Clearly, the exact solution u is a fixed point, since u = Ru + g u = [I Q 1 A]u + Q 1 b which is always true Subtract [u (k+1) = R u (k) + g] [u = Ru + g]. We get e (k+1) = R e (k) where e (k) is the error at the k th iterate. Let e (0) be the initial error. Then we have e (k) = R k e (0) For convergence, we want R k 0 as k From linear algebra we know that R k 0 iff ρ(r) < 1 where ρ(r) is the spectral radius (eigenvalue of largest magnitude) of R ρ(r) < 1 guarantees the method converges, and ρ(r) is the convergence rate
18 Rate of convergence Suppose we want to reduce the initial error by 1/10. Then e (M) e (0) 10 R M e (0) e (0) 10 ρ(r) M 1 10 M ln(1/10) ln(ρ(r)) M is the number of iterations needed to reduce error by 1/10 Note that ρ(r) 0 M 0 and ρ(r) 1 M Thus ρ(r) is a key indicator of the convergence rate
19 Illustration using damped Jacobi method As before, consider the PDE problem which gives the algebraic system 2 u x 2 = f(x) Au = b where A = Damped Jacobi iterations can be written as u (k+1) = R u (k) + g where R = I ωd 1 A, and D = diag(a), 0 < ω 1. The next few slides are from the the multigrid tutorial by Briggs, which contains very clear and complete visuals for this case.
20 Convergence analysis for weighted Jacobi on 1D model 1 Rω = ( 1 ω) I + ωd ( L + U ) 1 = I ωd A R ω = I ω ω λ( R ω ) = 1 λ ( A) 2 For the 1D model problem, he eigenvectors of the weighted Jacobi iteration and the eigenvectors of the matrix A are the same! The eigenvalues are related as well of 119
21 Good exercise: Find the eigenvalues & eigenvectors of A Show that the eigenvectors of A are Fourier modes! kπ jkπ λk ( A) = 4sin2, wk j = sin 2N, N of 119
22 Eigenvectors of R ω and A are the same,the eigenvalues related kπ λ k ( R ω ) = 1 2ωsin2 2N Expand the initial error in terms of the eigenvectors: e( 0 N 1 ) = ck wk k = 1 After M iterations, R M e ( N 1 N 1 M = k k k = 1 k = 1 0) c R w = c λ k M k w k The k th mode of the error is reduced by λ k at each iteration 30 of 119
23 Relaxation suppresses eigenmodes unevenly Eigenvalue Look carefully at ω = 1 N 2 k λ k kπ ( R ω ) = 1 2ωsin2 2N ω = 1/ 3 ω = 1/ 2 ω = 2/ 3 Note that if 0 ω 1 then λk( R ω) < 1 for k = 1, 2,..., N 1 For 0 ω 1, λ = 1 2ωsin2 1 2 = π N π 1 2ωsin2 h 2 = 1 ( h ) 1 O 2 31 of 119
24 Low frequencies are undamped Eigenvalue Notice that no value of ω will damp out the long (i.e., low frequency) waves. ω = 1 N 2 k ω = 1/ 3 ω = 1/ 2 ω = 2/ 3 What value of gives the best damping of the short waves? N 2 N Choose such that λ N 2 ( R ω ω ) k = ω ω = λ 2 3 N ( R ω ) 32 of 119
25 The Smoothing factor The smoothing factor is the largest absolute value among the eigenvalues in the upper half of the spectrum of the iteration matrix smoothing factor N = max λk( R ) for k N 2 For R ω, with =, the smoothing factor is, 3 since 1 N λ = λ = and < for < k < N. N 2 ω 3 2 N 2 λ k λ k N 2 But, 1 k π2 h for long waves k « of 119
26 Convergence of Jacobi on Au= Unweighted Jacobi Weighted Jacobi Wavenumber, k Wavenumber, k Jacobi method on Au=0 with N=64. Number of iterations required to reduce to e <.01 Initial guess : v kj = sin jkπ N 34 of 119
27 Weighted Jacobi Relaxation Smooths the Error Initial error: 2 v kj = sin 2j π N + 1 sin 2 16j π N + 1 sin 2 32j π N Error after 35 iteration sweeps: Many relaxation schemes have the smoothing property, where oscillatory modes of the error are eliminated effectively, but smooth modes are damped very slowly. 35 of 119
28 Multigrid Methods Main ingredients Error smoother Nested iteration Coarse Grid Correction (CGC) Multigrid notation: All quantities have subscripts to denote grid on which they are defined Error smoother Also called relaxation techniques Must efficiently eliminate oscillatory (HF) component of error Certain iterative methods are ideal Gauss-Seidel is very effective for elliptic operators Nested iteration Improve initial guess by solving on coarser grid and interpolating Can generalize to include several nested coarser grids Example: Ω 4h Ω 2h Ω h On Ω 4h : A 4h u 4h = f 4h On Ω 2h : A 2h u 2h = f 2h, use u 0 2h = I[u 4h ] On Ω h : A h u h = f h, use u 0 h = I[u 2h ]
29 Coarse Grid Correction Mechanism for attenuating LF errors Some preliminaries: We have grid Ω h and linear system A h u h = b h If u h is approximate solution, define Therefore, we have error: e h = u h u h residual: r h = b h A h u h A h u h A h u h = b h A h u h A h e h = r h (15) Note that (15) is equivalent to the original system
30 Two-grid CGC Cycle: Original grid is Ω h and linear system Introduce nested coarser grid Ω 2h Ω h CGC cycle: A h u h = b h (16) 1. Perform ν 1 smoothing iterations on (16) with some initial guess on grid Ω h ; obtain approximate solution u h. 2. Compute residual r h = b h A h u h ; restrict r h and A h to the coarse grid (Ω 2h ): A h A 2h, r h r 2h Construct the following coarse grid problem 3. Solve for e 2h. A 2h e 2h = r 2h [recall equation (15)] 4. Interpolate e 2h to fine grid & improve fine grid approximation e 2h e h u new h = u h + e h 5. Perform ν 2 smoothing iterations on (16) using u new h guess. Remarks: Step (1) is called pre-smoothing Step (5) is called post-smoothing Typical values of ν 1 and ν 2 range from 1 to 4 as initial
31 Restriction & Prolongation CGC involves inter-grid transfer operations Fine-to-coarse transfer is called restriction Coarse-to-fine transfer is called prolongation Notation: Restriction operator = I 2h h (e.g., r 2h = I 2h h [r h ]) Prolongation operator = I h 2h (e.g., u h = I h 2h[u 2h ]) Prolongation methods: Use interpolation formulas Linear interpolation is most common 1-D example u h u 2h Ω h 0 1 (2i 1) 2i (2i + 1) 2M Ω 2h 0 i 1 i i + 1 M Thus I h 2h = u 2i h u 2i+1 = u i 2h h = 1 2 (ui 2h + u i+1 2h ), (0 i M) /2 1/ /2 1/ = [2M M] matrix
32 Restriction methods Want to restrict matrix A h and vector r h from Ω h to Ω 2h I 2h h [A h ] = A 2h and I 2h h [r h ] = r 2h Can discretize original PDE on Ω 2h to get A 2h For vectors r h, we can use injection or full-weighting r h r 2h Ω h 0 1 (2i 1) 2i (2i + 1) 2M Ω 2h 0 i 1 i i + 1 M Injection: r i 2h = r 2i h Full-weighting: r i 2h = 1 4 (r2i 1 h + 2r 2i h + r 2i+1 h ) (0 < i < M) This yields the opetator I 2h h = I 2h h = OR... 1/4 1/2 1/4 1/4 1/2 1/4... = [M 2M] matrix Notice that 2I 2h h = [I h 2h] T (if we use full-weighting) = [M 2M] matrix
33 Some remarks on restriction/prolongation It is very useful to have a relation of the form I h 2h = c[i 2h h ] T (for c R) It has some important theoretical implications Furthermore, we can define A 2h = I 2h h A h I h 2h This provides an alternative way to define the coarse grid matrix, without rediscretizing the underlying PDE system. This leads to the following natural strategy for intergrid transfers 1. Define I h 2h in some suitable way 2. Define I 2h h = c[i h 2h] T (e.g., c = 1) 3. Define A 2h = I 2h h A h I h 2h These ideas apply in higher dimensions as well
34 Recall CGC cycle: Generalization to multiple grids On Ω h : A h u h = b h Ω h h On Ω 2h : A 2h e 2h = r 2h Ω 2h 2h Problem on Ω 2h has same form as that on Ω h Therefore, we can compute e 2h by introducing an even coarser grid Ω 4h, and using CGC again The problem on Ω 4h again has the same form Recursive application of CGC leads to MG cycles involving several grid levels Multigrid Cycling Strategies Obtained by using CGC recursively between multiple grid levels Common MG cycles: V -cycle, W -cycle and FMG (Full Multi- Grid)
35 V -cycle Uses one recursive CGC between pairs of grid levels Sketch of resulting grid sequence has V shape Ω h h Ω 2h 2h Ω 4h 4h Ω 8h 8h Example of four nested grid levels in 1-D. Ω h Ω 2h Ω 4h Ω 8h Grid sequence for V -cycle on 4 nested grid levels.
36 Recursive definition of V -cycle (with initial iterate v h ) v h MV h (v h, f h, ν 1, ν 2 ) It consists of the following steps: 1. If h = h c (coarsest grid), go to step 5. Else, perform ν 1 smoothing iterations on A h u h = f h with initial guess v h ; obtain v h, and assign v h v h. 2. Set r h = f h A h v h, f 2h = I 2h h r h ; define coarse grid problem A 2h u 2h = f 2h. 3. Set v 2h 0, and perform v 2h MV 2h (v 2h, f 2h, ν 1, ν 2 ) on coarse grid problem. 4. Set v h v h + I h 2hv 2h. 5. If h = h c solve A h u h = f h exactly, and set v h u h. Else, perform ν 2 smoothing iterations with initial guess v h ; obtain v h, and assign v h v h.
37 W-cycle Uses 2 recursive CGC cycles between pairs of levels Ω h Ω 2h Ω 4h Ω 8h Both V - and W -cycle are a special case of the µ-cycle. It uses µ recursive CGC cycles between pairs of levels v h MG µ h (v h, f h, ν 1, ν 2 ) 1. If h = h c (coarsest grid), go to step 5. Else, perform ν 1 smoothing iterations on A h u h = f h with initial guess v h ; obtain v h, and assign v h v h. 2. Set r h = f h A h v h, f 2h = I 2h h r h, and construct coarse grid problem A 2h u 2h = f 2h. 3. Set v 2h 0, and perform µ times: v 2h MG µ 2h (v 2h, f 2h, ν 1, ν 2 ). 4. Set v h v h + I h 2hv 2h. 5. If h = h c solve A h u h = f h exactly, and set v h u h. Else, perform ν 2 smoothing iterations with initial guess v h ; obtain v h, and assign v h v h.
38 FMG-cycle FMG stands for Full MultiGrid Generalization of the nested iteration concept Use MG cycles in place of ordinary iterations Start at coarsest level & perform nested V -, W - or µ-cycles till finest level Ω h Ω 2h Ω 4h Ω 8h
39 General form: Nonlinear PDE Problems N (u) = f B(u) = g in Ω on Ω where N is nonlinear differential operator, B is boundary operator, u is unknown, f and g are given functions Upon discretizing, we get nonlinear algebraic system: Example: N ( u) = f u xx + λe u = 0, 0 < x < 1 u(0) = u(1) = 0 Discretize on grid of spacing h u 1 = 0 u i 1 (2u i h 2 λe u i ) + u i+1 = 0, (i = 2, 3,, M 1) u M = 0 Nonlinear algebraic systems more difficult to solve than linear systems
40 Nonlinear System Solution Basic solution approaches: 1. Iterative global linearization Successive approximation Newton-type iteration 2. Nonlinear relaxation Nonlinear Jacobi, Gauss-Seidel, SOR, etc. Usual difficulties: Iterations may not converge Convergence may be very slow Initial guess affects convergence
41 Global Linearization Successive Approximation Basic idea: Iteratively lag some unknowns to linearize globally Mathematical form (drop vector notation for convenience): Original algebraic system: N(u) = f Rewrite as: A(u) u = b(u) where A and b are matrix and vector functions of u Successive approximation algorithm: 1. Pick initial guess, u 0 2. Set k = 1 3. Construct linear system: A(u k ) u k+1 = b(u k ) 4. Solve for u k+1 5. If solution is converged, stop; else, set k = k + 1 and go to step (3)
42 Global Linearization Successive Approximation Example: u xx + λe u = 0, 0 < x < 1 u(0) = u(1) = 0 Original algebraic system Rewrite as u i 1 (2u i h 2 λe u i ) + u i+1 = 0 u i 1 2u i + u i+1 = h 2 λe u i which corresponds to A = b = [0,, h 2 λe u i,, 0] T
43 Global Linearization Newton iteration Given algebraic system: N(u) = f Use Taylor series expansion about iterate u k N(u k ) + N u (uk+1 u k ) + O( u 2 ) = f Neglect higher order terms, and get Newton iteration formula N u (uk+1 u k ) = f N(u k ) Iterative solution algorithm analogous to successive approximation case Remarks Both Newton iteration and successive approximation require repeated solution of linear algebraic systems Standard linear multigrid can be used for this
44 Nonlinear Relaxation Given algebraic system: N(u) = f Rewrite as: N i (u 1, u 2,, u i,, u M ) = f i, i = 1, 2,, M Nonlinear relaxation Iteratively decouple the system Solve ith equation for u i assuming all other u s are known Jacobi variant: 1. Pick initial guess, u 0 2. Set k = 1 3. for i=1:m Solve N i (u k 1, u k 2,, u k+1 i,, u k m) = f i for u k+1 i end 4. If solution is converged, stop; else, set k = k + 1 and go to step (3)
45 Nonlinear Relaxation Remarks Can construct analogs of other linear relaxation schemes in a similar way e.g., for Gauss-Seidel, simply replace the equation in step (3) with N i (u k+1 1, u k+1 2,, u k+1,, u k m) = f i In general, step (3) involves nonlinear solution for u k+1 i ; one can use successive approximation or Newton iteration Thus, we again have inner iteration embedded within outer iteration Nonlinear relaxation schemes also often exhibit smoothing property, like their linear counterparts i
46 Nonlinear Multigrid Consider nonlinear PDE, as before N(u) = f in Ω Discretize on grid Ω h and get nonlinear algebraic system where N h is a nonlinear algebraic operator N h (u h ) = f h (17) Suppose we apply a nonlinear relaxation scheme, and get the approximate solution u h. Define Error to residual relation error: e h = u h u h residual: r h = f h N h (u h) N h (u h ) N h (u h) = r h Note that e h cannot be explicitly computed for nonlinear case However, we assume e h behaves as in the linear case quick decay of HF error modes much slower decay of LF modes
47 Nonlinear Multigrid Full Approximation Scheme (FAS) FAS is nonlinear generalization of CGC Assume nonlinear relaxation/smoothing method is available Basic steps very similar to CGC: 1. On fine grid: N h (u h ) = f h ; perform ν 1 nonlinear smoothing iterations, compute u h and r h = f h N h (u h ) 2. On 2h grid: Construct N 2h (u 2h ) = N 2h (Î2h h u h ) + I2h h r h ; solve for u 2h, and compute e 2h = u 2h Î2h h u h 3. Interpolate and correct: u new h = u h + Ih 2he 2h 4. Perform ν 2 nonlinear post-smoothing iterations Notice that step (2) computes e 2h indirectly the full solution u 2h is computed first after that we compute e 2h = u 2h Î2h h u h In linear CGC, step (2) is simpler: 2. On 2h grid: A 2h (e 2h ) = I 2h h r h ; solve for e 2h directly
48 Recap key ideas from last week Algebraic systems typically very large and sparse Efficient solvers crucial for computational efficiency Iterative solvers are attractive for such large linear systems Typical behavior of iterative methods: Fast convergence in 1st few iterations Slow convergence thereafter Reason for this: Iterative methods preferentially damp HF error modes. This is called smoothing property Overall convergence rate is slowed by LF error modes Motivation for multigrid: Take advantage of smoothing property HF and LF are defined relative to grid spacing Multigrid use smoothing on progressively coarser grids to handle LF error modes
Computational 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 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 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 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 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 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 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 informationIterative Methods and Multigrid
Iterative Methods and Multigrid Part 1: Introduction to Multigrid 1 12/02/09 MG02.prz Error Smoothing 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 Initial Solution=-Error 0 10 20 30 40 50 60 70 80 90 100 DCT:
More information6. Multigrid & Krylov Methods. June 1, 2010
June 1, 2010 Scientific Computing II, Tobias Weinzierl page 1 of 27 Outline of This Session A recapitulation of iterative schemes Lots of advertisement Multigrid Ingredients Multigrid Analysis Scientific
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 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 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 informationMULTIGRID METHODS FOR NONLINEAR PROBLEMS: AN OVERVIEW
MULTIGRID METHODS FOR NONLINEAR PROBLEMS: AN OVERVIEW VAN EMDEN HENSON CENTER FOR APPLIED SCIENTIFIC COMPUTING LAWRENCE LIVERMORE NATIONAL LABORATORY Abstract Since their early application to elliptic
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 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 informationNotes on Multigrid Methods
Notes on Multigrid Metods Qingai Zang April, 17 Motivation of multigrids. Te convergence rates of classical iterative metod depend on te grid spacing, or problem size. In contrast, convergence rates of
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 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 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 informationIntroduction to Scientific Computing II Multigrid
Introduction to Scientific Computing II Multigrid Miriam Mehl Slide 5: Relaxation Methods Properties convergence depends on method clear, see exercises and 3), frequency of the error remember eigenvectors
More informationNumerical Solution Techniques in Mechanical and Aerospace Engineering
Numerical Solution Techniques in Mechanical and Aerospace Engineering Chunlei Liang LECTURE 3 Solvers of linear algebraic equations 3.1. Outline of Lecture Finite-difference method for a 2D elliptic PDE
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 informationMath 471 (Numerical methods) Chapter 3 (second half). System of equations
Math 47 (Numerical methods) Chapter 3 (second half). System of equations Overlap 3.5 3.8 of Bradie 3.5 LU factorization w/o pivoting. Motivation: ( ) A I Gaussian Elimination (U L ) where U is upper triangular
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 informationIntroduction to Multigrid Methods Sampling Theory and Elements of Multigrid
Introduction to Multigrid Methods Sampling Theory and Elements of Multigrid Gustaf Söderlind Numerical Analysis, Lund University Contents V3.15 What is a multigrid method? Sampling theory Digital filters
More informationMA3232 Numerical Analysis Week 9. James Cooley (1926-)
MA umerical Analysis Week 9 James Cooley (96-) James Cooley is an American mathematician. His most significant contribution to the world of mathematics and digital signal processing is the Fast Fourier
More informationAn Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84
An Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84 Introduction Almost all numerical methods for solving PDEs will at some point be reduced to solving A
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 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 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 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 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 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 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 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 informationJordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS
Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative
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 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 informationEfficient smoothers for all-at-once multigrid methods for Poisson and Stokes control problems
Efficient smoothers for all-at-once multigrid methods for Poisson and Stoes control problems Stefan Taacs stefan.taacs@numa.uni-linz.ac.at, WWW home page: http://www.numa.uni-linz.ac.at/~stefant/j3362/
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 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 informationGeometric Multigrid Methods for the Helmholtz equations
Geometric Multigrid Methods for the Helmholtz equations Ira Livshits Ball State University RICAM, Linz, 4, 6 November 20 Ira Livshits (BSU) - November 20, Linz / 83 Multigrid Methods Aim: To understand
More informationCAAM 454/554: Stationary Iterative Methods
CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft) CAAM, Rice University, Houston, TX 77005 2007, Revised 2010 Abstract Stationary iterative methods for solving systems of linear equations are
More informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
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 informationHW4, Math 228A. Multigrid Solver. Fall 2010
HW4, Math 228A. Multigrid Solver Date due 11/30/2010 UC Davis, California Fall 2010 Nasser M. Abbasi Fall 2010 Compiled on January 20, 2019 at 4:13am [public] Contents 1 Problem 1 3 1.1 Restriction and
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 informationScientific Computing II
Technische Universität München ST 008 Institut für Informatik Dr. Miriam Mehl Scientific Computing II Final Exam, July, 008 Iterative Solvers (3 pts + 4 extra pts, 60 min) a) Steepest Descent and Conjugate
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 informationNUMERICAL ALGORITHMS FOR A SECOND ORDER ELLIPTIC BVP
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N. MATEMATICĂ, Tomul LIII, 2007, f.1 NUMERICAL ALGORITHMS FOR A SECOND ORDER ELLIPTIC BVP BY GINA DURA and RĂZVAN ŞTEFĂNESCU Abstract. The aim
More informationChapter 5. Methods for Solving Elliptic Equations
Chapter 5. Methods for Solving Elliptic Equations References: Tannehill et al Section 4.3. Fulton et al (1986 MWR). Recommended reading: Chapter 7, Numerical Methods for Engineering Application. J. H.
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 informationMultigrid finite element methods on semi-structured triangular grids
XXI Congreso de Ecuaciones Diferenciales y Aplicaciones XI Congreso de Matemática Aplicada Ciudad Real, -5 septiembre 009 (pp. 8) Multigrid finite element methods on semi-structured triangular grids F.J.
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 207 Philippe B. Laval (KSU) Linear Systems Fall 207 / 2 Introduction We continue looking how to solve linear systems of the
More informationAn Introduction of Multigrid Methods for Large-Scale Computation
An Introduction of Multigrid Methods for Large-Scale Computation Chin-Tien Wu National Center for Theoretical Sciences National Tsing-Hua University 01/4/005 How Large the Real Simulations Are? Large-scale
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 informationResearch Article Evaluation of the Capability of the Multigrid Method in Speeding Up the Convergence of Iterative Methods
International Scholarly Research Network ISRN Computational Mathematics Volume 212, Article ID 172687, 5 pages doi:1.542/212/172687 Research Article Evaluation of the Capability of the Multigrid Method
More informationEFFICIENT MULTIGRID BASED SOLVERS FOR ISOGEOMETRIC ANALYSIS
6th European Conference on Computational Mechanics (ECCM 6) 7th European Conference on Computational Fluid Dynamics (ECFD 7) 1115 June 2018, Glasgow, UK EFFICIENT MULTIGRID BASED SOLVERS FOR ISOGEOMETRIC
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 informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
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 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 informationPartial Differential Equations
Partial Differential Equations Introduction Deng Li Discretization Methods Chunfang Chen, Danny Thorne, Adam Zornes CS521 Feb.,7, 2006 What do You Stand For? A PDE is a Partial Differential Equation This
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 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 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 informationITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS
ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semi-linear elliptic equations of the form: find
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 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 information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More informationMultigrid Method for 2D Helmholtz Equation using Higher Order Finite Difference Scheme Accelerated by Krylov Subspace
201, TextRoad Publication ISSN: 2090-27 Journal of Applied Environmental and Biological Sciences www.textroad.com Multigrid Method for 2D Helmholtz Equation using Higher Order Finite Difference Scheme
More information6. Iterative Methods: Roots and Optima. Citius, Altius, Fortius!
Citius, Altius, Fortius! Numerisches Programmieren, Hans-Joachim Bungartz page 1 of 1 6.1. Large Sparse Systems of Linear Equations I Relaxation Methods Introduction Systems of linear equations, which
More informationMath 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018
1 Linear Systems Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March, 018 Consider the system 4x y + z = 7 4x 8y + z = 1 x + y + 5z = 15. We then obtain x = 1 4 (7 + y z)
More informationSparse Linear Systems. Iterative Methods for Sparse Linear Systems. Motivation for Studying Sparse Linear Systems. Partial Differential Equations
Sparse Linear Systems Iterative Methods for Sparse Linear Systems Matrix Computations and Applications, Lecture C11 Fredrik Bengzon, Robert Söderlund We consider the problem of solving the linear system
More informationK.S. Kang. The multigrid method for an elliptic problem on a rectangular domain with an internal conductiong structure and an inner empty space
K.S. Kang The multigrid method for an elliptic problem on a rectangular domain with an internal conductiong structure and an inner empty space IPP 5/128 September, 2011 The multigrid method for an elliptic
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 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 2017/18 Part 3: Iterative Methods PD
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 information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationMath 1080: Numerical Linear Algebra Chapter 4, Iterative Methods
Math 1080: Numerical Linear Algebra Chapter 4, Iterative Methods M. M. Sussman sussmanm@math.pitt.edu Office Hours: MW 1:45PM-2:45PM, Thack 622 March 2015 1 / 70 Topics Introduction to Iterative Methods
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationSpace-time Discontinuous Galerkin Methods for Compressible Flows
Space-time Discontinuous Galerkin Methods for Compressible Flows Jaap van der Vegt Numerical Analysis and Computational Mechanics Group Department of Applied Mathematics University of Twente Joint Work
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 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 informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationImage Reconstruction And Poisson s equation
Chapter 1, p. 1/58 Image Reconstruction And Poisson s equation School of Engineering Sciences Parallel s for Large-Scale Problems I Chapter 1, p. 2/58 Outline 1 2 3 4 Chapter 1, p. 3/58 Question What have
More informationSplitting Iteration Methods for Positive Definite Linear Systems
Splitting Iteration Methods for Positive Definite Linear Systems Zhong-Zhi Bai a State Key Lab. of Sci./Engrg. Computing Inst. of Comput. Math. & Sci./Engrg. Computing Academy of Mathematics and 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 informationThe Fundamentals and Advantages of Multi-grid Techniques
Joseph Kovac 18.086 Final Project Spring 2005 Prof. Gilbert Strang The Fundamentals and Advantages of Multi-grid Techniques Introduction The finite difference method represents a highly straightforward
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 informationECE539 - Advanced Theory of Semiconductors and Semiconductor Devices. Numerical Methods and Simulation / Umberto Ravaioli
ECE539 - Advanced Theory of Semiconductors and Semiconductor Devices 1 General concepts Numerical Methods and Simulation / Umberto Ravaioli Introduction to the Numerical Solution of Partial Differential
More informationA Comparison of Solving the Poisson Equation Using Several Numerical Methods in Matlab and Octave on the Cluster maya
A Comparison of Solving the Poisson Equation Using Several Numerical Methods in Matlab and Octave on the Cluster maya Sarah Swatski, Samuel Khuvis, and Matthias K. Gobbert (gobbert@umbc.edu) Department
More informationProcess Model Formulation and Solution, 3E4
Process Model Formulation and Solution, 3E4 Section B: Linear Algebraic Equations Instructor: Kevin Dunn dunnkg@mcmasterca Department of Chemical Engineering Course notes: Dr Benoît Chachuat 06 October
More informationAggregation Algorithms for K-cycle Aggregation Multigrid for Markov Chains
Aggregation Algorithms for K-cycle Aggregation Multigrid for Markov Chains by Manda Winlaw A research paper presented to the University of Waterloo in partial fulfillment of the requirements for the degree
More informationIntroduction. Math 1080: Numerical Linear Algebra Chapter 4, Iterative Methods. Example: First Order Richardson. Strategy
Introduction Math 1080: Numerical Linear Algebra Chapter 4, Iterative Methods M. M. Sussman sussmanm@math.pitt.edu Office Hours: MW 1:45PM-2:45PM, Thack 622 Solve system Ax = b by repeatedly computing
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 informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationSolving linear systems (6 lectures)
Chapter 2 Solving linear systems (6 lectures) 2.1 Solving linear systems: LU factorization (1 lectures) Reference: [Trefethen, Bau III] Lecture 20, 21 How do you solve Ax = b? (2.1.1) In numerical linear
More information