Timeline for Solving triangular matrix equations on a GPU
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 5, 2020 at 14:50 | vote | accept | Justin | ||
May 5, 2020 at 14:50 | comment | added | Justin | Ah I understand now. Thanks, I’ll give it a shot | |
May 5, 2020 at 6:40 | comment | added | Federico Poloni | As you suspect, the formula for the inverse of a $2\times 2$ system only holds for scalars, not blocks; so your computations are invalid, unfortunately. But you are mis-interpreting my suggestion; don't try to compute that inverse symbolically. Take that $2N\times 2N$ matrix and pass it directly to your solver. That's your "only one inverse/solve operation"; the only catch is that the matrix you are going to pass to your solver is a bit larger. This won't be a huge issue, since the number of nonzeros has a more important role than the size when dealing with sparse matrices. | |
May 5, 2020 at 3:38 | history | edited | Justin | CC BY-SA 4.0 |
added 363 characters in body
|
May 5, 2020 at 3:07 | history | edited | Justin | CC BY-SA 4.0 |
Following up to an answer posted
|
May 4, 2020 at 8:47 | answer | added | Federico Poloni | timeline score: 1 | |
May 4, 2020 at 5:20 | history | asked | Justin | CC BY-SA 4.0 |