The worst case complexity of the fredholm equation with periodic free term and noisy information∗
DOI10.1080/00207169908804876zbMath0946.65138OpenAlexW2002370532MaRDI QIDQ4935386
Publication date: 10 October 2000
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804876
computational complexityGalerkin methodinformation theoryinformation-based complexityFredholm equationnoisy information
Analysis of algorithms and problem complexity (68Q25) Numerical methods for integral equations (65R20) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing topological degree using noisy information
- Information-based complexity: New questions for mathematicians
- Probabilistic complexity analysis for linear problems in bounded domains
- Complexity of differential and integral equations
- Computing the topological degree with noisy information
- The complexity of indefinite elliptic problems with noisy data
- Complexity of local solution of multivariate integral equations
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- The average case complexity of the Fredholm equation of second kind with free term in \(H^ r(\Gamma)\)
- The minimal radius of Galerkin information for the Fredholm problem of the first kind
- Worst case complexity of problems with random information noise
- The complexity of definite elliptic problems with noisy data
- How to benefit from noise
- The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
- Linear integral equations
This page was built for publication: The worst case complexity of the fredholm equation with periodic free term and noisy information∗
