On Constructive number fields and computability of solutions of PDEs

Standard

On Constructive number fields and computability of solutions of PDEs. / Selivanova, S. V.; Selivanov, V. L.

в: Doklady Mathematics, Том 96, № 3, 01.11.2017, стр. 580-582.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Selivanova, SV & Selivanov, VL 2017, 'On Constructive number fields and computability of solutions of PDEs', Doklady Mathematics, Том. 96, № 3, стр. 580-582. https://doi.org/10.1134/S1064562417060138

APA

Selivanova, S. V., & Selivanov, V. L. (2017). On Constructive number fields and computability of solutions of PDEs. Doklady Mathematics, 96(3), 580-582. https://doi.org/10.1134/S1064562417060138

Vancouver

Selivanova SV, Selivanov VL. On Constructive number fields and computability of solutions of PDEs. Doklady Mathematics. 2017 нояб. 1;96(3):580-582. doi: 10.1134/S1064562417060138

Author

Selivanova, S. V. ; Selivanov, V. L. / On Constructive number fields and computability of solutions of PDEs. в: Doklady Mathematics. 2017 ; Том 96, № 3. стр. 580-582.

BibTeX

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

note = "Publisher Copyright: {\textcopyright} 2017, Pleiades Publishing, Ltd.",

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

}

RIS

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 -

ID: 9069093