Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision-Reference-Cited by-同舟云学术

Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision

Published:2021-04-16 Issue:2 Volume:10 Page:123-140
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Selivanova Svetlana¹,Selivanov Victor²

Affiliation:

1. School of Computing, KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea. sseliv@kaist.ac.kr

2. Theoretical Programming Laboratory, A.P. Ershov Institute of Informatics Systems SB RAS, 6 Acad. Lavrentjev pr., Novosibirsk 630090, Russia. vseliv@iis.nsk.su

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.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference47 articles.

1. A.G. Akritas, Elements of Computer Algebra with Applications, Wiley Interscience, New York, 1989.

2. Existence and uniqueness of structures computable in polynomial time;Alaev;Algebra and Logic,2016

3. Fields of algebraic numbers computable in polynomial time. I;Alaev;Algebra and Logic,2019

4. K.I. Babenko, in: Foundations of Numerical Analysis, Moscow, Nauka, 1986, (in Russian).

5. J.L. Balcázar, J. Díaz and J. Gabarró, Structural complexity I, in: EATCS Monographs on Theoretical Computer Science, Vol. 11, Springer-Verlag, 1988.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations;Journal of Complexity;2023-06

2. Primitive recursive ordered fields and some applications;Computability;2023-01-19

3. Computational Complexity of Classical Solutions of Partial Differential Equations;Revolutions and Revelations in Computability;2022

4. Primitive Recursive Ordered Fields and Some Applications;Computer Algebra in Scientific Computing;2021