Finding the Minimal Sum Unit Vector in R^3

Luxe
Messages
10
Reaction score
0

Homework Statement



Linear Algebra:

For all the unit vectors u=[x,y,z]^T in R^3. Find the one for which the sum x+8y+2z is minimal. (u is a 3 x 1 vector)



Homework Equations





The Attempt at a Solution



I tried working this with the least squares method...it wasn't right. I am probably overthinking this.

Any help is appreciated! :)
 
Physics news on Phys.org
all the unit vectors repressent a sphere of radius one

consider the plane x+8y+2z = c for some arbitrary c, each c representing a a different plane

you basically want to find the plane with the smallest c that still intersects the sphere (hint: which will be at only one point on the sphere... think directions)
 
The problem is simply to minimize x+ 8y+ 2z= 0 with the constraint x^2+ y^2+ z^2= 1.

"Lagrange multiplier method" seems in order.
 
lagrange is good & will work, but i think if you just consider which direction leads to a single intersection of the plane and sphere you can skip a couple of steps, though all sama sama
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top