24 citations · 24 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 24 cited
Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms
Jonathan Ben-Artzi, Matthew J. Colbrook, Anders C. Hansen +2
This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the…
math.FA2015
Polynomial as a new variable - a Banach algebra with a functional calculus
Olavi Nevanlinna
Given any square matrix or a bounded operator in a Hilbert space such that is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $…