This preview shows page 1. Sign up to view the full content.
Unformatted text preview: BMES673 Problem Set #2 Due: Feb 28, 2011
This homework assignment consists of a set of multiplechoice test. You will
have to complete this assignment individually. There are 17 problems, each 6
points (except Problem 15 and 16, each 5 points), totaling 100 points.
1. The goal of forward elimination steps in 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 [A][X]=[C] implies the coefficient matrix [A] is
(A) invertible
(B) nonsingular
(C) not determinable to be singular or nonsingular
(D) singular
3. Using a computer with four significant digits with chopping, Naïve Gauss elimination
solution to
0.0030 x1 + 55.23x2 = 58.12
6.239 x1 − 7.123 x2 = 47.23 is
(A) x1 = 26.66; x2 = 1.051
(B) x1 = 8.769; x2 = 1.051
(C) x1 = 8.800; x2 = 1.000
(D) x1 = 8.771; x2 = 1.052
4. Using a computer with four significant digits with chopping, Gaussian elimination with
partial pivoting solution to
0.0030 x1 + 55.23 x 2 = 58.12 6.239 x1 − 7.123x 2 = 47.23
is
(A) x1 = 26.66; x2 = 1.051
(B) x1 = 8.769; x2 = 1.051
(C) x1 = 8.80...
View
Full
Document
This note was uploaded on 08/30/2011 for the course BUSN 1003 taught by Professor Carr,r during the Spring '08 term at Arkansas State.
 Spring '08
 Carr,R
 Business

Click to edit the document details