Row Reduction Quiz Flashcards

1
Q

Consistent

A

A SOE of eqs. that has @ least one solution

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

Inconsistent

A

The solution set is empty

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

Linear equation

A

An equation where the highest power of variables is one

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

Standard Form

A

All variables on one side set equal to 0

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

System of linear equations

A

A set of eqs. we want to be true @ the same time

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

Solution

A

A set of all values which satisfies all eqs. in the system

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

Solution set

A

A system of all solutions; can have one, many, or more

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

Square Matrix

A

A matrix with equal columns and rows

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

Adjoined

A

Matching a matrix with a vector

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

3 x 4

A

3 is the height 4 is the width

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

rows can be written as…

A

a coefficient matrix

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

The answer can be written as…

A

vector

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

Augmented Matrix

A

Combination of a coeff. Matrix and answers vector

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

Replacement

A

We can add to a row any multiple of another row

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

Scaling

A

Multiply a row by a (non-zero) constant

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

Re-ordering

A

Swap the order of two rows

17
Q

The first step of the Algorithm

A

Make top left entry = 1 by scaling or re-ordering

18
Q

The second step of the Algorithm

A

Use elimination or replacement to make all entries below that 1 into 0.

19
Q

The third step of the Algorithm.

A

Make the left-most non-zero entry m row equal to one (creating a pivot)

20
Q

The 4th step of the algorithm

A

Use the new pivot to eliminate all values below

21
Q

The 5th step of the algorithm

A

Repeat the 3rd step until the matrix is in echelon form

22
Q

What is the 6th step of the algorithm?

A

After reaching echelon form, work up and left

23
Q

What is the 7th step of the algorithm?

A

Use the pivots to replace all values above the one

24
Q

Reduced Echelon Form

A

All values below and above the pivots are equal to 0

25
Q

The equation isn’t independent

A

A whole row of zeros in the matrix

26
Q

Not every row has a pivot but we are already in reduced echelon form, where the pivot should be the…

A

Free Variable

27
Q

How to solve with a free variable

A
  1. Take out of the matrix and write as equations
  2. Put all free variables to one side
  3. Those equations then become the solution set
28
Q

Dimension

A

of a solution set is the # of free variables

29
Q

Unique Solution

A

If the matrix is consistent and there is a pivot in every column of the coeff matrix

30
Q

Infinite Solutions

A

When one of the columns of the coeff. matrix does not have a pivot or when the whole row doesn’t make sense to the answer

31
Q

Plane

A

A linear equation in 3 dimensions