A Poorly Conditioned System. Matrix Form

Size: px
Start display at page:

Download "A Poorly Conditioned System. Matrix Form"

Transcription

1 Possibilities for Linear Systems of Equations A Poorly Conditioned System A Poorly Conditioned System Results No solution (inconsistent) Unique solution (consistent) Infinite number of solutions (consistent) Graphical interpretation Equations determine lines, planes, hyperplanes Parallel inconsistent Single point intersection unique solution Congruence infinite number of solutions y solution y x solution y = m 2 x + b 2 y = m 1 x + b 1 Slopes m 1 m 2 x Previous solution y Large change in the solution for a small change of m 2 y = m 2 x + b 2 New solution y = m 1 x + b 1 x Example of Solving a System of Equations Matrix Form Strategy: Use Row Operations to Convert This: x x 2 = x x x 2 = x 3-9

2 To This: Which is the Same as: Row Operations x 1 x sol x 2 = x sol x 3 x sol3 Identity matrix x 1 = x sol1 x 2 = x sol2 x 3 = x sol3 Interchange two rows. Multiply all entries in a row by a nonzero constant. Replace a row by the sum of itself and a multiple of another row. Start With the Augmented Matrix: Original System and Augmented Matrix Side by Side, Ready for Row Operations Step 1: Add 4 Times Equation 1 to Equation 3, And Write This in Place of Equation 3 4 4x 1-8x 2 + 4x 3 =

3 This Yields: Step 2: Multiply Equation 2 by 1/2, Yielding: Step 3: Add 3 Times Equation 2 to Equation 3, And Write This in Place of Equation 3 x 2-4x 3 = x 2-4x 3 = Triangular form At this point, we have successfully solved for x 3. Step 4: Add 4 Times Equation 3 to Equation 2, And Write This in Place of Equation 2 Step 5: Subtract Equation 3 from Equation 1, And Write This in Place of Equation 1 Step 6: Add 2 Times Equation 2 to Equation 1 And Write This in Place of Equation 1 x 1-2x 2 = x 1 = At this point, we have successfully solved for x 2 and x 3. At this point, we have successfully solved for x 1, x 2, and x 3.

4 This Procedure Can be Formalized with the Following Definitions General Echelon Form of a Matrix apple * * * * * * * General Reduced Echelon Form of a Matrix 1 * 0 0 * * 0 * Matrix echelon form Matrix reduced echelon form Pivots 0 0 apple * * * * * apple * * * * apple * Here, the leading entries apple may have any nonzero value, and the * entries may have any values (including zero) * * 0 * * * 0 * * Here, the leading entries are 1 s, and the * entries may have any values (including zero). Note that there are 0 s below and above each leading 1. Uniqueness of the Reduced Echelon Form Using different sequences of row operations, any nonzero matrix can be transformed into more than one matrix in echelon form. However, the reduced echelon form that we obtain from a matrix can be proven to be unique. Pivot Positions apple apple * * * * * * * 0 0 apple * * * * * apple * * * * apple * Pivots apple are used in subsequent row operations to create above and below them in the process of transforming the matrix to the reduced echelon form. General Steps for Solving Systems by Row Reduction Step 1. Begin with the leftmost non-zero column. The required position is at the top. Step 2. Select a non-zero entry in this column as a. If necessary, interchange rows to move this entry into the position at the top of the column. Step 3. Use row operations to create in all column positions below the.

5 General Steps for Solving Systems by Row Reduction (continued) Step 4. Cover the s row and return to Step 1 for the sub-matrix that remains. Repeat as needed. Step 5. Beginning with the rightmost and working upward and to the left, use row operations to create in all column positions above each. Use scaling operations to make each equal to 1. What If the Reduced Echelon Form Looks Like: s x 1-5x 3 = 1 x 2 + x 3 = 4 0x 3 = Variables x 1 and x 2 corresponding to the columns are called basic variables; the rest (in this case x 3 ) are called free variables. We are free to choose any value of x Then, We Do Not Have a Unique Solution: x 1 = 1 + 5x 3 x 2 = 4 - x 3 x 3 = free We say that this system is a parametric description of a solution set in which the variable x 3 acts as a free parameter. In this and similar cases, there exists an infinity of solutions. What If the Reduced Echelon Form Looks Like: x 1-5x 3 = 1 x 2 + x 3 = 4 0x 3 = 2? This system has a built-in contradiction. There is no value ofx 3 that can satisfy the third equation. The original system has no solution, i.e., is inconsistent. 173

Linear Equations in Linear Algebra

Linear Equations in Linear Algebra 1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero

More information

3. Replace any row by the sum of that row and a constant multiple of any other row.

3. Replace any row by the sum of that row and a constant multiple of any other row. Math Section. Section.: Solving Systems of Linear Equations Using Matrices As you may recall from College Algebra or Section., you can solve a system of linear equations in two variables easily by applying

More information

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the

More information

For example, the system. 22 may be represented by the augmented matrix

For example, the system. 22 may be represented by the augmented matrix Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural of matrix) may be

More information

Solving Systems of Equations Using Matrices With the TI-83 or TI-84

Solving Systems of Equations Using Matrices With the TI-83 or TI-84 Solving Systems of Equations Using Matrices With the TI-83 or TI-84 Dimensions of a matrix: The dimensions of a matrix are the number of rows by the number of columns in the matrix. rows x columns *rows

More information

2. Use elementary row operations to rewrite the augmented matrix in a simpler form (i.e., one whose solutions are easy to find).

2. Use elementary row operations to rewrite the augmented matrix in a simpler form (i.e., one whose solutions are easy to find). Section. Gaussian Elimination Our main focus in this section is on a detailed discussion of a method for solving systems of equations. In the last section, we saw that the general procedure for solving

More information

Solving Systems Using Row Operations 1 Name

Solving Systems Using Row Operations 1 Name The three usual methods of solving a system of equations are graphing, elimination, and substitution. While these methods are excellent, they can be difficult to use when dealing with three or more variables.

More information

10/26/ Solving Systems of Linear Equations Using Matrices. Objectives. Matrices

10/26/ Solving Systems of Linear Equations Using Matrices. Objectives. Matrices 6.1 Solving Systems of Linear Equations Using Matrices Objectives Write the augmented matrix for a linear system. Perform matrix row operations. Use matrices and Gaussian elimination to solve systems.

More information

Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer:

Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer: Understand the relationships between statements that are equivalent to the invertibility of a square matrix (Theorem 1.5.3). Use the inversion algorithm to find the inverse of an invertible matrix. Express

More information

CHAPTER 5 SYSTEMS OF EQUATIONS. x y

CHAPTER 5 SYSTEMS OF EQUATIONS. x y page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [

More information

Section 3.1 Gaussian Elimination Method (GEM) Key terms

Section 3.1 Gaussian Elimination Method (GEM) Key terms Section 3.1 Gaussian Elimination Method (GEM) Key terms Rectangular systems Consistent system & Inconsistent systems Rank Types of solution sets RREF Upper triangular form & back substitution Nonsingular

More information

6.3 Notes O Brien F15

6.3 Notes O Brien F15 CA th ed HL. Notes O Brien F. Solution of Linear Systems by ow Transformations I. Introduction II. In this section we will solve systems of first degree equations which have two or more variables. We will

More information

CS6015 / LARP ACK : Linear Algebra and Its Applications - Gilbert Strang

CS6015 / LARP ACK : Linear Algebra and Its Applications - Gilbert Strang Solving and CS6015 / LARP 2018 ACK : Linear Algebra and Its Applications - Gilbert Strang Introduction Chapter 1 concentrated on square invertible matrices. There was one solution to Ax = b and it was

More information

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011 Rice University, Summer 20 Math 355: Linear Algebra: Midterm Colin Carroll June 25, 20 I have adhered to the Rice honor code in completing this test. Signature: Name: Date: Time: Please read the following

More information

Systems of Linear Equations

Systems of Linear Equations Sstems of Linear Equations Gaussian Elimination Tpes of Solutions A linear equation is an equation that can be written in the form: a a a n n b The coefficients a i and the constant b can be real or comple

More information

MATH 2000 Gauss-Jordan Elimination and the TI-83 [Underlined bold terms are defined in the glossary]

MATH 2000 Gauss-Jordan Elimination and the TI-83 [Underlined bold terms are defined in the glossary] x y z 0 0 3 4 5 MATH 000 Gauss-Jordan Elimination and the TI-3 [Underlined bold terms are defined in the glossary] 3z = A linear system such as x + 4y z = x + 5y z = can be solved algebraically using ordinary

More information

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang Maths for Signals and Systems Linear Algebra in Engineering Some problems by Gilbert Strang Problems. Consider u, v, w to be non-zero vectors in R 7. These vectors span a vector space. What are the possible

More information

EXTENSION. a 1 b 1 c 1 d 1. Rows l a 2 b 2 c 2 d 2. a 3 x b 3 y c 3 z d 3. This system can be written in an abbreviated form as

EXTENSION. a 1 b 1 c 1 d 1. Rows l a 2 b 2 c 2 d 2. a 3 x b 3 y c 3 z d 3. This system can be written in an abbreviated form as EXTENSION Using Matrix Row Operations to Solve Systems The elimination method used to solve systems introduced in the previous section can be streamlined into a systematic method by using matrices (singular:

More information

Put the following equations to slope-intercept form then use 2 points to graph

Put the following equations to slope-intercept form then use 2 points to graph Tuesday September 23, 2014 Warm-up: Put the following equations to slope-intercept form then use 2 points to graph 1. 4x - 3y = 8 8 x 6y = 16 2. 2x + y = 4 2x + y = 1 Tuesday September 23, 2014 Warm-up:

More information

Review for Mastery Using Graphs and Tables to Solve Linear Systems

Review for Mastery Using Graphs and Tables to Solve Linear Systems 3-1 Using Graphs and Tables to Solve Linear Systems A linear system of equations is a set of two or more linear equations. To solve a linear system, find all the ordered pairs (x, y) that make both equations

More information

WEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)

WEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1) WEEK 4 REVIEW Graphing Systems of Linear Inequalities (3.1) Linear Programming Problems (3.2) Checklist for Exam 1 Review Sample Exam 1 Graphing Linear Inequalities Graph the following system of inequalities.

More information

February 01, Matrix Row Operations 2016 ink.notebook. 6.6 Matrix Row Operations. Page 49 Page Row operations

February 01, Matrix Row Operations 2016 ink.notebook. 6.6 Matrix Row Operations. Page 49 Page Row operations 6.6 Matrix Row Operations 2016 ink.notebook Page 49 Page 50 6.6 Row operations (Solve Systems with Matrices) Lesson Objectives Page 51 Standards Lesson Notes Page 52 6.6 Matrix Row Operations Press the

More information

Answers to practice questions for Midterm 1

Answers to practice questions for Midterm 1 Answers to practice questions for Midterm Paul Hacking /5/9 (a The RREF (reduced row echelon form of the augmented matrix is So the system of linear equations has exactly one solution given by x =, y =,

More information

Solutions for Operations Research Final Exam

Solutions for Operations Research Final Exam Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem

More information

Practice Test - Chapter 6

Practice Test - Chapter 6 1. Write each system of equations in triangular form using Gaussian elimination. Then solve the system. Align the variables on the left side of the equal sign. Eliminate the x-term from the 2nd equation.

More information

Date Lesson TOPIC Homework. The Intersection of a Line with a Plane and the Intersection of Two Lines

Date Lesson TOPIC Homework. The Intersection of a Line with a Plane and the Intersection of Two Lines UNIT 4 - RELATIONSHIPS BETWEEN LINES AND PLANES Date Lesson TOPIC Homework Oct. 4. 9. The Intersection of a Line with a Plane and the Intersection of Two Lines Pg. 496 # (4, 5)b, 7, 8b, 9bd, Oct. 6 4.

More information

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions

More information

Column and row space of a matrix

Column and row space of a matrix Column and row space of a matrix Recall that we can consider matrices as concatenation of rows or columns. c c 2 c 3 A = r r 2 r 3 a a 2 a 3 a 2 a 22 a 23 a 3 a 32 a 33 The space spanned by columns of

More information

x = 12 x = 12 1x = 16

x = 12 x = 12 1x = 16 2.2 - The Inverse of a Matrix We've seen how to add matrices, multiply them by scalars, subtract them, and multiply one matrix by another. The question naturally arises: Can we divide one matrix by another?

More information

Use the graph shown to determine whether each system is consistent or inconsistent and if it is independent or dependent.

Use the graph shown to determine whether each system is consistent or inconsistent and if it is independent or dependent. Use the graph shown to determine whether each system is consistent or inconsistent and if it is independent or dependent. 12. y = 3x + 4 y = 3x 4 These two equations do not intersect, so they are inconsistent.

More information

Precalculus Notes: Unit 7 Systems of Equations and Matrices

Precalculus Notes: Unit 7 Systems of Equations and Matrices Date: 7.1, 7. Solving Systems of Equations: Graphing, Substitution, Elimination Syllabus Objectives: 8.1 The student will solve a given system of equations or system of inequalities. Solution of a System

More information

January 24, Matrix Row Operations 2017 ink.notebook. 6.6 Matrix Row Operations. Page 35 Page Row operations

January 24, Matrix Row Operations 2017 ink.notebook. 6.6 Matrix Row Operations. Page 35 Page Row operations 6.6 Matrix Row Operations 2017 ink.notebook Page 35 Page 36 6.6 Row operations (Solve Systems with Matrices) Lesson Objectives Page 37 Standards Lesson Notes Page 38 6.6 Matrix Row Operations Press the

More information

hp calculators hp 39g+ & hp 39g/40g Using Matrices How are matrices stored? How do I solve a system of equations? Quick and easy roots of a polynomial

hp calculators hp 39g+ & hp 39g/40g Using Matrices How are matrices stored? How do I solve a system of equations? Quick and easy roots of a polynomial hp calculators hp 39g+ Using Matrices Using Matrices The purpose of this section of the tutorial is to cover the essentials of matrix manipulation, particularly in solving simultaneous equations. How are

More information

Linear programming II João Carlos Lourenço

Linear programming II João Carlos Lourenço Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,

More information

Now, start over with a smarter method. But it is still heavily relied on the power of matlab. But we can see the pattern of the matrix elements.

Now, start over with a smarter method. But it is still heavily relied on the power of matlab. But we can see the pattern of the matrix elements. Instructions for starting on Project 5. Warning: many of the instructions are not that smart or efficient. It is part of a learning process. Start by introducing some data points for x and for y: octave:>

More information

LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION. 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach

LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION. 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach Basic approaches I. Primal Approach - Feasible Direction

More information

Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Optimization of Design. Lecturer:Dung-An Wang Lecture 8 Optimization of Design Lecturer:Dung-An Wang Lecture 8 Lecture outline Reading: Ch8 of text Today s lecture 2 8.1 LINEAR FUNCTIONS Cost Function Constraints 3 8.2 The standard LP problem Only equality

More information

Fifth Grade Math Rubric

Fifth Grade Math Rubric Operations and Algebraic Thinking Support Needed Progressing Meets Writes, solves, and interprets numerical expressions guidance with and/or inconsistently writes, solves, and interprets numerical expressions.

More information

Question 2: How do you solve a linear programming problem with a graph?

Question 2: How do you solve a linear programming problem with a graph? Question : How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.

More information

Instructor: Barry McQuarrie Page 1 of 6

Instructor: Barry McQuarrie Page 1 of 6 Questions 1. Solve the system by graphing: 3x + y = 2 2x y = 3 2. Solve the system by graphing: x + 3y = 9 y = 1 3 x 2 3. Solve the system by graphing: y = 2x + 5 3y + 6x = 15 4. Solve the system algebraically,

More information

3.1 Solving Systems Using Tables and Graphs

3.1 Solving Systems Using Tables and Graphs Algebra 2 Chapter 3: Systems of Equations Mrs. Leahy 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system of equations

More information

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

More information

Computational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science

Computational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science Computational Methods CMSC/AMSC/MAPL 460 Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science Zero elements of first column below 1 st row multiplying 1 st

More information

Problem 2. Problem 3. Perform, if possible, each matrix-vector multiplication. Answer. 3. Not defined. Solve this matrix equation.

Problem 2. Problem 3. Perform, if possible, each matrix-vector multiplication. Answer. 3. Not defined. Solve this matrix equation. Problem 2 Perform, if possible, each matrix-vector multiplication. 1. 2. 3. 1. 2. 3. Not defined. Problem 3 Solve this matrix equation. Matrix-vector multiplication gives rise to a linear system. Gaussian

More information

Example: A Four-Node Network

Example: A Four-Node Network Node Network Flows Flow of material, energy, money, information, etc., from one place to another arc 6 Node Node arc 6 Node Node 5 Node 6 8 Goal: Ship All of the Over the Network to Meet All of the 6 6

More information

The Three Dimensional Coordinate System

The Three Dimensional Coordinate System The Three-Dimensional Coordinate System The Three Dimensional Coordinate System You can construct a three-dimensional coordinate system by passing a z-axis perpendicular to both the x- and y-axes at the

More information

Basic Matrix Manipulation with a TI-89/TI-92/Voyage 200

Basic Matrix Manipulation with a TI-89/TI-92/Voyage 200 Basic Matrix Manipulation with a TI-89/TI-92/Voyage 200 Often, a matrix may be too large or too complex to manipulate by hand. For these types of matrices, we can employ the help of graphing calculators

More information

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1 Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1

More information

SECTION 1.3: BASIC GRAPHS and SYMMETRY

SECTION 1.3: BASIC GRAPHS and SYMMETRY (Section.3: Basic Graphs and Symmetry).3. SECTION.3: BASIC GRAPHS and SYMMETRY LEARNING OBJECTIVES Know how to graph basic functions. Organize categories of basic graphs and recognize common properties,

More information

CHAPTER HERE S WHERE YOU LL FIND THESE APPLICATIONS:

CHAPTER HERE S WHERE YOU LL FIND THESE APPLICATIONS: CHAPTER 8 You are being drawn deeper into cyberspace, spending more time online each week. With constantly improving high-resolution images, cyberspace is reshaping your life by nourishing shared enthusiasms.

More information

Section 1.5. Finding Linear Equations

Section 1.5. Finding Linear Equations Section 1.5 Finding Linear Equations Using Slope and a Point to Find an Equation of a Line Example Find an equation of a line that has slope m = 3 and contains the point (2, 5). Solution Substitute m =

More information

Independent systems consist of x

Independent systems consist of x 5.1 Simultaneous Linear Equations In consistent equations, *Find the solution to each system by graphing. 1. y Independent systems consist of x Three Cases: A. consistent and independent 2. y B. inconsistent

More information

Announcements Wednesday, August 23

Announcements Wednesday, August 23 Announcements Wednesday, August 23 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/teaching/f2017/m1553/index.html or on the website for this section:

More information

,!7IA3C1-cjfcei!:t;K;k;K;k ISBN Graphing Calculator Reference Card. Addison-Wesley s. Basics. Created in conjuction with

,!7IA3C1-cjfcei!:t;K;k;K;k ISBN Graphing Calculator Reference Card. Addison-Wesley s. Basics. Created in conjuction with Addison-Wesley s Graphing Calculator Reference Card Created in conjuction with Basics Converting Fractions to Decimals The calculator will automatically convert a fraction to a decimal. Type in a fraction,

More information

0_PreCNotes17 18.notebook May 16, Chapter 12

0_PreCNotes17 18.notebook May 16, Chapter 12 Chapter 12 Notes BASIC MATRIX OPERATIONS Matrix (plural: Matrices) an n x m array of elements element a ij Example 1 a 21 = a 13 = Multiply Matrix by a Scalar Distribute scalar to all elements Addition

More information

MAT 3271: Selected Solutions to the Assignment 6

MAT 3271: Selected Solutions to the Assignment 6 Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically

More information

Suggested problems - solutions

Suggested problems - solutions Suggested problems - solutions Writing equations of lines and planes Some of these are similar to ones you have examples for... most of them aren t. P1: Write the general form of the equation of the plane

More information

Announcements Wednesday, August 23

Announcements Wednesday, August 23 Announcements Wednesday, August 23 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/teaching/f2017/m1553/index.html or on the website for this section:

More information

MITOCW ocw f99-lec07_300k

MITOCW ocw f99-lec07_300k MITOCW ocw-18.06-f99-lec07_300k OK, here's linear algebra lecture seven. I've been talking about vector spaces and specially the null space of a matrix and the column space of a matrix. What's in those

More information

Announcements Wednesday, August 22

Announcements Wednesday, August 22 Announcements Wednesday, August 22 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/18f/m1553/webpage/ or on the website for this section: http://people.math.gatech.edu/~jrabinoff/1819f-1553/

More information

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit.

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit. Math 2B Linear Algebra Test 2 S3 Name Write all responses on separate paper. Show your work for credit.. Construct a matrix whose a. null space consists of all combinations of (,3,3,) and (,2,,). b. Left

More information

MAT 103 F09 TEST 3 REVIEW (CH 4-5)

MAT 103 F09 TEST 3 REVIEW (CH 4-5) MAT 103 F09 TEST 3 REVIEW (CH 4-5) NAME For # 1-3, solve the system of equations by graphing. Label the equation of each line on your graph and write the solution as an ordered pair. Be sure to CHECK your

More information

CS-9645 Introduction to Computer Vision Techniques Winter 2019

CS-9645 Introduction to Computer Vision Techniques Winter 2019 Table of Contents Projective Geometry... 1 Definitions...1 Axioms of Projective Geometry... Ideal Points...3 Geometric Interpretation... 3 Fundamental Transformations of Projective Geometry... 4 The D

More information

Matrices and Determinants

Matrices and Determinants pr8-78-88.i-hr /6/6 : PM Page 78 CHAPTER 8 Matrices and Determinants J ARON LANIER, WHO FIRST USED the term virtual reality, is chief scientist for the teleimmersion project, which explores the impact

More information

Finite Math - J-term Homework. Section Inverse of a Square Matrix

Finite Math - J-term Homework. Section Inverse of a Square Matrix Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse

More information

Matrices and Systems of Linear Equations

Matrices and Systems of Linear Equations Chapter The variable x has now been eliminated from the first and third equations. Next, we eliminate x3 from the first and second equations and leave x3, with coefficient, in the third equation: System:

More information

7.6 Solve Linear Systems of

7.6 Solve Linear Systems of 7.6 Solve Linear Sstems of Linear Inequalities Goal p Solve sstems of linear inequalities in two variables. Your Notes VOCABULARY Sstem of linear inequalities Solution of a sstem of linear inequalities

More information

MATRIX REVIEW PROBLEMS: Our matrix test will be on Friday May 23rd. Here are some problems to help you review.

MATRIX REVIEW PROBLEMS: Our matrix test will be on Friday May 23rd. Here are some problems to help you review. MATRIX REVIEW PROBLEMS: Our matrix test will be on Friday May 23rd. Here are some problems to help you review. 1. The intersection of two non-parallel planes is a line. Find the equation of the line. Give

More information

Systems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses

Systems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses 5 5 Systems and Matrices Systems and Matrices 5.6 Systems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses Sections 5.6 5.8 2008 Pearson Addison-Wesley. All rights

More information

Numerical Methods 5633

Numerical Methods 5633 Numerical Methods 5633 Lecture 7 Marina Krstic Marinkovic mmarina@maths.tcd.ie School of Mathematics Trinity College Dublin Marina Krstic Marinkovic 1 / 10 5633-Numerical Methods Organisational To appear

More information

Algebraic Iterative Methods for Computed Tomography

Algebraic Iterative Methods for Computed Tomography Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic

More information

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a

More information

Math 1B03/1ZC3 - Tutorial 3. Jan. 24th/28th, 2014

Math 1B03/1ZC3 - Tutorial 3. Jan. 24th/28th, 2014 Math 1B03/1ZC3 - Tutorial 3 Jan. 24th/28th, 2014 Tutorial Info: Website: http://ms.mcmaster.ca/ dedieula. Math Help Centre: Wednesdays 2:30-5:30pm. Email: dedieula@math.mcmaster.ca. Elementary Matrices

More information

Matrices and Systems of Equations

Matrices and Systems of Equations 1 CA-Fall 2011-Jordan College Algebra, 4 th edition, Beecher/Penna/Bittinger, Pearson/Addison Wesley, 2012 Chapter 6: Systems of Equations and Matrices Section 6.3 Matrices and Systems of Equations Matrices

More information

7.3 3-D Notes Honors Precalculus Date: Adapted from 11.1 & 11.4

7.3 3-D Notes Honors Precalculus Date: Adapted from 11.1 & 11.4 73 3-D Notes Honors Precalculus Date: Adapted from 111 & 114 The Three-Variable Coordinate System I Cartesian Plane The familiar xy-coordinate system is used to represent pairs of numbers (ordered pairs

More information

Objectives and Homework List

Objectives and Homework List MAC 1140 Objectives and Homework List Each objective covered in MAC1140 is listed below. Along with each objective is the homework list used with MyMathLab (MML) and a list to use with the text (if you

More information

Simultaneous equations 11 Row echelon form

Simultaneous equations 11 Row echelon form 1 Simultaneous equations 11 Row echelon form J A Rossiter For a neat organisation of all videos and resources http://controleducation.group.shef.ac.uk/indexwebbook.html Introduction 2 The previous videos

More information

Lesson 15. Student Outcomes. Lesson Notes. Classwork. Opening (2 minutes) Opening Exercise (3 minutes) (optional)

Lesson 15. Student Outcomes. Lesson Notes. Classwork. Opening (2 minutes) Opening Exercise (3 minutes) (optional) Lesson 5 Lesson 5: Piecewise Functions Student Outcomes Students examine the features of piecewise functions including the absolute value function and step functions. Students understand that the graph

More information

Addition/Subtraction flops. ... k k + 1, n (n k)(n k) (n k)(n + 1 k) n 1 n, n (1)(1) (1)(2)

Addition/Subtraction flops. ... k k + 1, n (n k)(n k) (n k)(n + 1 k) n 1 n, n (1)(1) (1)(2) 1 CHAPTER 10 101 The flop counts for LU decomposition can be determined in a similar fashion as was done for Gauss elimination The major difference is that the elimination is only implemented for the left-hand

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for

More information

Dense Matrix Algorithms

Dense Matrix Algorithms Dense Matrix Algorithms Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar To accompany the text Introduction to Parallel Computing, Addison Wesley, 2003. Topic Overview Matrix-Vector Multiplication

More information

8.NS.1 8.NS.2. 8.EE.7.a 8.EE.4 8.EE.5 8.EE.6

8.NS.1 8.NS.2. 8.EE.7.a 8.EE.4 8.EE.5 8.EE.6 Standard 8.NS.1 8.NS.2 8.EE.1 8.EE.2 8.EE.3 8.EE.4 8.EE.5 8.EE.6 8.EE.7 8.EE.7.a Jackson County Core Curriculum Collaborative (JC4) 8th Grade Math Learning Targets in Student Friendly Language I can identify

More information

13.4 Case Study: vector<t>-based Matrices

13.4 Case Study: vector<t>-based Matrices 13.4 Case Study: vector-based Matrices 1 13.4 Case Study: vector-based Matrices A two-dimensional numeric array having m rows and n columns is called an m n matrix. There are many important applications

More information

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program Problem: Maximize z = x + 0x subject to x + x 6 x + x 00 with x 0 y 0 I. Setting Up the Problem. Rewrite each

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Math 233 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu

More information

Epipolar Geometry and the Essential Matrix

Epipolar Geometry and the Essential Matrix Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and

More information

An Improved Measurement Placement Algorithm for Network Observability

An Improved Measurement Placement Algorithm for Network Observability IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 819 An Improved Measurement Placement Algorithm for Network Observability Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper

More information

3-8 Solving Systems of Equations Using Inverse Matrices. Determine whether each pair of matrices are inverses of each other. 13.

3-8 Solving Systems of Equations Using Inverse Matrices. Determine whether each pair of matrices are inverses of each other. 13. 13. Determine whether each pair of matrices are inverses of each other. If K and L are inverses, then. Since, they are not inverses. 15. If P and Q are inverses, then. Since, they are not inverses. esolutions

More information

Computer Packet 1 Row Operations + Freemat

Computer Packet 1 Row Operations + Freemat Computer Packet 1 Row Operations + Freemat For this packet, you will use a website to do row operations, and then learn to use a general purpose matrix calculator called FreeMat. To reach the row operations

More information

I will illustrate the concepts using the example below.

I will illustrate the concepts using the example below. Linear Programming Notes More Tutorials at www.littledumbdoctor.com Linear Programming Notes I will illustrate the concepts using the example below. A farmer plants two crops, oats and corn, on 100 acres.

More information

Parallel Implementations of Gaussian Elimination

Parallel Implementations of Gaussian Elimination s of Western Michigan University vasilije.perovic@wmich.edu January 27, 2012 CS 6260: in Parallel Linear systems of equations General form of a linear system of equations is given by a 11 x 1 + + a 1n

More information

Module 1 Session 1 HS. Critical Areas for Traditional Geometry Page 1 of 6

Module 1 Session 1 HS. Critical Areas for Traditional Geometry Page 1 of 6 Critical Areas for Traditional Geometry Page 1 of 6 There are six critical areas (units) for Traditional Geometry: Critical Area 1: Congruence, Proof, and Constructions In previous grades, students were

More information

Computer Graphics: Geometric Transformations

Computer Graphics: Geometric Transformations Computer Graphics: Geometric Transformations Geometric 2D transformations By: A. H. Abdul Hafez Abdul.hafez@hku.edu.tr, 1 Outlines 1. Basic 2D transformations 2. Matrix Representation of 2D transformations

More information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module 03 Simplex Algorithm Lecture - 03 Tabular form (Minimization) In this

More information

3.1 INTRODUCTION TO THE FAMILY OF QUADRATIC FUNCTIONS

3.1 INTRODUCTION TO THE FAMILY OF QUADRATIC FUNCTIONS 3.1 INTRODUCTION TO THE FAMILY OF QUADRATIC FUNCTIONS Finding the Zeros of a Quadratic Function Examples 1 and and more Find the zeros of f(x) = x x 6. Solution by Factoring f(x) = x x 6 = (x 3)(x + )

More information

Line Arrangements. Applications

Line Arrangements. Applications Computational Geometry Chapter 9 Line Arrangements 1 Line Arrangements Applications On the Agenda 2 1 Complexity of a Line Arrangement Given a set L of n lines in the plane, their arrangement A(L) is the

More information

5. In the Cartesian plane, a line runs through the points (5, 6) and (-2, -2). What is the slope of the line?

5. In the Cartesian plane, a line runs through the points (5, 6) and (-2, -2). What is the slope of the line? Slope review Using two points to find the slope In mathematics, the slope of a line is often called m. We can find the slope if we have two points on the line. We'll call the first point and the second

More information

Did You Find a Parking Space?

Did You Find a Parking Space? Lesson.4 Skills Practice Name Date Did You Find a Parking Space? Parallel and Perpendicular Lines on the Coordinate Plane Vocabulary Complete the sentence. 1. The point-slope form of the equation of the

More information

Lecture 9: Linear Programming

Lecture 9: Linear Programming Lecture 9: Linear Programming A common optimization problem involves finding the maximum of a linear function of N variables N Z = a i x i i= 1 (the objective function ) where the x i are all non-negative

More information

Ahigh school curriculum in Algebra 2 contains both solving systems of linear equations,

Ahigh school curriculum in Algebra 2 contains both solving systems of linear equations, The Simplex Method for Systems of Linear Inequalities Todd O. Moyer, Towson University Abstract: This article details the application of the Simplex Method for an Algebra 2 class. Students typically learn

More information