arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.19965cs.DScs.SYeess.SY
收藏

区间方法在求解不确定非线性系统中的计算复杂性分析

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems

Indian Institute of Technology Delhi(印度德里理工学院)

Rudra Prakash, S. Janardhanan, Shaunak Sen

AI总结:

本文分析了求解不确定非线性系统和稳态围护的区间方法的计算复杂性,推导了区间二分法、细分+过滤、区间约束传播、区间牛顿和区间Krawczyk等方法的最坏时间与空间界限,并探讨了其在生物化学稳态模型中的应用。

摘要:

本文分析了验证区间方法在求解不确定非线性系统和稳态围护中的计算复杂性。区间分析能够产生考虑不确定性和舍入误差的保证围护,但其在高维问题中常受限于计算成本。本文开发了一个算法层面的最坏情况框架,明确表征了问题维度n、初始搜索区域大小Vol(X0)、目标容差ε以及验证基本操作(包含函数评估、雅可比评估和区间线性代数)的成本之间的依赖关系。在该框架下,推导了区间二分法、细分+过滤、区间约束传播、区间牛顿和区间Krawczyk等方法的最坏时间与空间界限,并识别了主要成本驱动因素。此外,本文还展示了通过朴素拉普拉斯展开计算区间矩阵的行列式和逆矩阵时,随着矩阵维度的增加,其计算复杂性呈阶乘增长,从而推动了专用区间线性代数的发展。本文还补充了在两个应用导向的生物化学稳态模型(一种Hill型调控网络和一种基于酶饱和的赢家通吃电路)中,对于n∈{2,5,10}维度的计算结果,包括处理数百万个盒子的实例。所得分析和实验支持了针对不确定性强稳态筛选任务(如鲁棒操作点认证和多稳态评估)的验证求解器的实用设计。

英文摘要:

This paper analyzes the computational complexity of validated interval methods for uncertain nonlinear systems and steady-state enclosure. Interval analysis produces guaranteed enclosures that account for uncertainty and round-off, but its adoption is often limited by computational cost in high dimensions. We develop an algorithm-level worst-case framework that makes explicit the dependence on the problem dimension $n$, the initial search region size $\mathrm{Vol}(X_0)$, the target tolerance $\varepsilon$, and the costs of validated primitives (inclusion-function evaluation, Jacobian evaluation, and interval linear algebra). Within this framework, we derive worst-case time and space bounds for interval bisection, subdivision$+$filter, interval constraint propagation, interval Newton, and interval Krawczyk, and identify dominant cost drivers. We also show that the computation of the determinant and inverse of interval matrices via naive Laplace expansion exhibits factorial growth with increasing matrix dimension, motivating specialized interval linear algebra. We complement the worst-case bounds with computational results on two application-motivated biochemical steady-state models (a Hill-type regulatory network and an enzyme-saturation-based winner-take-all circuit) in dimensions $n\in\{2,5,10\}$, including instances that process millions of boxes. The resulting analysis and experiments support the practical design of validated solvers for uncertainty-aware steady-state screening tasks such as robust operating-point certification and multistability assessment.

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

↑