On the informational and algorithmic complexities of some classes of Fredholm equations of the first kind

DOI10.15407/DOPOVIDI2014.09.033zbMATH Open1313.65340OpenAlexW2510504611MaRDI QIDQ2933224

Author name not available (Why is that?)

Publication date: 10 December 2014

Published in: Reports of the National Academy of Sciences of Ukraine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15407/dopovidi2014.09.033

zbMATH Keywords

projection schemeill-posed problemFredholm equationalgorithmic complexities

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Numerical methods for ill-posed problems for integral equations (65R30) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20) Linear integral equations (45A05)

Related Items (4)

The complexity of Fredholm equations of the second kind: noisy information about everything ⋮ Information complexity of equations of the second kind with compact operators in Hilbert space ⋮ The exact order of information-based complexity of weakly singular integral equations with periodic analytic coefficients ⋮ The information complexity of the local solution of Fredholm integral equations with analytic kernels and free terms

This page was built for publication: On the informational and algorithmic complexities of some classes of Fredholm equations of the first kind

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933224)