首页 | 本学科首页   官方微博 | 高级检索  
     


On Constructive number fields and computability of solutions of PDEs
Authors:S. V. Selivanova  V. L. Selivanov
Affiliation:1.Sobolev Institute of Mathematics, Siberian Branch,Russian Academy of Sciences,Novosibirsk,Russia;2.Novosibirsk State University,Novosibirsk,Russia;3.Ershov Institute of Informatic Systems, Siberian Branch,Russian Academy of Sciences,Novosibirsk,Russia
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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号