quiz_04sle_gaussianelimination

quiz_04sle_gaussianelimination - 04.06.1 Multiple-Choice...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 04.06.1 Multiple-Choice Test Chapter 04.06 Gaussian Elimination 1. The goal of forward elimination steps in the Naïve Gauss elimination method is to reduce the coefficient matrix to a (an) _____________ matrix. (A) diagonal (B) identity (C) lower triangular (D) upper triangular 2. Division by zero during forward elimination steps in Naïve Gaussian elimination of the set of equations [ ][ ] [ ] C X A = implies the coefficient matrix [ ] A (A) is invertible (B) is nonsingular (C) may be singular or nonsingular (D) is singular 3. Using a computer with four significant digits with chopping, the Naïve Gauss elimination solution to 23 . 47 123 . 7 239 . 6 12 . 58 23 . 55 0030 . 2 1 2 1 = − = + x x x x is (A) ; 66 . 26 1 = x 051 . 1 2 = x (B) ; 769 . 8 1 = x 051 . 1 2 = x (C) ; 800 . 8 1 = x 000 . 1 2 = x (D) ; 771 . 8 1 = x 052 . 1 2 = x 4. Using a computer with four significant digits with chopping, the Gaussian elimination with partial pivoting solution to 23 . 47 123 . 7 239 . 6 12 .....
View Full Document

Page1 / 3

quiz_04sle_gaussianelimination - 04.06.1 Multiple-Choice...

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

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