论文标题

如果时间是图形,那么进化方程将是什么样的?

If time were a graph, what would evolution equations look like?

论文作者

Hussein, Amru, Mugnolo, Delio

论文摘要

线性演进方程通常是在时间变量上定义在一个间隔上定义的时间变量,在该时间变量中通常需要溶液的初始条件或时间周期性才能单击某些解决方案。在这里,我们想在公制图或网络上定义时间,在分支点耦合条件上强加了时间,以便时间可以具有后果甚至循环。这不仅概括了经典设置,并允许在耦合方程的耦合和交互系统的建模中获得更多的自由,而且还为初始价值和时间周期性问题提供了统一的框架。对于这些时间表的库奇问题问题,有关抛物线问题的解决方案和解决方案的规律性问题,以及在哪些时间段的凯奇(Cauchy)问题无法将迭代性解决方案降低到库奇问题的迭代序列。基于两种不同的方法 - Kalton -weis定理在封闭操作员之和的应用程序上的应用以及对绿色函数的明确计算 - 我们介绍了主要的良好性和规律性结果。我们进一步研究解决方案的一些定性特性。虽然我们主要关注抛物线问题,但我们也解释了如何按照相同的行研究其他库奇问题。通过讨论与周期性类似于本地的限制的耦合系统,可以说明这一点。

Linear evolution equations are considered usually for the time variable being defined on an interval where typically initial conditions or time-periodicity of solutions are required to single out certain solutions. Here we would like to make a point of allowing time to be defined on a metric graph or network where on the branching points coupling conditions are imposed such that time can have ramifications and even loops. This not only generalizes the classical setting and allows for more freedom in the modeling of coupled and interacting systems of evolution equations, but it also provides a unified framework for initial value and time-periodic problems. For these time-graph Cauchy problems questions of well-posedness and regularity of solutions for parabolic problems are studied along with the question of which time-graph Cauchy problems cannot be reduced to an iteratively solvable sequence of Cauchy problems on intervals. Based on two different approaches - an application of the Kalton-Weis theorem on the sum of closed operators and an explicit computation of a Green's function - we present the main well-posedness and regularity results. We further study some qualitative properties of solutions. While we mainly focus on parabolic problems we also explain how other Cauchy problems can be studied along the same lines. This is exemplified by discussing coupled systems with constraints that are non-local in time akin to periodicity.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源