Computational complexity of classical solutions of partial differential equations

DOI10.1007/978-3-031-08740-0_25MaRDI QIDQ2104279zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A tutorial on computable analysis
• Average-case polynomial-time computability of Hamiltonian dynamics
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Complexity theory for operators in analysis
• Complexity theory for spaces of integrable functions
• Computability in linear algebra
• Computability of Differential Equations
• Computability of Solutions of the Korteweg-de Vries Equation
• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
• Computational complexity of real functions
• Computational complexity of real powering and improved solving linear differential equations
• Computational complexity of solving polynomial differential equations over unbounded domains
• Computational complexity on computable metric spaces
• Computer-assisted proofs for semilinear elliptic boundary value problems
• Computing over the reals: foundations for scientific computing.
• Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
• Exact real computation of solution operators for linear analytic systems of partial differential equations
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1746043 (Why is no real title available?)
• scientific article; zbMATH DE number 1390542 (Why is no real title available?)
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• On the computational complexity of the Dirichlet problem for Poisson's equation
• Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
• Primitive recursive ordered fields and some applications
• Solving analytic differential equations in polynomial time over unbounded domains
• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104279)