Complexity Blowup for Solutions of the Laplace and the Diffusion Equation

12/01/2022
by   Aras Bacho, et al.
0

In this paper, we investigate the computational complexity of solutions to the Laplace and the diffusion equation. We show that for a certain class of initial-boundary value problems of the Laplace and the diffusion equation, the solution operator is #P-complete in the sense that it maps polynomial-time computable functions to the set of #P-complete functions. Consequently, there exists polynomial-time (Turing) computable input data such that the solution is not polynomial-time computable, unless FP=#P. In this case, we can, in general, not simulate the solution of the Laplace or the diffusion equation on a digital computer without having a complexity blowup, i.e., the computation time for obtaining an approximation of the solution with up to a finite number of significant digits grows exponentially in the number of digits. This shows that the computational complexity of the solution operator that models a physical phenomena is intrinsically high, independent of the numerical algorithm that is used to approximate a solution. This indicates that there is a fundamental problem in simulating physical phenomena on digital hardware.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2018

Complexity and mission computability of adaptive computing systems

There is a subset of computational problems that are computable in polyn...
research
05/03/2023

Complexity and Enumeration in Models of Genome Rearrangement

In this paper, we examine the computational complexity of enumeration in...
research
07/01/2023

On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions

We study the computational complexity of a robust version of the problem...
research
09/27/2022

A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations

In a recent article, the class of functions from the integers to the int...
research
05/16/2021

A Complete algorithm for local inversion of maps: Application to Cryptanalysis

For a map (function) F(x):^n→^n and a given y in the image of F the prob...
research
01/27/2023

Hydrodynamic and symbolic models of hypercomputation

Dynamical systems and physical models defined on idealized continuous ph...
research
12/22/2020

A numerical study of an Heaviside function driven degenerate diffusion equation

We analyze a nonlinear degenerate parabolic problem whose diffusion coef...

Please sign up or login with your details

Forgot password? Click here to reset