Bit-complexity of solving systems of linear evolutionary partial differential equations
type: Item
instance of: scholarly article
title: Bit-complexity of solving systems of linear evolutionary partial differential equations
DOI: 10.1007/978-3-030-79416-3_13
author: Ivan Koswara
author: Martin Ziegler
author: Gleb Pogudin
author: Svetlana V. Selivanova
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7493533
zbMATH Keywords: reliable computing
zbMATH Keywords: bit-cost
zbMATH Keywords: partial differential equations
MaRDI profile type: Publication
full work available at URL: 978-3-030-79416-3 13
OpenAlex ID: W3174796108
cites work: Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
cites work: Q3373046
cites work: Q4399897
cites work: Q4721569
cites work: Q3068316
cites work: Lipschitz continuous ordinary differential equations are polynomial-space complete
cites work: Complexity Theory for Operators in Analysis
cites work: Computational Complexity of Smooth Differential Equations
cites work: Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
cites work: Complexity Theory of (Functions on) Compact Metric Spaces
cites work: On the computational complexity of the Dirichlet Problem for Poisson's Equation
cites work: Average-case polynomial-time computability of hamiltonian dynamics
cites work: Q4002474
cites work: Q3265072
cites work: Computational complexity of real powering and improved solving linear differential equations
cites work: On circulant matrices
cites work: Q5755052
cites work: Maximum norm error estimates of efficient difference schemes for second-order wave equations
cites work: Specified precision polynomial root isolation is in NC
cites work: The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
cites work: The wave equation with computable initial data such that its unique solution is not computable
cites work: The complexity of satisfiability problems
cites work: Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
cites work: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
cites work: Q4663944
cites work: Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
cites work: Q4485693
cites work: Computational complexity on computable metric spaces
cites work: IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
cites work: Q4532000
Recommended article: Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
Recommended article: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
Recommended article: Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
Recommended article: On the Bit Complexity of Solving Bilinear Polynomial Systems
Recommended article: Q3536054
Recommended article: The bit-cost of some algorithms for the solution of linear systems
Recommended article: Q4352814
Recommended article: Linear complexity solution of parabolic integro-differential equations
Recommended article: On the bit complexity of polynomial system solving
Recommended article: The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
description: scientific article; zbMATH DE number 7493533