Consider the following system of equations:
H x + A T λ = [ 0 0 0 ] T A x = b
Where:
H = ⎣ ⎡ 2 0 0 0 2 0 0 0 2 ⎦ ⎤ ; A = [ 1 2 3 ] ; b = 4 x ∈ I R 3 × 1 ; λ ∈ I R
The goal of this question is to find the unknown column matrix x . Say:
x = [ x 1 x 2 x 3 ] T
x 1 + x 2 + x 3 = n m
Where m and n are coprime positive integers. Find m + n .
Note: The solver is encouraged to make effective use of linear algebra. The superscript T denotes the transpose operation carried out on a matrix.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Thanks for posting. Your approach is the recommended way to solve the problem. I am planning on posting a more general variant of this problem. I was recently working with equations involving a very large number of variables and I started to appreciate the effectiveness of linear algebra. This problem and its solution is my way of sharing this appreciation that I developed.
Log in to reply
Indeed, it looks like there is power in being able to manipulate whole matrices as one would ordinarily manipulate terms in an equation.
Consider the system of equations: H x + A T λ = [ 0 0 0 ] T A x = b
Multiplying the first equation by A H − 1 gives:
A H − 1 H x + A H − 1 A T λ = A H − 1 [ 0 0 0 ] T
Which gives:
A x + A H − 1 A T λ = 0
Subtracting this equation by A x = b gives:
A H − 1 A T λ = − b
This gives:
λ = − ( A H − 1 A T ) − 1 b
Finally, we have the equation:
H x + A T λ = [ 0 0 0 ] T
Replacing λ gives:
H x − A T ( A H − 1 A T ) − 1 b = [ 0 0 0 ] T
Finally,
x = H − 1 A T ( A H − 1 A T ) − 1 b
At this point, one may substitute values and simplify. Evaluate the sizes of the resulting matrices at each stage as a sanity check .
Finally, we get:
x = [ 7 2 7 4 7 6 ] T
Through this easy question, I wanted to demonstrate that simultaneous equations involving matrices can be solved by effective manipulation.
An alternate approach to this problem is as such:
H x + A T λ = [ 0 0 0 ] T A x = b
This can be rearranged as:
[ H A A T 0 ] [ x λ ] = ⎣ ⎢ ⎢ ⎡ 0 0 0 b ⎦ ⎥ ⎥ ⎤
Therefore,
[ x λ ] = [ H A A T 0 ] − 1 ⎣ ⎢ ⎢ ⎡ 0 0 0 b ⎦ ⎥ ⎥ ⎤
The last step can be evaluated by using a programmable calculator.
Problem Loading...
Note Loading...
Set Loading...
Just to provide a more pedestrian look, here's what the equations boil down to when you evaluate them.
2 x 1 + λ = 0 2 x 2 + 2 λ = 0 2 x 3 + 3 λ = 0 x 1 + 2 x 2 + 3 x 3 = 4
We have four linear equations to solve for four unknowns. Solving is standard procedure from there