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

DOI10.1007/978-3-319-94418-0_38OpenAlexW2811161635MaRDI QIDQ1670767

Svetlana V. Selivanova, Victor L. Selivanov

Publication date: 6 September 2018

Full work available at URL: https://arxiv.org/abs/1807.03140

zbMATH Keywords

eigenvalueeigenvectorsymbolic computationdifference schemesymmetric matrixguaranteed precisionsolution operatorsymmetric hyperbolic systembit complexityalgebraic real

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Initial value problems for first-order hyperbolic systems (35L45) Computation over the reals, computable analysis (03D78)

Related Items (5)

On the main scientific achievements of Victor Selivanov ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision ⋮ Computability of Differential Equations ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations ⋮ Searching for applicable versions of computable structures

This page was built for publication: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)