Computational complexity of classical solutions of partial differential equations

DOI10.1007/978-3-031-08740-0_25OpenAlexW4285216747MaRDI QIDQ2104279

Svetlana V. Selivanova

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_25

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

On the main scientific achievements of Victor Selivanov ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of solving polynomial differential equations over unbounded domains
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Computability in linear algebra
• Primitive recursive ordered fields and some applications
• Exact real computation of solution operators for linear analytic systems of partial differential equations
• Computer-assisted proofs for semilinear elliptic boundary value problems
• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
• Computational complexity of real functions
• Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Computational complexity of real powering and improved solving linear differential equations
• Computability of Solutions of the Korteweg-de Vries Equation
• Complexity theory for operators in analysis
• Computational Complexity of Smooth Differential Equations
• Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
• 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
• Computational complexity on computable metric spaces
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
• Average-case polynomial-time computability of hamiltonian dynamics
• Computability of Differential Equations

This page was built for publication: Computational complexity of classical solutions of partial differential equations