Timeline for Max size of set linear equations to solve? (X=AX+B)
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:35 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Sep 28, 2015 at 11:28 | vote | accept | bliako | ||
| Sep 26, 2015 at 11:52 | comment | added | bliako | i have added an example application in the question. thanks | |
| Sep 26, 2015 at 11:52 | history | edited | bliako | CC BY-SA 3.0 |
added an example application
|
| Sep 25, 2015 at 21:38 | answer | added | Tristan Delaney | timeline score: 3 | |
| Sep 25, 2015 at 20:47 | history | edited | nicoguaro♦ | CC BY-SA 3.0 |
Prettify equations
|
| Sep 25, 2015 at 17:06 | comment | added | Christian Clason | Do you have a specific scientific problem in mind that leads to such a linear system? (Idle speculation might be interesting to you, but difficult to answer for us...) For practical purposes, you should look at Krylov methods; if you want to know what today's fastest hardware is capable of, you can look at the results of the current LINPACK benchmarks, which involves solving a (dense) linear system. | |
| Sep 25, 2015 at 16:58 | review | First posts | |||
| Sep 25, 2015 at 20:48 | |||||
| Sep 25, 2015 at 16:57 | history | asked | bliako | CC BY-SA 3.0 |