On the average case solvability of ill-posed problems

DOI10.1016/0885-064X(91)90033-TzbMath0746.65048OpenAlexW1995458729MaRDI QIDQ1179452

Arthur G. Werschulz, Klaus Ritter, Mark A. Kon

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90033-t

zbMATH Keywords

algorithmsHilbert spaceBanach spaceill-posed problemoptimal informationworst case settingaverage case of probabilistic settingepsilon complexityzero-mean Gaussian measure

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Complexity and performance of numerical algorithms (65Y20)

Related Items

Linear ill-posed problems are solvable on the average for all Gaussian measures ⋮ Integration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functions ⋮ Computability of Solutions of Operator Equations ⋮ On linear spline algorithms of computerized tomography in the space of \(n\)-orbits

Cites Work

• What is the complexity of ill-posed problems?
• Elliptically contoured measures on infinite-dimensional Banach spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the average case solvability of ill-posed problems