The worst case complexity of the fredholm equation with periodic free term and noisy information∗

DOI10.1080/00207169908804876MaRDI QIDQ4935386zbMATH OpenOpenAlexFDO

Authors Tianzi Jiang, D. J. Evans

Publication date 10 October 2000

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804876

zbMATH Keywords

computational complexityFredholm equationGalerkin methodinformation theoryinformation-based complexitynoisy information

Mathematics Subject Classification ID

Fredholm integral equations (45B05) Numerical methods for integral equations (65R20) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
• The complexity of Fredholm equations of the second kind: noisy information about everything
• Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
• scientific article; zbMATH DE number 1165599
• The average case complexity of the Fredholm equation of second kind with free term in H^ r()

Cites work

• Complexity of differential and integral equations
• Complexity of local solution of multivariate integral equations
• Computing the topological degree with noisy information
• Computing topological degree using noisy information
• How to benefit from noise
• scientific article; zbMATH DE number 4069484 (Why is no real title available?)
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• Information complexity of multivariate Fredholm integral equations in Sobolev classes
• Information-based complexity: New questions for mathematicians
• Linear integral equations
• Probabilistic complexity analysis for linear problems in bounded domains
• The average case complexity of the Fredholm equation of second kind with free term in H^ r()
• The complexity of definite elliptic problems with noisy data
• The complexity of indefinite elliptic problems with noisy data
• The minimal radius of Galerkin information for the Fredholm problem of the first kind
• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
• Worst case complexity of problems with random information noise

Cited in

(7)

• 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
• Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
• Information complexity of multidimensional Fredholm integral equations with harmonic coefficients
• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
• On the neighbour-integrity of sequential joined graphs
• The complexity of Fredholm equations of the second kind: noisy information about everything

This page was built for publication: The worst case complexity of the fredholm equation with periodic free term and noisy information^∗

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