耗散哈密顿系统的距离问题及相关的矩阵多项式
Distance problems for dissipative Hamiltonian systems and related matrix polynomials
摘要:
研究了具有耗散Hamilton结构的线性微分-代数系统的几个距离问题的特征.由于所有的模型都只是近似的现实和数据总是不准确的,这是一个重要的问题,是否一个给定的模型是接近一个“坏”的模型,可以被认为是不适定或奇异。这通常通过计算到具有此类属性的最近模型的距离来完成。我们将讨论耗散哈密顿系统到奇点的距离和到最近高指标的距离问题。虽然对于一般的非结构化微分代数系统的这些距离的特征是部分开放的问题,我们将表明,耗散哈密顿系统和相关的矩阵多项式存在明确的特征,可以实现数字。
英文摘要:
We study the characterization of several distance problems for linear differential-algebraic systems with dissipative Hamiltonian structure. Since all models are only approximations of reality and data are always inaccurate, it is an important question whether a given model is close to a 'bad' model that could be considered as ill-posed or singular. This is usually done by computing a distance to the nearest model with such properties. We will discuss the distance to singularity and the distance to the nearest high index problem for dissipative Hamiltonian systems. While for general unstructured differential-algebraic systems the characterization of these distances are partially open problems, we will show that for dissipative Hamiltonian systems and related matrix polynomials there exist explicit characterizations that can be implemented numerically.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。