Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces

DOI10.1016/j.entcs.2008.12.006zbMath1262.03136OpenAlexW1986000328MaRDI QIDQ4918004

Ruth Dillhage, Vasco Brattka

Publication date: 3 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.2008.12.006

zbMATH Keywords

best approximationmetric projectioncomputable functional analysis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Constructive functional analysis (46S30) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability in linear algebra
• Techniques of constructive analysis
• Borel complexity and computability of the Hahn-Banach theorem
• On the foundations of best approximation theory
• A constructive proximinality property of finite-dimensional linear subspaces
• Computability on subsets of metric spaces.
• Plottable Real Number Functions and the Computable Graph Theorem
• Computational complexity on computable metric spaces

This page was built for publication: Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces