EGR 6013 Homework Set 1
— David Wagner 2009/09/13 20:20
Problem 1
1. Illustrate the use of the Gauss-Jordan reduction in obtaining the general solution of each of the following sets of equations:
√(a)
,
,
.
=
Second Step.
=
=
√(b)
,
,
.
=
=
Second Step.
=
=
Let
.

Problem 2
2. Evaluate the following matrix products:
√(a)
=
√(b)
=
=
é
=
√(d)
=
√(e)
=
=
√(f)
=
=
Problem 3.
3. If the product A(B C) is defined, show that it is of the form
and deduce that then A(B C) = (A B) C.
First,
.
Let
and
.
So,
.
Now, all
is constant over the index s,
so
is constant over the sum indexed by s, so
=
Repeating this shows
=
=
=![delim{[}{a_ir sum{s}{}{c_sj sum{r}{}{ b_rs} } }{]} delim{[}{a_ir sum{s}{}{c_sj sum{r}{}{ b_rs} } }{]}](http://wiki.waggy.org/dokuwiki/lib/exe/fetch.php?w=&h=&cache=cache&media=cache_mathplugin%3amath_969.5_7c83c7af36aa917265fb4bc112d913c4.png)
which is
=
=[a_ir]( [b_rs] [c_sj] )
Going back to the original equation and messing with it in a slightly different manner,
=
=
=
=
Problem 4.
Each column of c is a linear combination of the corresponding column in [a] multiplied by the sum of the corresponding row elements in [b]. Similarly, each row vector of c is a linear combination of the corresponding row in a multiplied by the sum of the corresponding column elements in b. I don't see how to “prove” this since it is just a restatement of the definition of matrix multiplication.
- Every j=1..n column vector
.
- Every k=1..n row vector of [c],
.
Note ]r[ represents the row vector r.
Problem 5.
This is true when [B][A] -[A][B] = 0, equivalent to [B][A] = [A][B].
If [A] and [B] are invertible, premultiplying by [B] and postmultiplying both sides by [A] gives
, the same as
=
= [I], a true statement.
Thus, this is true when both [A] and [B] have inverses.
,
([A]+[B])([A-B])
=
=
=
=
=


