Timeline for Solving system of related equations without completely recomputing LU decomposition for each equation
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:53 | history | edited | CommunityBot |
replaced http://scicomp.stackexchange.com/ with https://scicomp.stackexchange.com/
|
|
| Oct 7, 2016 at 9:02 | comment | added | Nick Alger | One situation where high-rank diagonal updates can be done cheaply is if the matrices involved are hierarchical matrices (matrix is not necessarily low rank, but it's off-diagonal blocks are low rank in a recursive manner), and you have precomputed a hierarchical representation. | |
| Oct 7, 2016 at 8:28 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 7, 2016 at 7:54 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 8, 2016 at 7:47 | answer | added | Rabindranath Andujar | timeline score: 1 | |
| Aug 8, 2016 at 3:04 | history | edited | Set | CC BY-SA 3.0 |
added 239 characters in body
|
| Aug 8, 2016 at 2:40 | history | asked | Set | CC BY-SA 3.0 |