Complexity issues for the symmetric interval eigenvalue problem

Abstrakt

We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with some approximation error.

Besides the classical absolute and relative approximation errors, which turn out not to be suitable for this problem, we adapt a less known one related to the relative error, and also propose a novel approximation error. We show in which error factors the problem is polynomially solvable and in which factors it becomes NP-hard.

Klíčová slova

• Interval matrix
• Interval analysis
• Eigenvalue
• Eigenvalue bounds
• NP-hardness