Affiliations: [a] School of Computing, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea. [email protected] | [b] Theoretical Programming Laboratory, A.P. Ershov Institute of Informatics Systems SB RAS, 6 Acad. Lavrentjev pr., Novosibirsk 630090, Russia. [email protected]
Abstract: 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.