On Constructive number fields and computability of solutions of PDEs

S. V. Selivanova; V. L. Selivanov

doi:10.1134/S1064562417060138

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.

Язык оригинала	английский
Страницы (с-по)	580-582
Число страниц	3
Журнал	Doklady Mathematics
Том	96
Номер выпуска	3
DOI	https://doi.org/10.1134/S1064562417060138
Состояние	Опубликовано - 1 ноя 2017

Доступ к документу

10.1134/S1064562417060138

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «On Constructive number fields and computability of solutions of PDEs». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@article{53a19d490e89441ea3adf1b21c9e5b56,

title = "On Constructive number fields and computability of solutions of PDEs",

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.",

author = "Selivanova, {S. V.} and Selivanov, {V. L.}",

year = "2017",

month = nov,

day = "1",

doi = "10.1134/S1064562417060138",

language = "English",

volume = "96",

pages = "580--582",

journal = "Doklady Mathematics",

issn = "1064-5624",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "3",

}

TY - JOUR

T1 - On Constructive number fields and computability of solutions of PDEs

AU - Selivanova, S. V.

AU - Selivanov, V. L.

PY - 2017/11/1

Y1 - 2017/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85040029417&partnerID=8YFLogxK

U2 - 10.1134/S1064562417060138

DO - 10.1134/S1064562417060138

M3 - Article

AN - SCOPUS:85040029417

VL - 96

SP - 580

EP - 582

JO - Doklady Mathematics

JF - Doklady Mathematics

SN - 1064-5624

IS - 3

ER -