-
-
Notifications
You must be signed in to change notification settings - Fork 5.5k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Rebase of #28526 on master: Sparse cholesky solve with sparse RHS #34989
Conversation
test for Factor and Symmetric Sparse Matrix
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM, though I should add that I'm not familiar with the specific spsolve
calls. Shall we have another non-trivial test with a small, densely populated sparse SPD matrix, and compare against the classic dense solution?
I think we should not need more tests because this only handles the case of the sparse rhs by making it dense and thus reducing the missing case to an existing case. |
CI failures are unrelated. Merging. |
Thank you so much! |
* fix \ SparseVector * split (\) for sparsevector; test for Factor and Symmetric Sparse Matrix Co-authored-by: Chi Po Choi <[email protected]> (cherry picked from commit d2f9677)
* fix \ SparseVector * split (\) for sparsevector; test for Factor and Symmetric Sparse Matrix Co-authored-by: Chi Po Choi <[email protected]>
* fix \ SparseVector * split (\) for sparsevector; test for Factor and Symmetric Sparse Matrix Co-authored-by: Chi Po Choi <[email protected]>
This reverts commit d2f9677.
Rebase #28526 on top of master.
cc @pochoi