Convolution quadrature revisited (Q1770923): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/b:bitn.0000046813.23911.2d / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031029580 / rank | |||
Normal rank |
Revision as of 09:26, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convolution quadrature revisited |
scientific article |
Statements
Convolution quadrature revisited (English)
0 references
7 April 2005
0 references
This paper is a review on convolution quadratures. In fact they have many attractive features that let them work well in a lot of applications where the model equations are derived via a frequency-domain fundamental solution of the transfer equation, whereas the time-domain fundamental solution or impulse response is not available. Moreover such convolution quadrature methods enjoy excellent stability properties when used to discretize integral, integro-differential equations or integro-partial differential equations, etc. They are also useful as a theoretical tool in analyzing standard numerical time discretization methods through discretized operational calculus. In particular this paper closes a gap that was left in the theory of \textit{C. Lubich} [Numer. Math. 52, 129--145 (1988; Zbl 0637.65016)], by extending the known approximation results for the case of sectorial Laplace transforms to finite-part convolutions with nonintegrable kernel. The author also presents two new detailed and unified proofs of the optimal error bounds for both locally integrable and nonintegrable convolution kernels.
0 references
discretized operational calculus
0 references
linear multistep methods
0 references
stability
0 references
integro-differential equations
0 references
numerical time discretization methods
0 references
sectorial Laplace transforms
0 references
finite-part convolutions
0 references
error bounds
0 references