I have a function that's represented as a long list of values that I want to integrate. I can do it procedurally with Simpson's rule. ListConvolve generally runs faster then procedural code, so i would like to use it if I can find the right kernel.
My list can be of even or odd length, and for the latter I would like to use a method that is better than the trapezoid method. Is there a higher order method for this case?
As I mentioned in my comment, the easiest way to integrate a list of values is to use Interpolation with Integrate or NIntegrate. As Jens noted, the upgrade information for ListIntegrate, an obsolete function also mentions the same thing. For the sake of completeness, here's how you'd do it:
With[{if = Interpolation[(* list of {x, y} pairs *), InterpolationOrder -> k},
Integrate[if[x], {x, Sequence @@ if["Domain"][[1]]}]
]
If you really do wish to use Simpson's rule specifically (perhaps, for a homework or to reproduce some other result), you can also do what Daniel suggested, which is to set up the vector for Simpson's rule (or the 3/8ths rule), $\{1,4,2,4,2,\ldots,4,2,1\}$ and use Dot.
Interpolation and NIntegrate makes the integration very slow. See Michael's answer. Is it possible to use a quadrature rule, say, trapezoidal integration, to implement the integral in that equation in order to speed up the code? Thank you.
$\endgroup$
Commented
Jul 20, 2019 at 4:07
InterpolationandNIntegratewith an appropriate rule forMethod? $\endgroup$Integrate[]would work nicely for interpolating functions. $\endgroup${1,4,2,4,2,...,4,2,1}vector and useDot. $\endgroup$