engg2013 unit 15 rank determinant dimension and the links between them
Download
Skip this Video
Download Presentation
ENGG2013 Unit 15 Rank, determinant, dimension, and the links between them

Loading in 2 Seconds...

play fullscreen
1 / 31

ENGG2013 Unit 15 Rank, determinant, dimension, and the links between them - PowerPoint PPT Presentation


  • 109 Views
  • Uploaded on

ENGG2013 Unit 15 Rank, determinant, dimension, and the links between them. Mar, 2011. Review on “rank”. “row-rank of a matrix” counts the max. number of linearly independent rows. “column-rank of a matrix” counts the max. number of linearly independent columns.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' ENGG2013 Unit 15 Rank, determinant, dimension, and the links between them' - palmer-graves


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
review on rank
Review on “rank”
  • “row-rank of a matrix” counts the max. number of linearly independent rows.
  • “column-rank of a matrix” counts the max. number of linearly independent columns.
  • One application: Given a large system of linear equations, count the number of essentially different equations.
    • The number of essentially different equations is just the row-rank of the augmented matrix.

ENGG2013

evaluating the row rank by definition
Evaluating the row-rank by definition

Linearly independent

Linearly independent

Linearly independent

Linearly dependent

Linearly independent

Linearly independent

Linearly dependent

 Row-Rank = 2

ENGG2013

calculation of row rank via rref
Calculation of row-rank via RREF

Row reductions

Row-rank = 2

Row-rank = 2

Because row reductionsdo not affect the numberof linearly independent rows

ENGG2013

calculation of column rank by definition
Calculation of column-rank by definition

List all combinationsof columns

 Column-Rank = 2

Linearly independent??

Y

Y

Y

Y

Y

Y

Y

Y

Y

Y

N

N

N

N

N

ENGG2013

theorem
Theorem

Given any matrix, its row-rank and column-rank are equal.

In view of this property, we can just say the “rank of a matrix”. It means either the row-rank of column-rank.

ENGG2013

why row rank column rank
Why row-rank = column-rank?
  • If some column vectors are linearly dependent, they remain linearly dependent after any elementary row operation
  • For example, are linearly dependent

ENGG2013

why row rank column rank1
Why row-rank = column-rank?
  • Any row operation does not change the column- rank.
  • By the same argument, apply to the transpose of the matrix, we conclude that any column operation does not change the row-rank as well.

ENGG2013

why row rank column rank2
Why row-rank = column-rank?

Apply row reductions.row-rank and column-rankdo not change.

Apply column reductions.row-rank and column-rankdo not change.

The top-left corner isan identity matrix.

The row-rank and column-rank of this “normal form” is certainlythe size of this identity submatrix,

and are therefore equal.

ENGG2013

discriminant of a quadratic equation
Discriminant of a quadratic equation
  • y = ax2+bx+c
  • Discirminant of ax2+bx+c = b2-4ac.
  • It determines whether the roots are distinct or not

y

x

ENGG2013

discriminant measures the separation of roots
Discriminant measures the separation of roots
  • y = x2+bx+c. Let the roots be  and .
  • y = (x – )(x – ). Discriminant = ( – )2.
  • Discriminant is zero means that the two roots coincide.

y

( – )2

x

ENGG2013

discriminant is invariant under translation
Discriminant is invariant under translation
  • If we substitute u= x – t into y = ax2+bx+c, (t is any real constant), then the discriminant of a(u+t)2+b(u+t)+c, as a polynomial in u, is the same as before.

y

( – )2

u

ENGG2013

determinant of a square matrix
Determinant of a square matrix
  • The determinant of a square matrix determine whether the matrix is invertible or not.
    • Zero determinant: not invertible
    • Non-zero determinant: invertible.

ENGG2013

determinant measure the area
Determinant measure the area
  • 22 determinant measures the area of a parallelogram.
  • 33 determinant measures the volume of a parallelopiped.
  • nn determinant measures the “volume” of some “parallelogram” in n-dimension.
  • Determinant is zero means that the columns vectors lie in some lower-dimensional space.

ENGG2013

determinant is invariant under shearing action
Determinant is invariant under shearing action
  • Shearing action = third kind of elementary row or column operation

ENGG2013

rank of a rectangular matrix
Rank of a rectangular matrix
  • The rank of a matrix counts the maximal number of linearly independent rows.
  • It also counts the maximal number of linearly independent columns.
  • It is an integer.
  • If the matrix is mn, then the rank is an integer between 0 and min(m,n).

ENGG2013

rank is invariant under row and column operations
Rank is invariant under row and column operations

Rank = 2

Rank = 2

Rank = 2

Rank = 2

Rank = 2

Rank = 2

Rank = 2

ENGG2013

comparison between det and rank
Comparison between det and rank

Determinant

Rank

Integer

Defined to any rectangular matrix

When applied to nn square matrix, rank=n implies existence of inverse.

  • Real number
  • Defined to square matrix only
  • Non-zero det implies existence of inverse.
  • When det is zero, we only know that all the columns (or rows) together are linearly dependent, but don’t know any information about subset of columns (or rows) which are linearly independent.

ENGG2013

basis definition
Basis: Definition
  • For any given vector in

if there is one and only one choice for the coefficients c1, c2, …,ck, such that

we say that these k vectors form a basis of .

ENGG2013

yet another interpretation of rank
Yet another interpretation of rank
  • Recall that a subspace W in is a subset which is
    • Closed under addition: Sum of any two vectors in W stay in W.
    • Closed under scalar multiplication: scalar multiple of any vector in W stays in W as well.

W

ENGG2013

geometric picture
Geometric picture

x – 3y + z = 0

W

z

y

x

W is the planegenerated, or spanned,by these vectors.

ENGG2013

basis and dimension
Basis and dimension
  • A basis of a subspace W is a set of linearly independent vectors which span W.
  • A rigorous definition of the dimension is:

Dim(W) = the number of vectors in a basis of W.

z

y

W

x

ENGG2013

rank as dimension
Rank as dimension
  • In this context, the rank of a matrix is the dimension of the subspace spanned by the rows of this matrix.
    • The least number of row vectors required to span the subspace spanned by the rows.
  • The rank is also the dimension of the subspace spanned by the column of this matrix.
    • The least number of column vectors required to span the subspace spanned by the columns

ENGG2013

example
Example

x – 2y + z = 0

z

y

Rank = 2

The three row vectorslie on the same plane.

Two of them is enoughto describe the plane.

x

ENGG2013

polynomial interpolation
Polynomial interpolation
  • Given n points, find a polynomial of degree n-1 which goes through these n points.
  • Technical requirements:
    • All x-coordinates must be distinct
    • y-coordinates need not be distinct.

y3

y2

y4

y1

x1

x2

x3

x4

ENGG2013

lagrange interpolation
Lagrange interpolation
  • Lagrange interpolating polynomial for four data points:

ENGG2013

computing the coefficients by linear equations
Computing the coefficients by linear equations
  • We want to solve for coefficients c3, c2, c1, and c0, such that

or equivalently

ENGG2013

the theoretical basis for polynomial interpolation
The theoretical basis for polynomial interpolation
  • The determinant of a vandermonde matrix

is non-zero, if all xi’s are distinct. Hence, we can always find the matrix inverse and solve the system of linear equations.

ENGG2013

ad