This is a simple package to provide functionality for numerically integrating presampled data (meaning you can't choose arbitrary nodes). If you have the ability to evaluate your integrand at arbitrary points, please consider using better tools for the job (such as the excellent FastGaussQuadrature.jl).
Do note that while the code is trivial, it has not been extensively tested and does not focus on numerical precision. Issues, suggestions and pull requests are welcome.
# setup some data x = collect(-π/2 : π/1000 : π/2) y = sin.(x) # integrate using the default Trapezoidal method integrate(x, y) # integrate using a specific method integrate(x, y, SimpsonEven()) # compute cumulative integral Y = cumul_integrate(x, y) # compute cumulative integral for each column of an array z = [sin.(x) cos.(x) exp.(x/pi)] Z = cumul_integrate(x, z) # compute cumulative integral for each line of an array zp = permutedims(z) ZP = cumul_integrate(x, zp, dims=1) # Multidimensional integration Y = [i*j for i=x,j=y] integrate((x,y), Y)
The currently available methods are:
Currently cumulative integrals and multidimensional integrals are restricted to using Trapezoidal methods.
All methods containing "Even" in the name assume evenly spaced data. All methods containing "Fast" omit basic correctness checks and focus on performance. Consequently, the fast methods will segfault or produce incorrect results if you supply incorrect data (vectors of different lengths, etc.). RombergEven needs a power of 2 + 1 points (so 9, 17, 33, 65, 129, 257, 513, 1025...) evenly spaced for it to work. Useful when control over accuracy is needed.
11 days ago