quiz_04sle_ludecomposition

# quiz_04sle_ludecomposition - Multiple-Choice Test Chapter...

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

Multiple-Choice Test Chapter 04.07 LU Decomposition Method 1. The [ ][ ] U L decomposition method is computationally more efficient than Naïve Gauss elimination for solving (A) a single set of simultaneous linear equations. (B) multiple sets of simultaneous linear equations with different coefficient matrices and the same right hand side vectors. (C) multiple sets of simultaneous linear equations with the same coefficient matrix and different right hand side vectors. (D) less than ten simultaneous linear equations. 2. The lower triangular matrix [ ] L in the [ ][ ] U L decomposition of the matrix given below = 33 23 22 13 12 11 32 31 21 0 0 0 1 0 1 0 0 1 22 12 8 16 8 10 4 5 25 u u u u u u is (A) 1 7333 . 1 32000 . 0 0 1 40000 . 0 0 0 1 (B) 2400 . 4 0 0 400 . 14 6 0 4 5 25 (C) 0 12 8 0 1 10 0 0 1 (D) 1 5000 . 1 32000 . 0 0 1

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

quiz_04sle_ludecomposition - Multiple-Choice Test Chapter...

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

View Full Document
Ask a homework question - tutors are online