The complexity of Fredholm equations of the second kind: noisy information about everything
From MaRDI portal
Publication:610938
DOI10.1216/JIE-2009-21-1-113zbMath1204.65162OpenAlexW2032911365MaRDI QIDQ610938
Publication date: 13 December 2010
Published in: Journal of Integral Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1216/jie-2009-21-1-113
Numerical methods for integral equations (65R20) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20)
Related Items
Tractability of the Fredholm problem of the second kind, Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic and stochastic error bounds in numerical analysis
- Surface approximation is sometimes easier than surface integration
- Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
- Integral equations. Theory and numerical treatment
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- Worst case complexity of problems with random information noise
- A New Approximation Method for the Helmholtz Equation in an Exterior Domain
- Noisy Information and Computational Complexity
- The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
- A Multivariate Faa di Bruno Formula with Applications
- Number of arithmetical operations necessary for the approximate solution of Fredholm integral equations of the second kind
- $L^\infty $-Multivariate Approximation Theory
- What is the complexity of surface integration?
- The \(L_\infty\)-norm of the \(L_2\)-spline projector is bounded independently of the knot sequence: A proof of de Boor's conjecture
