Are unbounded linear operators computable on the average for Gaussian measures?

DOI10.1016/j.jco.2007.12.004zbMath1155.65115OpenAlexW2091063198MaRDI QIDQ945917

Volker Bosserhoff

Publication date: 19 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.jco.2007.12.004

zbMATH Keywords

ill-posed problemsGaussian measurescomputable analysis

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Complexity and performance of numerical algorithms (65Y20) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items

Computable Measure Theory and Algorithmic Randomness

Cites Work

• Towards computability of elliptic boundary value problems in variational formulation
• Computable invariance
• Computability on the probability measures on the Borel sets of the unit interval
• The real number model in numerical analysis
• What is the complexity of ill-posed problems?
• Effective representations of the space of linear bounded operators
• Notions of Probabilistic Computability on Represented Spaces
• Computability of solutions of operator equations
• Admissible representations for probability measures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item