A computational problem in the SCI hierarchy is a quadruple
Here is the primary set of inputs, is the set of permitted evaluation functions, is the output metric space, and is the problem function. The Solvability complexity index is defined from the minimum height of a tower of algorithms that computes from finite subsets of .
For the classical computational spectral problem, take
and
Since the spectrum of a bounded operator is a nonempty compact subset of the complex numbers, one may take to be the nonempty compact subsets of with the Hausdorff distance. The Attouch--Wets topology gives an equivalent convenient formulation on bounded spectral sets and also extends naturally to unbounded closed sets. This choice of makes convergence mean convergence of the whole spectrum as a set, including both the absence of persistent spectral pollution and the approximation of every genuine spectral point.

Articles by others on the same topic (0)

There are currently no matching articles.