On the computational complexity of the Dirichlet problem for Poisson's equation
From MaRDI portal
Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60) Integration and disintegration of measures (28A50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- An Algorithm for Computing Fundamental Solutions
- Complexity theory for operators in analysis
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Computable analysis of the abstract Cauchy problem in a Banach space and its applications I
- Computational complexity of real functions
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
- Derivatives of Computable Functions
- Elliptische Differentialgleichungen zweiter Ordnung
- scientific article; zbMATH DE number 3144514 (Why is no real title available?)
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- 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 176209 (Why is no real title available?)
- scientific article; zbMATH DE number 193842 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303206 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- On computability of Navier-Stokes' equation
- On the complexity of convex hulls of subsets of the two-dimensional plane
- On the computational complexity of integral equations
- On the definitions of computable real continuous functions
- Parallel computation with threshold functions
- PP is as Hard as the Polynomial-Time Hierarchy
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- The computational complexity of maximization and integration
- The maximum value problem and NP real numbers
- Towards computability of elliptic boundary value problems in variational formulation
Cited in
(9)- Computational complexity of classical solutions of partial differential equations
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Computability of Differential Equations
- Primitive recursive ordered fields and some applications
- Computer Science for Continuous Data
- Second-order parameterizations for the complexity theory of integrable functions
- A variational framework for the complexity of PDE solutions
- Primitive recursive ordered fields and some applications
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)
