MA 322 Flashcards

(65 cards)

1
Q

linear equation

A

in the form

a1*x1 + a2*x2 … an*xn = b

a is constant; x is variable

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

system of linear equations

(linear system)

A

collection of one or more

linear equations with

same variables

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

solution set of

system of equations

A

list of number that

each make equation true

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

equivalent linear systems

A

have same solution set

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

consistent

A

has one or infinitely many solutions

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

inconsistent

A

has no solutions

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

coefficent matrix

A

matrix of coeffiecnts of linear system

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

augmented matrix

A

coefficent matrix with constants from

right side of equation

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

row equivalent

A

two matrices are row equivalent if

there is a sequence of elementary

row opertations that transforms one into

another

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

existence

A

is the matrix consistent?

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

uniqueness

A

is there only one solution?

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

leading entry

A

left-most non-zero entry in a row

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

echelon form

(row echelon form)

A
  1. All non-zero rows are above any rows of all zeroes
  2. Each leading entry of a row is in a column to the right of the leading entry of the row above it
  3. All entries in a column below a leading entry are zero
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

reduced echelon form

(reduced row echelon form)

A

In echelon form:

  1. the entry in each row is one
  2. each leading entry is the only non-zero entry in its column
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

pivot position

A

location that corresponds to a leading one

in the reduced echelon form

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

pivot column

A

column that contains a pivot position

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

pivot

A

non-zero number in a pivot position

that is needed to create zeroes

in row operations

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

basic variables

A

a variable in a linear system that

corresponds to a pivot column

in the coeffient matrix

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

free variables

A

any variable that is not a

basic varible

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

parametric description

A

uses free varibles as parameters

in form:

x1 = a +x3

x2 = b -x3

x3 is free

x4 = c

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

vector

(column vector)

A

matrix with only one column

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

linear combination

with vectors v1,v2, … vpinRn

and weights (scalars) c1, c2, … cp

A

in form:

y = c1*v1 + c2*v2… + cp*vp

where y is the linear combination

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

span

for v1, … vp in Rn

A

the set of all linear combinations

of v1 … vp is denoted by Span{v1vp} and is called

the subset of Rn spanned by

v1vp

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

Span{u,v} in R3

A

the set of all scalar multiples of v

(set of points on the line through v and 0)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Span{**u**,**v**} in **R**3
the plane that contains **u**, **v**, and **0**
26
if A is an m X n matrix with columns **a1**... **an** and if **x** is in **R**n and the # of columns of A = # of entries in **x** then the product of A and **x** is:
the linear combination of the columns of A using the corresponding entries in **x** as weights A**x** = **b** ![http://www.pragmaware.net/articles/matrices/img/matrices025.jpg](http://www.pragmaware.net/articles/matrices/img/matrices025.jpg)
27
matrix equation
A**x** = **b** in form ![http://www.pragmaware.net/articles/matrices/img/matrices025.jpg](http://www.pragmaware.net/articles/matrices/img/matrices025.jpg)
28
the equation A**x** = **b** has a solution
if and only if **b** is a linear combination of the columns of A
29
For A is an m X n matrix the following statements are either all true or all false (about coefficent matrix)
a. ) for each **b** in **R**m the equation A**x** = **b** has a solution b. ) each **b** in **R**m is a linear combination of the colmns of A c. ) the cloumns of A span **R**m d. ) A has a pivot position in every row
30
identity matrix (**I** or **I**n)
a square matrix with ones on the diagonal and zeroes elsewhere (**I**n \* **x** = **x** for all **x** in **R**n)
31
if A is an m X n matrix **u** and **v** are vectors in **R**n and c is a scalar
a. ) A(**u** + **v**) = A**u** + A**v** b. ) A(c**u**) = c(A**u**)
32
homogeneous
can be written in form A**x** = **0** always has one solution **x** = **0** (trival solution)
33
the homogenous equation A**x** = **0** has a non-trival solution
if and only if the equation has at least one free variable
34
in the form a1\*x1 + a2\*x2 ... an\*xn = b a is constant; x is variable
linear equation
35
collection of one or more linear equations with same variables
system of linear equations (linear system)
36
list of number that each make equation true
solution set of system of equations
37
have same solution set
equivalent linear systems
38
has one or infinitely many solutions
consistent
39
has no solutions
inconsistent
40
matrix of coeffiecnts of linear system
coefficent matrix
41
coefficent matrix with constants from right side of equation
augmented matrix
42
is the matrix consistent?
existence
43
is there only one solution?
uniqueness
44
left-most non-zero entry in a row
leading entry
45
1. All non-zero rows are above any rows of all zeroes 2. Each leading entry of a row is in a column to the right of the leading entry of the row above it 3. All entries in a column below a leading entry are zero ![http://www.math.tamu.edu/~stecher/Linear-Algebra/Systems/gausselim2.gif](http://www.math.tamu.edu/%7Estecher/Linear-Algebra/Systems/gausselim2.gif)
echelon form (row echelon form)
46
In echelon form: 1. the entry in each row is one 2. each leading entry is the only non-zero entry in its column ![http://upload.wikimedia.org/math/c/5/9/c59b6053efdbc8a1a35414da32bf39fa.png](http://upload.wikimedia.org/math/c/5/9/c59b6053efdbc8a1a35414da32bf39fa.png)
reduced echelon form (reduced row echelon form)
47
location that corresponds to a leading one in the reduced echelon form
pivot position
48
column that contains a pivot position
pivot column
49
non-zero number in a pivot position that is needed to create zeroes in row operations
pivot
50
a variable in a linear system that corresponds to a pivot column in the coeffient matrix
basic variables
51
any variable that is not a basic varible
free variables
52
uses free varibles as parameters in form: x1 = a +x3 x2 = b -x3 x3 is free x4 = c
parametric description
53
matrix with only one column
vector (column vector)
54
in form: **y** = c1\***v1** + c2\***v2**... + cp\***vp** where **y** is the linear combination
linear combination with vectors **v****1**,**v2**, ... **vp**in**R**n and weights (scalars) c1, c2, ... cp
55
the set of all linear combinations of **v**1 ... **vp** is denoted by Span{**v1**...**vp**} and is called the subset of **R**n spanned by **v1**... **vp**
span for **v1**, ... **vp** in **R**n
56
the set of all scalar multiples of **v** (set of points on the line through **v** and **0**)
Span{**u**,**v**} in **R**3
57
the plane that contains **u**, **v**, and **0**
Span{**u**,**v**} in **R**3
58
the linear combination of the columns of A using the corresponding entries in **x** as weights A**x** = **b** ![http://www.pragmaware.net/articles/matrices/img/matrices025.jpg](http://www.pragmaware.net/articles/matrices/img/matrices025.jpg)
if A is an m X n matrix with columns **a1**... **an** and if **x** is in **R**n and the # of columns of A = # of entries in **x** then the product of A and **x** is:
59
A**x** = **b** in form ![http://www.pragmaware.net/articles/matrices/img/matrices025.jpg](http://www.pragmaware.net/articles/matrices/img/matrices025.jpg)
matrix equation
60
if and only if **b** is a linear combination of the columns of A
the equation A**x** = **b** has a solution
61
a. ) for each **b** in **R**m the equation A**x** = **b** has a solution b. ) each **b** in **R**m is a linear combination of the colmns of A c. ) the cloumns of A span **R**m d. ) A has a pivot position in every row
For A is an m X n matrix the following statements are either all true or all false (about coefficent matrix)
62
a square matrix with ones on the diagonal and zeroes elsewhere (**I**n \* **x** = **x** for all **x** in **R**n)
identity matrix (**I** or **I**n)
63
a. ) A(**u** + **v**) = A**u** + A**v** b. ) A(c**u**) = c(A**u**)
if A is an m X n matrix **u** and **v** are vectors in **R**n and c is a scalar
64
can be written in form A**x** = **0** always has one solution **x** = **0** (trival solution)
homogeneous
65
if and only if the equation has at least one free variable
the homogenous equation A**x** = **0** has a non-trival solution