Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs with Guaranteed Precision

07/01/2018
by   Svetlana Selivanova, et al.
0

We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in in our revious publications where computability, in the rigorous sense of computable analysis, has been established for solution operators of Cauchy and dissipative boundary-value problems for such systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2016

Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients

Implicit schemes are popular methods for the integration of time depende...
research
04/22/2020

Algorithms yield upper bounds in differential algebra

Consider an algorithm computing in a differential field with several com...
research
10/03/2022

Nonlinear Reconstruction for Operator Learning of PDEs with Discontinuities

A large class of hyperbolic and advection-dominated PDEs can have soluti...
research
08/08/2022

Extensions of derivations and symmetric operators

Given a densely defined skew-symmetric operators A 0 on a real or comple...
research
07/16/2020

Numerical approximation of port-Hamiltonian systems for hyperbolic or parabolic PDEs with boundary control

The present manuscript concerns the design of structure-preserving discr...
research
09/13/2021

Learning reduced order models from data for hyperbolic PDEs

Given a set of solution snapshots of a hyperbolic PDE, we are interested...

Please sign up or login with your details

Forgot password? Click here to reset