We establish upper bounds on bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs, combining symbolic and approximate algorithms to obtain the solutions with guaranteed prescribed precision. Restricting to algebraic real inputs allows us to use the classical ('discrete') bit complexity concept.
Original languageEnglish
Pages (from-to)123-140
Number of pages18
JournalComputability
Volume10
Issue number2
StatePublished - 1 Jan 2021

    Research areas

  • algebraic real, approximation, bit complexity, difference scheme, guaranteed precision, solution operator, spectral decomposition, symbolic computations, Symmetric hyperbolic system, symmetric matrix

ID: 126991209