lecture8_v2

# lecture8_v2 - CMPSC/MATH 451 Numerical Computations Lecture...

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

CMPSC/MATH 451 Numerical Computations Lecture 8 September 9, 2011 Prof. Kamesh Madduri

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

View Full Document
Review of last class Transformations Triangular systems Forward substitution Back substitution 2
Gaussian Elimination Covered on blackboard, corresponding slides from textbook follow. Also see additional notes for examples covered in class. 3

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

View Full Document
Existence, Uniqueness, and Conditioning Solving Linear Systems Special Types of Linear Systems Software for Linear Systems Triangular Systems Gaussian Elimination Updating Solutions Improving Accuracy Example: Triangular Linear System 2 4 - 2 0 1 1 0 0 4 x 1 x 2 x 3 = 2 4 8 Using back-substitution for this upper triangular system, last equation, 4 x 3 = 8 , is solved directly to obtain x 3 = 2 Next, x 3 is substituted into second equation to obtain x 2 = 2 Finally, both x 3 and x 2 are substituted into first equation to obtain x 1 = - 1 Michael T. Heath Scientific Computing 33 / 88
Existence, Uniqueness, and Conditioning Solving Linear Systems Special Types of Linear Systems Software for Linear Systems Triangular Systems Gaussian Elimination Updating Solutions Improving Accuracy Elimination To transform general linear system into triangular form, we need to replace selected nonzero entries of matrix by zeros This can be accomplished by taking linear combinations of rows Consider 2-vector a = a 1 a 2 If a 1 6 = 0 , then 1 0 - a 2 /a 1 1 a 1 a 2 = a 1 0 Michael T. Heath Scientific Computing 34 / 88

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

View Full Document
Existence, Uniqueness, and Conditioning Solving Linear Systems Special Types of Linear Systems Software for Linear Systems Triangular Systems Gaussian Elimination Updating Solutions Improving Accuracy Elementary Elimination Matrices More generally, we can annihilate all entries below k th position in n -vector a by transformation M k a = 1 · · · 0 0 · · · 0 . . . . . . . . . . . . . . . . . . 0 · · · 1 0 · · · 0 0 · · · - m k +1 1 · · · 0 . . . . . . . . . . . . . . . . . . 0 · · · - m n 0 · · · 1 a 1 . . . a k a k +1 . . . a n = a 1 .
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern