-
-
Notifications
You must be signed in to change notification settings - Fork 226
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 quadrature of solutions via interpolation #188
Comments
To do this, you'd look at the interpolation functions, like: https://github.com/JuliaDiffEq/OrdinaryDiffEq.jl/blob/master/src/dense/interpolants.jl#L151 The first is the |
Integration is a bit more involved than differentiation because you have to choose an additional constant. Thus, the primitive function in the |
Oh that's a very good point. Basically if |
That's probably correct. However, in order to compute definite integrals, a second method might be added in order to avoid the additional overhead of summing up the integrals up to the starting point, since |
That's a very good point. Or there can be a keyword argument for the starting point which starts at |
We have the interpolation, which means we can easily integrate the interpolation on each interval. Analogous to the derivatives,
can give the integral of the interpolation function. Since the interpolation is continuous, by the Fundamental Theorem of Calculus we can get definite integrals like:
or indefinite integrals:
This means that people who want to perform quadrature on the resulting solution could get the results in O(1) using just two interpolation calls, if we define the coefficients for the integrated interpolation which is easy to do.
The text was updated successfully, but these errors were encountered: