This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 3: Chapter 2, Sections 4, 5 [**UPDATE**] Due Monday, Feb 7 2 Section 2.4: Row Reduction (Monday) 2.5: Gaussian Elimination (moved to Friday) 2.6 Inverses (moved to next week) Linear Systems If A is an m × n matrix with entries a i,j , vectorx is the ncolumn vector with entries x 1 ,...x n , and vector b is the mcolumn vector with entries b 1 ,...b m , the matrix equation Avectorx = vector b gives m equations, each of the form ( i th row of A ) · vectorx = b i , which is called a linear system of m equations in n variables. In the equation Avectorx = vector b, the matrix A is called the coefficient matrix of the system, and vectorx and vector b are called the vector of unknowns and the righthand side vector, respectively. 4 Our preliminary qualitative description of the solutions of these systems (in 2space and 3space) suggests three cases: (1) just one unique solution; (2) no solutions; or (3) infinitely many solns. We say that the system of equations is consistent if there is at least one solution; and inconsistent if there are no solutions. Two systems with the same solutions are called equivalent....
View
Full
Document
This note was uploaded on 11/24/2011 for the course MATH 205 taught by Professor Zhang during the Spring '08 term at Lehigh University .
 Spring '08
 zhang
 Gaussian Elimination, Linear Systems

Click to edit the document details