Generalized solutions for the smallest Euclidean norm

crazygrey
Messages
7
Reaction score
0
Hi folks,

I have to find the generalized solution for the following Ax=y :

[1 2 3 4;0 -1 -2 2;0 0 0 1]x=[3;2;1]

The rank of A is 3 so there is one nullity so the generalized solution is:

X= x+alpha.n (where alpha is a constant , and n represents the nullity)

I found the solution to be:

X= [-1;0;0;1]+ alpha [1;-2;1;0] which is a non-unique solution.

I need to find (alpha) so that the generalized solution, i.e, the eigenvector has the smallest Euclidean norm

Thanks
 
Physics news on Phys.org
Any help ?
 
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...
Back
Top