.png){kind=icon}
Return
Adaptive, fast, and oblivious convolution in evolution equations with memory
.png){kind=icon}
OA
AI
DOI：10.1137/060674168.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To approximate convolutions which occur in evolution equations with memory terms, a variable-step-size algorithm is presented for which advancing N steps requires only O(N log N) operations and O(log N) active memory, in place of O(N-2) operations and O(N) memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a blowup example originating from a Schrodinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law.
Keywords:
convolution quadrature
adaptivity
Volterra integral equations
numerical inverse Laplace transform
anomalous diffusion
fractional order viscoelasticity
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave View more