Skip to content

Conversation

Shreyas-Ekanathan
Copy link

Checklist

  • Appropriate tests were added
  • Any code changes were done in a way that does not break public API
  • All documentation related to code changes were updated
  • The new code follows the
    contributor guidelines, in particular the SciML Style Guide and
    COLPRAC.
  • Any new documentation only uses public API

Additional context

Implements a new ButterflyFactorization() algorithm

@Shreyas-Ekanathan
Copy link
Author

@oscardssmith does this look good?

B, U, V = cache.cacheval[2], cache.cacheval[3], cache.cacheval[4]
if cache.isfresh
@assert M==N "A must be square"
U, V, F, out = RecursiveFactorization.🦋workspace(A, b, B, U, V, alg.thread)
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Why is this not just a struct and ! operation? It would be much easier to read. I assume this is all just in-place and non-allocating.

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

as in make U, V, F, out a struct?

Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

yes

end
end
A, B, U, V, F = cache.cacheval
sol = V * (F \ (U * b))
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is allocating and not using TriangularSolve.jl?

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think we found that TriangularSolve.jl was slower than this method, so we left it as is

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants