arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.00349cs.CC
收藏

区间线性代数与计算复杂性

Interval Linear Algebra and Computational Complexity

Jaroslav Horáček, Milan Hladík, Michal Černý

摘要:

这项工作连接两个数学领域-计算复杂性和区间线性代数。它介绍了区间线性代数的基本主题-正则性和奇异性,满列秩,求解线性系统,确定线性系统的可解性,计算逆矩阵,特征值,检查正(半)定性或稳定性。我们从计算复杂性的角度讨论了这些问题以及它们之间的关系。区间线性代数中的许多问题是难以解决的,因此我们强调这些问题的子类是容易解决或判定的。这项工作的目的是提供一个基本的洞察力,这一领域,并提供进一步阅读和研究的材料。

英文摘要:

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding solvability of a linear system, computing inverse matrix, eigenvalues, checking positive (semi)definiteness or stability. We discuss these problems and relations between them from the view of computational complexity. Many problems in interval linear algebra are intractable, hence we emphasize subclasses of these problems that are easily solvable or decidable. The aim of this work is to provide a basic insight into this field and to provide materials for further reading and research.

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

↑