The Petrov-Galerkin method for second kind integral equations. II: Multiwavelet schemes (Q1373116): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 04:07, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Petrov-Galerkin method for second kind integral equations. II: Multiwavelet schemes |
scientific article |
Statements
The Petrov-Galerkin method for second kind integral equations. II: Multiwavelet schemes (English)
0 references
16 June 1999
0 references
[For part I see \textit{Z. Chen} and \textit{Y. Xu}, SIAM J. Numer. Anal. 35, No. 1, 406-434 (1998; Zbl 0911.65143).] The purpose of this paper is to study wavelet based Petrov-Galerkin methods for Fredholm integral equations of the second kind and especially to investigate matrix compression resulting from the use of discontinuous orthogonal multiwavelets on the interval \([0,1].\) The obtained results show that the considered method for integral equations yields linear systems having numerically sparse coefficient matrices whose condition numbers are bounded. The authors develop a truncation strategy that leads to linear systems having sparse coefficient matrices and thus yields fast algorithms for solving this class of integral equations. Moreover, these schemes produce approximate solutions having almost optimal order of convergence. The computational complexity of these algorithms is analysed.
0 references
wavelet Petrov-Galerkin schemes
0 references
second kind Fredholm integral equations
0 references
discontinuous orthogonal multiwavelets
0 references
truncation strategy
0 references
sparse coefficient matrices
0 references
wavelet bases for piecewise polynomials
0 references
matrix compression
0 references
convergence
0 references
computational complexity
0 references
algorithms
0 references