Fast preconditioned iterative methods for convolution-type integral equations (Q1577723)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast preconditioned iterative methods for convolution-type integral equations |
scientific article; zbMATH DE number 1496096
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast preconditioned iterative methods for convolution-type integral equations |
scientific article; zbMATH DE number 1496096 |
Statements
Fast preconditioned iterative methods for convolution-type integral equations (English)
0 references
27 August 2000
0 references
The authors study the numerical solution of the Fredholm-type integral equation \[ x(t)+ \sum^m_{j=1} \mu_jx(t- t_j)+ \int^\tau_0 k(t- s)x(s) ds= 0,\quad t\in [0,\tau].\tag{1} \] Here, \(k\) and \(g\) are piecewise smooth; the points of discontinuity of \(k\) are supposed to be at \(t_j\in [-\tau,\tau]\), and \(x(t)= 0\) for \(t\not\in[0,\tau]\). The proposed numerical scheme has the property that the discretization matrix characterizing the approximating operator equation has Toeplitz structure. The resulting equation is then solved by using the preconditioned conjugate gradient method with Toeplitz-like preconditioners. Three numerical examples illustrate the accuracy and the performance of this method.
0 references
Fredholm integral equations
0 references
convolution kernels
0 references
quadrature methods
0 references
preconditioning
0 references
conjugate gradient method
0 references
numerical examples
0 references