Timeline for Efficiently Updating Matrix Multiplication Result When One Matrix Changes [closed]
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2024 at 16:37 | history | closed | Daniele Tampieri Federico Poloni Jukka Kohonen user44191 Brian Hopkins | Not suitable for this site | |
| Nov 3, 2024 at 10:14 | comment | added | Federico Poloni | Reposted on scicomp.stackexchange.com/questions/44675/… | |
| Oct 30, 2024 at 18:52 | comment | added | Mark L. Stone | Try moving question to scicomp.stackexchange.com | |
| Oct 30, 2024 at 7:30 | review | Close votes | |||
| Nov 7, 2024 at 16:37 | |||||
| Oct 30, 2024 at 7:10 | comment | added | Mark Schultz-Wu | If $A' = A + E$ for $E$ sparse, then $A'\cdot B = A\cdot B + E\cdot B$, so you can simply compute $E\cdot B$ using a (sparsity-aware) matrix multiplication algorithm. That being said, it seems unlikely this is the right stackexchange site for this question. | |
| S Oct 30, 2024 at 6:42 | review | First questions | |||
| Oct 30, 2024 at 7:16 | |||||
| S Oct 30, 2024 at 6:42 | history | asked | Joseph | CC BY-SA 4.0 |