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

DOI

https://doi.org/10.1007/978-3-319-94418-0_38
Final published version

Svetlana V. Selivanova
Victor L. Selivanov

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.

Original language	English
Title of host publication	Sailing Routes in the World of Computation
Pages	376-385
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-319-94418-0_38
State	Published - 1 Jan 2018
Event	computability in europe, 2018 - Duration: 30 Jul 2018 → …

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Nature
Volume	10936
ISSN (Print)	0302-9743

Conference

Conference	computability in europe, 2018
Period	30/07/18 → …

Research areas

Algebraic real, Bit complexity, Difference scheme, Eigenvalue, Eigenvector, Guaranteed precision, Solution operator, Symbolic computations, Symmetric hyperbolic system, Symmetric matrix

ID: 126994848