Talk:QR decomposition

Revision as of 01:52, 29 June 2011 by rosettacode>Mwn3d (→‎C example: new section)

usage?

What does "and the usage for linear least squares problems on the example from Polynomial_regression" mean, specifically, as a task requirement? --Rdm 16:02, 17 June 2011 (UTC)

It means that there already is a existing task on RC (Polynomial regression) which requires linear least squares, and since LLS is one use case for QR, that task can be used here as an example. The Go and R solutions of the Polynomial regression already used QR instead of the normal equations approach. --Avi 20:52, 17 June 2011 (UTC)
According to the wikipedia page on least squares, QR reduction is supposed to be more numerically stable than faster approaches. But we can solve the Polynomial regression example exactly, so I am not sure that that example is a good one for QR reduction least squares fitting. --Rdm 16:34, 17 June 2011 (UTC)
The advantage is that it is already existing, has many solutions and can be used as a comparison. --Avi 20:52, 17 June 2011 (UTC)

C example

The code does do the job, but is quite ugly, and overly long. Much improvement is needed, and all the matrix_delete() calls would make you appreciate garbage collection that much more. --Ledrug 01:26, 29 June 2011

Return to "QR decomposition" page.