Skip to content
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

Fast polynomial evaluation via FixedPolynomials.jl #9

Merged
merged 8 commits into from
Oct 16, 2024
Merged

Conversation

tanderson92
Copy link
Member

No description provided.

@tanderson92 tanderson92 marked this pull request as draft September 2, 2024 23:26
@tanderson92
Copy link
Member Author

tanderson92 commented Sep 2, 2024

Preliminary work towards use of FixedPolynomials.jl. What is incomplete is fixing up the types a bit: S, T, and Float64 in the extension module do not make sense yet.

One choice I made is that for vector PDEs it is the user's responsibility to pack and unpack them for handling by the evaluator.

@tanderson92 tanderson92 marked this pull request as ready for review September 4, 2024 03:59
@tanderson92
Copy link
Member Author

tanderson92 commented Sep 5, 2024

For the evaluation routines, does it make more sense to have input x be of type ::AbstractArray{Vector{S}}, so that arbitrary iterable collections can be handled? Probably, and I think this is useful for our intended application where we may want to index into a collection of Vector{S} points generated on the fly from a ::Quadrature

@tanderson92 tanderson92 merged commit 68379ec into main Oct 16, 2024
4 checks passed
@tanderson92 tanderson92 deleted the fasteval branch October 16, 2024 15:15
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.

1 participant