Computability of Solutions of Operator Equations

DOI10.1016/j.entcs.2006.08.013zbMath1262.03132OpenAlexW1993753732MaRDI QIDQ4921442

Volker Bosserhoff

Publication date: 10 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.013

zbMATH Keywords

regularizationGaussian measuresoperator equationscomputable functional analysis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Equations and inequalities involving linear operators, with vector unknowns (47A50) Constructive operator theory (47S30)

Cites Work

• Towards computability of elliptic boundary value problems in variational formulation
• On the average case solvability of ill-posed problems
• Gaussian mean boundedness of densely defined linear operators
• Computable invariance
• Linear ill-posed problems are solvable on the average for all Gaussian measures
• What is the complexity of ill-posed problems?
• On the small balls problem for equivalent Gaussian measures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computability of Solutions of Operator Equations