A Computable Spectral Theorem

@inproceedings{Ziegler2000ACS,
  title={A Computable Spectral Theorem},
  author={Martin Ziegler and Vasco Brattka},
  booktitle={CCA},
  year={2000}
}
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however… 
Computability in linear algebra
TLDR
These results yield algorithms which solve systems of linear equations A ċ x = b, determine the spectral resolution of a symmetric matrix B, and compute a linear subspace's dimension from its Euclidean distance function, provided the rank of A and the number of distinct eigenvalues of B are known.
Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
  • Ruth Dillhage
  • Computer Science, Mathematics
    Electron. Notes Theor. Comput. Sci.
  • 2008
TLDR
It is proved that given a ''program'' of the operator one can obtain positive information on the spectrum as a compact set in the sense that a dense subset of the spectrum can be enumerated and a bound on the set can be computed.
Uniformly Computable Aspects of Inner Functions
  • T. McNicholl
  • Computer Science, Mathematics
    Electron. Notes Theor. Comput. Sci.
  • 2008
TLDR
A uniformly computable version of Frostman's Theorem is given and it is claimed that for an inner function u, the Blaschke sum of u provides the exact amount of information necessary to compute the factorization of u.
Computability of the Spectrum of Self-Adjoint Operators
TLDR
It is proved that given a “program” of the operator one can obtain positive information on the spectrum as a compact set in the sense that a dense subset of the spectrum can be enumerated and a bound on the set can be computed.
Computability of Linear Equations
TLDR
It turns out that, given the coefficients of a system of linear equations, the authors can compute the space of solutions, if and only if the dimension of the solution space is known in advance.
Stability versus speed in a computable algebraic model
  • M. Ziegler
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2006
TLDR
This work shows that solving the geometric point location problem among hyperplanes by means of a total computable decision tree has in general complexity exponentially larger than when permitting the tree to be partial, that is, to diverge on a 'small' set of arguments.
Computability of Linear Equations
Do the solutions of linear equations depend computably on their coefficients? Implicitly, this has been one of the central questions in linear algebra since the very beginning of the subject and the
Computability of Banach space principles
We investigate the computable content of certain theorems which are sometimes called the \principles" of the theory of Banach spaces. Among these the main theorems are the Open Mapping Theorem, the
Effective representations of the space of linear bounded operators
Representations of topological spaces by infinite sequences of symbols are used in computable analysis to describe computations in topological spaces with the help of Turing machines. From the
Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE
TLDR
Using the difference equations approach, it is proved computability of the operator that sends any initial function ϕ ∈ C p+1 (Q, R n ) (satisfying certain conditions), p ≥ 2, to the unique solution u ∆ C p (H, Rn ), where Q =( 0, 1) m and H is the nonempty domain of correctness of the system.
...
1
2
3
...

References

SHOWING 1-10 OF 29 REFERENCES
Computing the Dimension of Linear Subspaces
TLDR
The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions, and investigate in which sense the dimension of a given linear subspace can be computed.
Computability of Linear Equations
TLDR
It turns out that, given the coefficients of a system of linear equations, the authors can compute the space of solutions, if and only if the dimension of the solution space is known in advance.
Complexity Theory of Real Functions
  • K. Ko
  • Mathematics, Computer Science
    Progress in Theoretical Computer Science
  • 1991
TLDR
" polynomial complexity theory extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems.
Computability in analysis and physics
TLDR
This book represents the first treatment of computable analysis at the graduate level within the tradition of classical mathematical reasoning and is sufficiently detailed to provide an introduction to research in this area.
Computability on Subsets of Euclidean Space I: Closed and Compact Subsets
TLDR
The language and framework of Type 2 Theory of Effectivity (TTE) is used which supplies a concise language for distinguishing a variety of effectivity properties and which admits highly effective versions of classical theorems.
Algebraic Complexity Theory
  • V. Strassen
  • Mathematics, Computer Science
    Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
TLDR
This chapter discusses algebraic complexity theory, which unites two quite different traditions, that of straight-line program or arithmetic circuit or computation sequence and that of computation tree.
Computable Analysis: An Introduction
  • K. Weihrauch
  • Computer Science
    Texts in Theoretical Computer Science. An EATCS Series
  • 2000
TLDR
This book provides a solid fundament for studying various aspects of computability and complexity in analysis and is written in a style suitable for graduate-level and senior students in computer science and mathematics.
Algebraic complexity theory
This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified. Requiring of the reader only some basic algebra and
The Fundamental Theorem of Algebra in Recursive Analysis
N is the set of natural numbers. Q is the field of complex rational numbers, i.e. the field of numbers a+bi, where a and b are rational. A sequence σ of elements of Q (i.e. a function σ, σ o:N→Q) is
Spectral Graph Theory
Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigenvalues and quasi-randomness Expanders and explicit constructions Eigenvalues
...
1
2
3
...