QR Fatoration (Linear Algebra) (FIXED)

leoh
Messages
2
Reaction score
0

Homework Statement



Suppose that A is an matrix with linearly independent columns then A can be factored as,
where Q is an matrix with orthonormal columns and R is an invertible upper triangular matrix.

Show why it is Upper triangular matrix, and why the elements of the diagonal are Positive.

Homework Equations



A=QR
A= [x1 x2 ... xk]
R= [r1 r2 ... rk]

The Attempt at a Solution



(Sorry for my bad English, I am from Brazil)x1= (x1.u1)u1+(x1.u2)u2+...+(x1.uk)uk
x2= (x2.u1)u1+(x2.u2)u2+...+(x2.uk)uk
.
.
.
xn= (xn.u1)u1+(xn.u2)u2+...+(xn.uk)uk

now there is an argument, given Xi and Uj, if i<j , Uj and Xi are orthogonals. Which I do not know how to prove it.
So, if this is valid:

x1= (x1.u1)u1
x2= (x2.u1)u1+(x2.u2)u2
.
.
.
xk= (xk.u1)u1+(xk.u2)u2+...+(xk.uk)ukwhich is triangular. Now I do not now why the product (x1.u1), (xk.uk) is always positive.
 
Last edited:
Physics news on Phys.org
nobody?
 
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