arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.12140math.CAmath.OC
收藏

结构化非线性方程组

Structured Systems of Nonlinear Equations

Sana Jahedi, Timothy Sauer, James A. Yorke

AI总结:

本文研究结构化非线性方程组的鲁棒性,提出利用有向图中的前向和后向瓶颈(特别是极小极大瓶颈)来判断解的鲁棒性,并给出了定位及消除该瓶颈的数值方法与图论手段。

摘要:

在“结构化系统”的方程中,每个方程依赖于变量的特定子集。在本文中,我们探讨了具有固定结构的“几乎所有”系统所共有的性质,以及如何从相应的连接图中读取这些性质。如果系统 F(p)=c 的解 p 在 F 发生微小变化时依然保持,则称该解为鲁棒的。我们建立了确定鲁棒性的方法,该方法依赖于结构,正如在结构化系统相应的有向图性质中所表达的那样。理解线性和非线性结构化系统的关键是我们称之为前向瓶颈和后向瓶颈的变量子集。特别是,当结构化系统中的鲁棒性失效时,这是由于存在一个唯一的“后向瓶颈”,我们称之为“极小极大瓶颈”。我们提出了一种定位极小极大瓶颈的数值方法。我们展示了如何通过向图中添加边来消除它。

英文摘要:

In a "structured system" of equations, each equation depends on a specified subset of the variables. In this article, we explore properties common to "almost every" system with a fixed structure and how the properties can be read from the corresponding connection graph. A solution $p$ of a system $F(p)=c$ is called robust if it persists despite small changes in $F$. We establish methods for determining robustness that depends on the structure, as expressed in the properties of the corresponding directed graph of the structured system. The keys to understanding linear and nonlinear structured systems are subsets of variables that we call forward and backward bottlenecks. In particular, when robustness fails in a structured system, it is due to the existence of a unique "backward bottleneck", that we call a "minimax bottleneck". We present a numerical method for locating the minimax bottleneck. We show how to remove it by adding edges to the graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑