Timeline for How does NumPy solve least squares for underdetermined systems?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2021 at 0:44 | comment | added | DavidS | The dgelsd documentation in the code file says it uses QR. | |
| Oct 7, 2019 at 19:28 | history | edited | Matthew Gunn | CC BY-SA 4.0 |
typo correction
|
| S Sep 6, 2018 at 7:25 | history | suggested | Xiangxiang Xu | CC BY-SA 4.0 |
improved formatting, corrected spelling
|
| Sep 6, 2018 at 7:02 | review | Suggested edits | |||
| S Sep 6, 2018 at 7:25 | |||||
| Jul 14, 2017 at 19:11 | comment | added | Sycorax♦ |
@hxd1011R's lm uses QR factorization by default but you can specify alternatives.
|
|
| Jul 14, 2017 at 18:21 | comment | added | Haitao Du | dgelsd uses SVD but R lm uses QR? | |
| Jul 14, 2017 at 17:52 | history | edited | Matthew Gunn | CC BY-SA 3.0 |
deleted 85 characters in body
|
| Oct 16, 2016 at 23:53 | history | edited | Matthew Gunn | CC BY-SA 3.0 |
added 73 characters in body
|
| Oct 16, 2016 at 23:49 | vote | accept | George Pligoropoulos | ||
| Oct 16, 2016 at 23:47 | history | edited | Matthew Gunn | CC BY-SA 3.0 |
added 73 characters in body
|
| Oct 16, 2016 at 23:36 | history | edited | Matthew Gunn | CC BY-SA 3.0 |
added 240 characters in body
|
| Oct 16, 2016 at 23:23 | history | edited | Matthew Gunn | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Oct 16, 2016 at 23:16 | history | answered | Matthew Gunn | CC BY-SA 3.0 |