Information complexity of multivariate Fredholm integral equations in Sobolev classes

DOI10.1006/jcom.1996.0004zbMath0858.65131OpenAlexW1999228658MaRDI QIDQ1914157

Karin Frank, Stefan Heinrich, Sergei V. Pereverzyev

Publication date: 2 April 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ec0d4fc199b55ade2da2af3e973c4844c5e13ef4

zbMATH Keywords

algorithmnumerical examplesFredholm integral equations of the second kindinformation-based complexityexact order information complexityGelfand number technique

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20)

Related Items (21)

Where does smoothness count the most for Fredholm equations of the second kind with noisy information? ⋮ Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids ⋮ Fast discrete algorithms for sparse Fourier expansions of high dimensional functions ⋮ The complexity of Fredholm equations of the second kind: noisy information about everything ⋮ Tractability of the Fredholm problem of the second kind ⋮ On the complexity of boundary integral equations with analytic coefficients with logarithmic singularities ⋮ Widths between the anisotropic spaces and the spaces of functions with mixed smoothness ⋮ Fast sparse nonlinear Fourier expansions of high dimensional functions ⋮ What is the complexity of periodic weakly singular integral equations? ⋮ Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels ⋮ On the computation of the eigenproblems of hydrogen and helium in strong magnetic and electric fields with the sparse grid combination technique ⋮ The optimal approximations for solving linear ill-posed problems ⋮ 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^∗ ⋮ A version of the projection-iterative method for the solution of Fredholm integral equations of the second kind ⋮ Optimized general sparse grid approximation spaces for operator equations ⋮ A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation ⋮ Sparse grids for the Schrödinger equation ⋮ FAST SOLVERS OF WEAKLY SINGULAR INTEGRAL EQUATIONS OF THE SECOND KIND ⋮ A Quasi-Fast Solver for Weakly Singular Integral Equations of the Second Kind ⋮ The exact order of information-based complexity of weakly singular integral equations with periodic analytic coefficients

This page was built for publication: Information complexity of multivariate Fredholm integral equations in Sobolev classes