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
[lang] Reorder sparse matrix before solving #6886
Conversation
✅ Deploy Preview for docsite-preview ready!
To edit notification comments on pull requests, go to your Netlify site settings. |
for more information, see https://pre-commit.ci
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.
The changes look good to me ! Thanks!
PS: Sorry for the delayed response! I am busy working on my paper recently.
hhha, Never mind. If you don't have time, you can just ignore the review request. |
Issue: taichi-dev#2906 ### Brief Summary When solving a sparse linear system without reordering the system matrix, `analyze_pattern` and `factorize` would consume a lot of GPU memory. For example, the `res` in the `stable fluid` example can not be larger than 500. After reordering the sparse system matrix, we can set `res=512` now. Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Issue: #2906
Brief Summary
When solving a sparse linear system without reordering the system matrix,
analyze_pattern
andfactorize
would consume a lot of GPU memory. For example, theres
in thestable fluid
example can not be larger than 500. After reordering the sparse system matrix, we can setres=512
now.