REF and RREF Flashcards

1
Q

A matrix is in REF if:

A
  • if the row is not entirely made of zeros, the first non-zero entry is a 1 (leading one)
  • any all-zero rows are at the bottom
  • leading ones are on the right of the leading one above
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

A matrix is in RREF if

A

If the COLUMN with the leading one has zeros in every other entry
Can have a zero row

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Gauss algorithm (matrix -> REF)

A
  • locate left most non-zero column
  • swap rows to bring non-zero entry to top (pivot element)
  • divide first row by pivot element to make a leading one
  • add suitable multiples to rows so all entries below the leading one are zero
  • repeat until in REF
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Gauss-Jordan algorithm (matrix -> RREF)

A
  • use Gauss algorithm to make matrix into RREF
  • work upwards from lowest non-zero row, clear entries above each leading one
How well did you know this?
1
Not at all
2
3
4
5
Perfectly