Talk:QR decomposition: Difference between revisions
Content added Content deleted
(huh?) |
(further thoughts) |
||
Line 2:
What does "and the usage for linear least squares problems on the example from Polynomial_regression" mean, specifically, as a task requirement? --[[User:Rdm|Rdm]] 16:02, 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. --[[User:Rdm|Rdm]] 16:34, 17 June 2011 (UTC)
| |||
Revision as of 16:34, 17 June 2011
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)
- 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)