NumericalComputing-Chapter3 - Numerical Computing chapter...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Numerical Computing chapter 3- Iterative methods for Linear Systems Dr. Nguyen V.M. Man Email: [email protected] Faculty of Computer Science and Engineering HCMUT Vietnam April 1, 2010
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
The structure of the chapter ——————————————————————————— I Introduction I Conceptual Foundations I Matrix-Splitting I Iterative methods for Linear Systems
Background image of page 2
Introduction ——————————————————————————— Basic observation : the numerical solutions of difficult nonlinear problems are nearly always traced back to those of linear systems. Secondly, many applications lead to large band matrices in which the bands are sparse; the iterative schemes offer greater efficiency. The idea behind iterative methods for solving a system A u = b ... (1) is: generate a sequence { u ( m ) } m of approximate solution vectors ensuring that they converges to u , the solution of (1).
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Conceptual Foundations ——————————————————————————— Suppose an iterative scheme for A u = b produces a sequence { u ( m ) } of iterates. The aim : determine conditions under which the errors e ( m ) := u ( m ) - u converges to 0 when m goes to . An approach is to associate with the iterative scheme a matrix G that relates errors at successive iterations in the following formula: e ( m + 1) = G e ( m ) = G 2 e ( m - 1) ··· = G m +1 e (0)
Background image of page 4
Conceptual Foundations ——————————————————————————— I A matrix G C n × n is convergent if lim m →∞ G m = 0 I If we could find a matrix G to be convergent, then we are done, since u ( m ) u e ( m ) 0 G m 0 (of course, the initial error e (0) := u (0) - u depending on an initial guess u (0) which must be nonzero) What techniques can be employed?
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Matrix-Splitting Techniques ——————————————————————————— Motivation : one good tactic for solving a linear system A u = b involves splitting A as A = M + ( A - M ) . Put N = M - A then A = M - N , and A u = b ( M - N ) u = b M u = N u + b If the system M z = f is presumably easy to solve, then we write u = M - 1 N u + M - 1 b ⇐⇒ u = M
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 20

NumericalComputing-Chapter3 - Numerical Computing chapter...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online