Email this article On Constructive number fields and computability of solutions of PDEs
- Authors: Selivanova S.V.1,2, Selivanov V.L.2,3
-
Affiliations:
- Sobolev Institute of Mathematics, Siberian Branch
- Novosibirsk State University
- Ershov Institute of Informatic Systems, Siberian Branch
- Issue: Vol 96, No 3 (2017)
- Pages: 580-582
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225423
- DOI: https://doi.org/10.1134/S1064562417060138
- ID: 225423
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
S. V. Selivanova
Sobolev Institute of Mathematics, Siberian Branch; Novosibirsk State University
Author for correspondence.
Email: s_seliv@math.nsc.ru
Russian Federation, Novosibirsk, 630090; Novosibirsk, 630090
V. L. Selivanov
Novosibirsk State University; Ershov Institute of Informatic Systems, Siberian Branch
Email: s_seliv@math.nsc.ru
Russian Federation, Novosibirsk, 630090; Novosibirsk, 630090
