Complexity of local solution of multivariate integral equations
From MaRDI portal
The complexity of a local solution of Fredholm integral equations of the second kind for a Sobolev class of multivariate periodic functions with dominating mixed derivative is discussed. To prove the lower bound, an \(s\)-number technique is used, which was applied earlier to two other special classes of functions. The upper bound is proved in a constructive way providing an implementable algorithm of optimal order based on Fourier coefficients and a hyperbolic cross approximation.
Recommendations
- scientific article; zbMATH DE number 671945
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- Complexity of the problem of finding the solutions of fredholm equations of the second kind with smooth kernels. I
- The information complexity of the local solution of Fredholm integral equations with analytic kernels and free terms
- Complexity of the redholm equation of the second kind with kernels from classes with dominating mixed derivative
Cited in
(7)- On lower bounds on the complexity of solution of integral equations
- Complexity of integral equations and relations to \(s\)-numbers
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- scientific article; zbMATH DE number 671945 (Why is no real title available?)
- The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
- The worst case complexity of the fredholm equation with periodic free term and noisy information∗
- Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels
This page was built for publication: Complexity of local solution of multivariate integral equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908041)