Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines (Q1770395)

From MaRDI portal
Revision as of 04:37, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
scientific article

    Statements

    Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines (English)
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    The Korteweg-de Vries (KdV) equation \(u_t + u u_t + u_{ttt} =0\) (\(t, x \in \mathbb{R}\)) with the initial condition \(u(x, 0)= \varphi(x)\) defines an operator which maps a function \(\varphi\) to the solution of the KdV equation. In Math. Log. Q. 47, No. 1, 93--110 (2001; Zbl 0970.03047), \textit{W. Gay, B.-Y. Zhang} and the second author show that this operator preserves the computability, i.e., it maps a computable initial function to the computable solution. This paper extends this result to a more uniform version, namely, this operator is actually a computable function from the Sobolev space \(H^s(\mathbb{R})\) with \(s\geq 3\) to the space \(C(\mathbb{R}, H^s(\mathbb{R}))\) of continuous function. This answers an open question of \textit{M. B. Pour-El} and \textit{J. I. Richards} [Computability in analysis and physics. Berlin etc.: Springer (1989; Zbl 0678.03027)].
    0 references
    KdV equation
    0 references
    computable operator
    0 references
    Turing machine
    0 references
    type 2 theory of effectivity
    0 references
    initial value problem
    0 references
    Sobolev spaces
    0 references

    Identifiers