电邮这篇文章 On Constructive number fields and computability of solutions of PDEs
- 作者: Selivanova S.V.1,2, Selivanov V.L.2,3
-
隶属关系:
- Sobolev Institute of Mathematics, Siberian Branch
- Novosibirsk State University
- Ershov Institute of Informatic Systems, Siberian Branch
- 期: 卷 96, 编号 3 (2017)
- 页面: 580-582
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225423
- DOI: https://doi.org/10.1134/S1064562417060138
- ID: 225423
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
S. Selivanova
Sobolev Institute of Mathematics, Siberian Branch; Novosibirsk State University
编辑信件的主要联系方式.
Email: s_seliv@math.nsc.ru
俄罗斯联邦, Novosibirsk, 630090; Novosibirsk, 630090
V. Selivanov
Novosibirsk State University; Ershov Institute of Informatic Systems, Siberian Branch
Email: s_seliv@math.nsc.ru
俄罗斯联邦, Novosibirsk, 630090; Novosibirsk, 630090
补充文件
