Computational complexity of QR decomposition

bushindo · October 4, 2011, 8:05pm

What is the computational complexity of the QR decomposition process for a general (m x n) matrix, where m > n ?

Need answer fast!

engineer_comp_geek · October 4, 2011, 9:27pm

Is this a homework question?

bushindo · October 4, 2011, 10:54pm

I wish. Alas, I’m too old for that. I just found the answer, so nevermind.

Topic		Replies	Views
So, what exactly is the problem with MS Excel for complex mathematics and statistics? Factual Questions	38	6520	June 18, 2012
Explain/confirm why this matrix is possible (Cross product determinant method) Factual Questions	19	4691	May 5, 2012
Splitting Efficiency Hairs -- trig functions or powers/roots? Factual Questions	8	2345	February 4, 2012
Is there a limit to how computational expensive a function can be? Factual Questions	21	1645	August 17, 2007
What are matric calculations used for? Factual Questions	28	1688	September 21, 2005