Timeline for Reusing PARDISO symbolic factorization
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2020 at 10:35 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 4.0 |
added 4 characters in body; edited tags
|
| Apr 20, 2020 at 2:33 | vote | accept | beets | ||
| Apr 19, 2020 at 21:01 | answer | added | Henrik Schumacher | timeline score: 14 | |
| Apr 19, 2020 at 9:00 | history | tweeted | twitter.com/StackMma/status/1251797709956222976 | ||
| Apr 19, 2020 at 6:51 | history | edited | J. M.'s missing motivation♦ |
edited tags
|
|
| Apr 19, 2020 at 6:50 | comment | added | J. M.'s missing motivation♦ |
I'll only note that if you try to inspect the result of something like LinearSolve[mat, Method -> "Pardiso"] or LinearSolve[m, Method -> "Krylov"], the input matrix mat is stored along with a SparseArray`SparseLUDecomposition[] header in the former, and just the matrix itself in the latter, but with flags indicating which sparse method was used.
|
|
| Apr 19, 2020 at 4:46 | history | edited | beets | CC BY-SA 4.0 |
added 517 characters in body
|
| Apr 16, 2020 at 19:35 | review | First posts | |||
| Apr 16, 2020 at 23:34 | |||||
| Apr 16, 2020 at 19:33 | history | asked | beets | CC BY-SA 4.0 |