返回
Adaptive, fast, and oblivious convolution in evolution equations with memory
DOI:10.1137/060674168.png)
摘要
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.
Keyword:
convolution quadrature
adaptivity
Volterra integral equations
numerical inverse Laplace transform
anomalous diffusion
fractional order viscoelasticity
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Oxybutynin Enhances the Metabolism of Clomipramine and Dextrorphan Possibly by Induction of a Cytochrome P450 Isoenzyme奥昔布宁增强氯米帕明和右美沙芬的代谢,可能通过诱导细胞色素P450同工酶实现。


