Laplace方程与扩散方程解的复杂性爆炸
Complexity Blowup for Solutions of the Laplace and the Diffusion Equation
AI总结:
本文研究了Laplace方程和扩散方程解的计算复杂性,证明某类初边值问题的解算子是$\# P_1/ \#P$-完全的,揭示了在数字计算机上模拟这些方程解时必然发生复杂性爆炸,且该复杂性是解算子固有的,与数值算法无关。
摘要:
在本文中,我们研究了Laplace方程和扩散方程解的计算复杂性。我们证明,对于Laplace方程和扩散方程的某类初边值问题,其解算子是$\# P_1/ \#P$-完全的,即它将多项式时间可计算的函数映射到$\#P_1/ \#P$-完全函数集。因此,存在多项式时间(Turing)可计算的输入数据,使得其解不是多项式时间可计算的,除非$FP=\#P$或$FP_1=\#P_1$。在这种情况下,我们通常无法在数字计算机上模拟Laplace方程或扩散方程的解而不发生复杂性爆炸,即获取具有有限有效数字的解的近似值时,其计算时间随数字位数呈非多项式增长。这表明,对物理现象进行建模的解算子具有内在的高计算复杂性,与用于近似解的数值算法无关。
英文摘要:
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_1/ \#P$-complete in the sense that it maps polynomial-time computable functions to the set of $\#P_1/ \#P$-complete functions. Consequently, there exists polynomial-time (Turing) computable input data such that the solution is not polynomial-time computable, unless $FP=\#P$ or $FP_1=\#P_1$. 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 non-polynomially in the number of digits. This indicates 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。