Answers are grounded in this paper and cite their sources.
We evaluate the fractional integral I^α[f](t)=1/Γ(α)∫₀ᵗ(t-τ)α-1\,f(τ)\,dτ, 0<α<1, at time steps t=Δ t,2Δ t,,NΔ t by making use of the integral representation of the convolution kernel tα-1=1/Γ(1-α)∫₀∞e-ξ\,t\,ξ-α\,dξ. We construct an efficient Q-point quadrature of this integral representation and use it as a part of a fast time stepping method. The new method has algorithmic complexity $O(NQ)$ and storage requirement $O(Q)$. The number of quadrature nodes Q is independent of N and grows like O((-logε-logΔ t)²), where ε is the quadrature error tolerance and Δ t is the size of the time step. The (possible) singularity of f near τ=0 is taken into account. This new method is particularly well-suited for long time simulations.
No takes yet. Share an insight, caveat, or question.
Jing‐Rebecca Li (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: