The Canonical Form and Null Spaces Lecture III. The Canonical Form ä A canonical form is a solution to an underidentified system of equations. ä For example.

Slides:



Advertisements
Similar presentations
5.4 Basis And Dimension.
Advertisements

Example 1 Matrix Solution of Linear Systems Chapter 7.2 Use matrix row operations to solve the system of equations  2009 PBLPathways.
Gauss Elimination.
Section 4.6 (Rank).
Eigenvalues and Eigenvectors
THE DIMENSION OF A VECTOR SPACE
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Ch 7.8: Repeated Eigenvalues
Matrices. Special Matrices Matrix Addition and Subtraction Example.
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
5.6 Maximization and Minimization with Mixed Problem Constraints
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Lecture 10 Dimensions, Independence, Basis and Complete Solution of Linear Systems Shang-Hua Teng.
ISM 206 Lecture 3 The Simplex Method. Announcements.
Linear Algebra – Linear Equations
Systems of Linear Equations and Row Echelon Form.
Math Dept, Faculty of Applied Science, HCM University of Technology
Math 201 for Management Students
Linear Algebra Lecture 25.
How To Find The Reduced Row Echelon Form. Reduced Row Echelon Form A matrix is said to be in reduced row echelon form provided it satisfies the following.
1 MAC 2103 Module 9 General Vector Spaces II. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Find the coordinate.
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
Vectors in R n a sequence of n real number An ordered n-tuple: the set of all ordered n-tuple  n-space: R n Notes: (1) An n-tuple can be viewed.
Simplex method (algebraic interpretation)
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
Controllability and Observability
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
4.6: Rank. Definition: Let A be an mxn matrix. Then each row of A has n entries and can therefore be associated with a vector in The set of all linear.
Vector Spaces RANK © 2016 Pearson Education, Inc..
10/2 The simplex algorithm. In an augmented matrix, if a column has a 1 and all other entries 0, it is said to be ‘in solution’. The 1 is called a ‘pivot’
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
How To Find The Reduced Row Echelon Form. Reduced Row Echelon Form A matrix is said to be in reduced row echelon form provided it satisfies the following.
Solve a system of linear equations By reducing a matrix Pamela Leutwyler.
Chapter 1 Linear Algebra S 2 Systems of Linear Equations.
Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley A set of equations is called a system of equations. The solution.
3.6 Solving Systems Using Matrices You can use a matrix to represent and solve a system of equations without writing the variables. A matrix is a rectangular.
OR Simplex method (algebraic interpretation) Add slack variables( 여유변수 ) to each constraint to convert them to equations. (We may refer it as.
Systems of Linear Equations in Vector Form Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB.
Arab Open University Faculty of Computer Studies M132: Linear Algebra
Ch 6 Vector Spaces. Vector Space Axioms X,Y,Z elements of  and α, β elements of  Def of vector addition Def of multiplication of scalar and vector These.
Section 1.7 Linear Independence and Nonsingular Matrices
2.5 – Determinants and Multiplicative Inverses of Matrices.
1.1 The row picture of a linear system with 3 variables.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
4.5: The Dimension of a Vector Space. Theorem 9 If a vector space V has a basis, then any set in V containing more than n vectors must be linearly dependent.
4 4.5 © 2016 Pearson Education, Inc. Vector Spaces THE DIMENSION OF A VECTOR SPACE.
Simplex Method Review. Canonical Form A is m x n Theorem 7.5: If an LP has an optimal solution, then at least one such solution exists at a basic feasible.
Chapter 5 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Row Space, Column Space, and Nullspace 6.
Def: A matrix A in reduced-row-echelon form if 1)A is row-echelon form 2)All leading entries = 1 3)A column containing a leading entry 1 has 0’s everywhere.
1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.
Solving Linear Systems
Eigenvalues and Eigenvectors
The Inverse of a Square Matrix
Linear independence and matrix rank
Linear Algebra Lecture 4.
Linear Independence Prepared by Vince Zaccone
4.6: Rank.
Linear Algebra Lecture 37.
Linear Algebra Lecture 3.
Linear Algebra Lecture 21.
Linear Algebra Lecture 24.
Maths for Signals and Systems Linear Algebra in Engineering Lectures 4-5, Tuesday 18th October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN.
Linear Algebra Lecture 20.
LINEAR INDEPENDENCE Definition: An indexed set of vectors {v1, …, vp} in is said to be linearly independent if the vector equation has only the trivial.
Eigenvalues and Eigenvectors
Vector Spaces RANK © 2012 Pearson Education, Inc..
THE DIMENSION OF A VECTOR SPACE
Null Spaces, Column Spaces, and Linear Transformations
NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS
Presentation transcript:

The Canonical Form and Null Spaces Lecture III

The Canonical Form ä A canonical form is a solution to an underidentified system of equations. ä For example in a crop selection model we may have a land and a labor constraint

The Canonical Form ä The matrix operations used to reduce this matrix to a row reduced form are

The Canonical Form ä This representation is a canonical form representing a solution to the system of equations. Specifically, x 1 =50, x 2 =50, x 3 =0, x 4 =0, x 5 =0 solves the system of equations. ä In addition, the solution says something about maintaining feasibility in the nonbasic variables.

The Canonical Form ä Taking the columns from the nonbasic, or zero- level, variables we can form a homogeneous set of equations (Ax=0): This system has the reduced form

The Null Space ä A technical definition of the null space is the set of solutions of the linear equations Ax=0. However, a fuller understanding of the null space involves a discussion of dimension. ä We assume a system of linear equations:

The Null Space ä In order to “solve” this system (assuming that the rows of A are linearly independent) we know that we must have at least m nonzero variables in the canonical form. ä The null space of the matrix A is the same diminsion as the number of free variables. Taking the first three variables from the above example

The Null Space ä Notice that any change

The Null Space  For example, if  x 3 =10  x 1 =-20 and  x 2 =10 ä The null space is basically a line in 3 space which shows how the variables can be traded to maintain feasibility.

The Null Space ä Expanding to the first four variables of the original model yields a reduced form

The Null Space ä Again we note that In this case, the null space is a plane in 4 space. If  x 3 =1 and  x 4 =5