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

Use Clenshaw-Curtis in the piecewise Poisson series inner product #2804

Merged
merged 10 commits into from
Dec 2, 2020

Conversation

pleroy
Copy link
Member

@pleroy pleroy commented Dec 2, 2020

About 1.7× faster.

A modest contribution to #2400.

@@ -41,6 +43,14 @@ Primitive<std::invoke_result_t<Function, Argument>, Argument> ClenshawCurtis(
Argument const& lower_bound,
Argument const& upper_bound);

// Computes a heuristic for the maximum number of points for an oscillating
// function.
std::optional<int> MaxPointsHeuristicsForAutomaticClenshawCurtis(
Copy link
Member

Choose a reason for hiding this comment

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

Move this to poisson_series.hpp.

Sorry, something went wrong.

@eggrobin eggrobin added the LGTM label Dec 2, 2020
@pleroy pleroy merged commit a1621c9 into mockingbirdnest:master Dec 2, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants