Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
The authors study the lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels. They first formulate the problem and define the worst case error criterion and the notation of quasi Monte-Carlo (QMC)-Nyström tractability. They also obtain worst case error bounds and derive necessary and/or sufficient conditions for QMC-Nystrom tractability. In addition they prove that the generating vector for a lattice rule can be constructed component-by-component to achieve the optimal rate of convergence. Many remarks are given.
- A new Nyström-type method for Fredholm integral equations of the second kind
- A Nyström method for Fredholm integral equations on the real line
- On Nyström and product integration methods for Fredholm integral equations
- On approximation and numerical solution of Fredholm integral equations of second kind using quasi-interpolation
- Fast solution methods for Fredholm integral equations of the second kind
- Complexity of integral equations and relations to \(s\)-numbers
- Complexity of local solution of multivariate integral equations
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Fast Boolean approximation methods for solving integral equations in high dimensions
- Good lattice rules in weighted Korobov spaces with general weights
- scientific article; zbMATH DE number 4076564 (Why is no real title available?)
- scientific article; zbMATH DE number 3728384 (Why is no real title available?)
- scientific article; zbMATH DE number 3362487 (Why is no real title available?)
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- Lattice rule algorithms for multivariate approximation in the average case setting
- Lattice rules for multivariate approximation in the worst case setting
- On the convergence rate of the component-by-component construction of good lattice rules
- Properties of certain trigonometric series arising in numerical analysis
- Simultaneous approximation of functions and their (?, ?)-derivatives by Fourier sums
- The complexity of Fredholm equations of the second kind: noisy information about everything
- Tractability of approximation for weighted Korobov spaces on classical and quantum computers
- Tractability of multivariate integration for weighted Korobov classes
- Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
- Tractability of the Fredholm problem of the second kind
- Robust projection method for Fredholm integral equation of the second kind
- On Nyström and product integration methods for Fredholm integral equations
- Ian Sloan and Lattice Rules
- Integral equations, quasi-Monte Carlo methods and risk modeling
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Worst case error for integro-differential equations by a lattice-Nyström method
- The method of moments for solution of second kind Fredholm integral equations based on B-spline wavelets
- Spherical configurations and quadrature methods for integral equations of the second kind
- Comparison of two search criteria for lattice-based kernel approximation
- L₂-approximation using randomized lattice algorithms
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
This page was built for publication: Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465302)
