论文信息 - On Constructive number fields and computability of solutions of PDEs

On Constructive number fields and computability of solutions of PDEs

In this paper we find a connection between constructive number fields and computable reals. This connection is applied to prove the computability in the rigorous sense of computable analysis) of solutions of some important systems of partial differential equations, by means of algorithms which are really used in numerical analysis.

V. L. Selivanov | V. Selivanov | S. Selivanova | S. V. Selivanova

[1] K. Friedrichs. Symmetric hyperbolic linear differential equations , 1954 .

[2] Klaus Weihrauch,et al. A Tutorial on Computable Analysis , 2008 .

[3] Vasilii S Vladimirov. Equations of mathematical physics , 1971 .

[4] Edward R. Griffor. Handbook of Computability Theory , 1999, Handbook of Computability Theory.

[5] Viggo Stoltenberg-Hansen,et al. Computable Rings and Fields , 1999, Handbook of Computability Theory.

[6] Benedikt Löwe,et al. New Computational Paradigms , 2005 .

[7] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[8] J. Strikwerda. Finite Difference Schemes and Partial Differential Equations, Second Edition , 2004 .

[9] J. Strikwerda. Finite Difference Schemes and Partial Differential Equations , 1989 .

[10] W. D. Evans,et al. PARTIAL DIFFERENTIAL EQUATIONS , 1941 .

[11] Robert L. Grossman,et al. Timed Automata , 1999, CAV.

[12] Martin Ziegler,et al. A Computable Spectral Theorem , 2000, CCA.