Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • $\begingroup$ Hi, your approach does the correct thing with my Kmat. My large sparse array Kmat has 996336 non-zero entries. The AbsoluteTiming of the reconstruction is reduced from 0.12 sec to 0.05 sec, which is a nice speedup! I was hoping to get it reduced to a negligible computation time, but perhaps that's too much to ask for since I'm dealing wth huge data... Your first point in the disclaimers is correct: The Takes is the complement of all equation numbers and the Froms, the Tos stay in the new matrix. Thanks a lot, @user293787! $\endgroup$ Commented Jul 27, 2022 at 13:27
  • $\begingroup$ @Frida Thank you for the feedback. That is only a moderate speedup. I am assuming that in your case X is always the same and only Kmat keeps changing. Perhaps one could exploit that, do some preprocessing on X and so on. But it is probably only worth doing if it is a bottleneck in your computation. $\endgroup$ Commented Jul 27, 2022 at 13:35