The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> (Q4935386)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1395866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> |
scientific article; zbMATH DE number 1395866 |
Statements
The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> (English)
0 references
10 October 2000
0 references
Fredholm equation
0 references
Galerkin method
0 references
information theory
0 references
noisy information
0 references
computational complexity
0 references
information-based complexity
0 references
0 references
0.9183309674263
0 references
0.8658344745635986
0 references
0.8627970218658447
0 references
The information-based complexity of a Fredholm equation of the second kind in real periodic Sobolev space is studied. The free term belongs to the unit ball and is corrupted by bounded noise. The main method of research is the same as in the works by \textit{A. G. Werschulz} [The computational complexity of differential and integral equations: An information-based approach (1991; Zbl 0754.65129)] and \textit{L. Plascota} [Noise information and computational complexity (1996)]. An estimate of information radius and a lower bound of the minimal radius are given. It is shown that the noisy Galerkin method is a minimal error algorithm. The estimate of the problem complexity of the Fredholm equation with noise information is proved. In conclusion the plan for future work is proposed.
0 references
