Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract)

dc.date.accessioned	2019-01-22T20:36:49Z
dc.date.available	2019-01-22T20:36:49Z
dc.date.issued	2018
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/147968
dc.description.abstract	© 2018, Springer International Publishing AG, part of Springer Nature. We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in our papers of 2009 and 2017, where computability, in the rigorous sense of computable analysis, has been established for solution operators of Cauchy and dissipative boundary-value problems for such systems.
dc.relation.ispartofseries	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subject	Algebraic real
dc.subject	Bit complexity
dc.subject	Difference scheme
dc.subject	Eigenvalue
dc.subject	Eigenvector
dc.subject	Guaranteed precision
dc.subject	Solution operator
dc.subject	Symbolic computations
dc.subject	Symmetric hyperbolic system
dc.subject	Symmetric matrix
dc.title	Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract)
dc.type	Conference Paper
dc.relation.ispartofseries-volume	10936 LNCS
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	376
dc.source.id	SCOPUS03029743-2018-10936-SID85051135764

Files in this item

Name: SCOPUS03029743-20 ...

Size: 47.83Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.