On the computational complexity of the Dirichlet problem for Poisson's equation

DOI10.1017/S096012951600013XzbMATH Open1456.03069MaRDI QIDQ4593239FDOQ4593239

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Publication date: 22 November 2017

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

Recommendations

• Solving the Dirichlet problem constructively
• scientific article; zbMATH DE number 953039
• Computational Complexity of Smooth Differential Equations
• Computational Complexity of Smooth Differential Equations
• The computational complexity of elliptic partial differential equations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Computational complexity of classical solutions of partial differential equations
• Primitive recursive ordered fields and some applications
• Primitive recursive ordered fields and some applications
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Computability of Differential Equations
• Computer Science for Continuous Data

This page was built for publication: On the computational complexity of the Dirichlet problem for Poisson's equation

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