Anonymous user
Talk:QR decomposition: Difference between revisions
→C example: new section
(→usage?) |
(→C example: new section) |
||
Line 5:
: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. --[[User:Rdm|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. --[[User:Avi|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. --[[User:Ledrug|Ledrug]] 01:26, 29 June 2011
| |||