Decompose Tridiagonal Solve into core steps #1382
Draft
+389
−70
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Perhaps simpler approach than #1374 to figure out the framework.
When we have a generic
Solve(a, b, assume_a="tridiagonal"), there are 3 core steps we may want to reason about symbolically:We may not want to do 1. at all, if the extracted diagonals are being allocated symbolically
We may want to cache steps 1/2 in looping constructs (as in Blockwise with broadcasted A, or Scan with non_sequence A)
However we probably don't want to start with this low-granular representation (at least with steps 2 /3 split) to avoid a messy autodiff graph.
📚 Documentation preview 📚: https://pytensor--1382.org.readthedocs.build/en/1382/