-
Notifications
You must be signed in to change notification settings - Fork 0
working on building out SVD #2
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
Open
cyancirrus
wants to merge
40
commits into
simd-vectorization
Choose a base branch
from
matrix-fact
base: simd-vectorization
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
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
…is valid and works!
…V in SVD, but have most of the structure up, givens rotation is working as expected as well! a bit of progress, want to get to SVD and then do small refactor, and then move on to the discrete fourier transform
…V in SVD, but have most of the structure up, givens rotation is working as expected as well! a bit of progress, want to get to SVD and then do small refactor, and then move on to the discrete fourier transform
…d check the diagonal
…d check the diagonal
…ther rows and looks useful for other algorithms, just need to relook at algos, diagonalization isn't unique aparently
…!! lets goooooooo!!!, need to rewrite and check and ensure scales and all of that but wowwwwwwwwwwwwwwwwwwwwwww also need to handle complex eigenvalue cases but hey we are doing one step at a time!
…efully this exists
… double-diagonalization method, going to implement one from my book and then see if we don't get things as expected, the algorithm given there is like for krysolov subspaces and that one hard fails a simple [1,2,3],[4,5,6],[7,8,9] matrix, so going to implement one a bit more primitie which should isolate if this is numerical instability or if the diagonalization algo needs many more 'hotfixes' like pivoting reortho etc
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.
Way more complicated than i first estimated but going to use a design of the following
QR decomp (here householholder) -> Shur -> Givens rotations,
but good to get some numerical compute underneath the fingers