On the computational complexity of the Dirichlet Problem for Poisson's Equation

DOI10.1017/S096012951600013XzbMath1456.03069MaRDI QIDQ4593239

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Integration and disintegration of measures (28A50) Computation over the reals, computable analysis (03D78)

Related Items

Primitive recursive ordered fields and some applications ⋮ 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 ⋮ Computability of Differential Equations ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations

Cites Work

• 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
• Towards computability of elliptic boundary value problems in variational formulation
• The computational complexity of maximization and integration
• Parallel computation with threshold functions
• The maximum value problem and NP real numbers
• Computational complexity of real functions
• On the computational complexity of integral equations
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
• Computational Complexity of Smooth Differential Equations
• Complexity Theory for Operators in Analysis
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• On Computability of Navier-Stokes’ Equation
• On the definitions of computable real continuous functions
• PP is as Hard as the Polynomial-Time Hierarchy
• Elliptische Differentialgleichungen zweiter Ordnung
• Derivatives of Computable Functions
• On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
• Computable analysis of the abstract Cauchy problem in a Banach space and its applications I
• Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
• An Algorithm for Computing Fundamental Solutions