Abstract
We study Turing computability of the nonlinear solution operator S of the Cauchy problem for the Schrödinger equation of the form
in ℝ.We prove that S is a computable operator from H1(ℝ) to C(ℝH 1(ℝ))with respect to the canonical representations.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrzej Grzegorczyk On the definitions of computable real continuous functions. Fundamenta Mathematicae, 44:61–71, 1957.
J. Ginibre and G. Velo On a class of nonlinear Schrödinger equations. i. the Cauchy problem, general case. Journal of Functional Analysis, 32(1):1–32, 1979.
Ker-I Ko Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.
Christoph Kreitz and Klaus Weihrauch Theory of representations. Theoretical Computer Science, 38:35–53, 1985.
Marian B. Pour-El and J. Ian Richards Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
Alan M. Turing On computable numbers, with an application to the “Entscheidungsproblem”. Proceedings of the London Mathematical Society, 42(2):230–265, 1936.
Klaus Weihrauch Computable Analysis. Springer, Berlin, 2000.
Klaus Weihrauch and Ning Zhong The wave propagator is Turing computable. Lecture Notes in Computer Science, Vol.1644, 697–706, 1999.
Ning Zhong and Klaus Weihrauch Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen, September 2000.
Klaus Weihrauch and Ning Zhong Turing computability of a nonlinear Schrödinger propagator. Informatik Berichte, FernUniversität Hagen, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihrauch, K., Zhong, N. (2001). Turing Computability of a Nonlinear Schrödinger Propagator. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_66
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive