Computable analysis of the abstract Cauchy problem in a Banach space and its applications I

Mathematical Logic Quarterly 53 (4‐5):511-531 (2007)
  Copy   BIBTEX

Abstract

We study computability of the abstract linear Cauchy problem equation image)where A is a linear operator, possibly unbounded, on a Banach space X. We give necessary and sufficient conditions for A such that the solution operator K: x ↦ u of the problem is computable. For studying computability we use the representation approach to computable analysis developed by Weihrauch and others. This approach is consistent with the model used by Pour-El/Richards

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 105,925

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
Computability of solutions of operator equations.Volker Bosserhoff - 2007 - Mathematical Logic Quarterly 53 (4):326-344.
A computable version of Banach’s Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2-3):85-96.
Computable Riesz representation for the dual of C [0; 1].Hong Lu & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4):415-430.
Completion of choice.Vasco Brattka & Guido Gherardi - 2021 - Annals of Pure and Applied Logic 172 (3):102914.

Analytics

Added to PP
2013-11-03

Downloads
41 (#609,234)

6 months
4 (#1,001,502)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations