-
-
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
shuffle method for matrix #25526
Comments
Having both |
Assuming you want to preserve structural properties of the matrix (banded, sparse [this is sort of meaningless here though], symmetric,...), I don't see why these should be impossible. For banded matrices, we know the bandwidth so we can just treat this as a random shuffle of band arrays concatenated together, the shuffle for symmetric and upper-diagonal matrices also seems to be the same although we have to take care with elements in the main diagonal. I do see how sparse matrices would be tricky to implement efficiently though. Anyway, I think this should be doable for any (reasonable) agreed upon definition of shuffling for the special matrix types. |
I think shuffling the data only in the structural nonzeros is a somewhat surprising behavior for these generic functions. Sure, that's the only thing you can do for some matrix types, but I think that operation deserves its own function, maybe |
|
I am wondering if it makes sense to add the following method?
Thanks -Steve
The text was updated successfully, but these errors were encountered: