Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
Svetlana Selivanova, Victor Selivanov · Computability · 2021
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.