Bit-complexity of solving systems of linear evolutionary partial differential equations
From MaRDI portal
Publication:2117092
DOI10.1007/978-3-030-79416-3_13OpenAlexW3174796108MaRDI QIDQ2117092
Martin Ziegler, Ivan Koswara, Svetlana V. Selivanova, G. A. Pogudin
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_13
Related Items (5)
Primitive recursive ordered fields and some applications ⋮ Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Primitive recursive ordered fields and some applications ⋮ Computational complexity of classical solutions of partial differential equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Maximum norm error estimates of efficient difference schemes for second-order wave equations
- The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
- The wave equation with computable initial data such that its unique solution is not computable
- Specified precision polynomial root isolation is in NC
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Computational complexity of real powering and improved solving linear differential equations
- On Circulant Matrices
- Computational Complexity of Smooth Differential Equations
- Complexity Theory for Operators in Analysis
- Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- On the computational complexity of the Dirichlet Problem for Poisson's Equation
- Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
- Complexity Theory of (Functions on) Compact Metric Spaces
- Computational complexity on computable metric spaces
- Average-case polynomial-time computability of hamiltonian dynamics
- The complexity of satisfiability problems
This page was built for publication: Bit-complexity of solving systems of linear evolutionary partial differential equations
