The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information

DOI10.1080/01630569808816831zbMath0907.65133OpenAlexW2087420910MaRDI QIDQ4400144

Tianzi Jiang

Publication date: 4 March 1999

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

complexityFredholm integral equation of the second kindworst case settingminimal error algorithmnoisy finite element method

Mathematics Subject Classification ID

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

Related Items (3)

Where does smoothness count the most for Fredholm equations of the second kind with noisy information? ⋮ The complexity of Fredholm equations of the second kind: noisy information about everything ⋮ The worst case complexity of the fredholm equation with periodic free term and noisy information^∗

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing topological degree using noisy information
• Information-based complexity: New questions for mathematicians
• Complexity of differential and integral equations
• Computing the topological degree with noisy information
• Complexity of local solution of multivariate integral equations
• Information complexity of multivariate Fredholm integral equations in Sobolev classes
• The average case complexity of the Fredholm equation of second kind with free term in \(H^ r(\Gamma)\)
• The minimal radius of Galerkin information for the Fredholm problem of the first kind
• Worst case complexity of problems with random information noise
• The complexity of definite elliptic problems with noisy data
• How to benefit from noise

This page was built for publication: The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information