Timeline for What is the time complexity of truncated SVD?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2019 at 9:04 | answer | added | fitfall | timeline score: 5 | |
| S Jun 6, 2017 at 10:06 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor improvements
|
| Jun 6, 2017 at 9:55 | review | Suggested edits | |||
| S Jun 6, 2017 at 10:06 | |||||
| May 27, 2016 at 6:00 | answer | added | Michael | timeline score: 4 | |
| S May 24, 2016 at 18:27 | history | suggested | digbyterrell | CC BY-SA 3.0 |
approximated svd (to me) implies all singular vectors computed but with some error. The question is about calculating a subset.
|
| May 24, 2016 at 18:04 | review | Suggested edits | |||
| S May 24, 2016 at 18:27 | |||||
| Dec 17, 2015 at 20:20 | comment | added | Federico Poloni | Your title says approximated, but your question text doesn't. | |
| Oct 18, 2015 at 14:41 | answer | added | loup blanc | timeline score: 22 | |
| Oct 16, 2015 at 7:06 | comment | added | Juan Bermejo Vega | Can you add a reference for your bound? I presume that bound is for the zero-error SVD? Are you only interested in that case? Do you care about the bit-size of the entries and condition numbers? | |
| S Mar 24, 2014 at 17:50 | history | suggested | მამუკა ჯიბლაძე |
I believe this is not singularity theory
|
|
| Mar 24, 2014 at 17:44 | review | Suggested edits | |||
| S Mar 24, 2014 at 17:50 | |||||
| Mar 24, 2014 at 15:33 | review | Close votes | |||
| Apr 2, 2014 at 5:21 | |||||
| Mar 24, 2014 at 14:18 | review | First posts | |||
| Mar 24, 2014 at 14:32 | |||||
| Mar 24, 2014 at 14:01 | history | asked | user40484 | CC BY-SA 3.0 |