Computability in linear algebra

DOI10.1016/j.tcs.2004.06.022zbMath1063.03047OpenAlexW2080180423MaRDI QIDQ703545

Vasco Brattka, Martin Ziegler

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.022

zbMATH Keywords

stabilitylinear equationslinear algebradistance functioncomputable analysisreal number computationrational approximationsmatrix diagonalizationspectral resolution

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Constructive and recursive analysis (03F60) Iterative numerical methods for linear systems (65F10) Error analysis and interval analysis (65G99)

Related Items (17)

Computability Models: Algebraic, Topological and Geometric Algorithms ⋮ Effectively open real functions ⋮ Relative computability and uniform continuity of relations ⋮ Computing the exact number of periodic orbits for planar flows ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Beta-shifts, their languages, and computability ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Computability of finite-dimensional linear subspaces and best approximation ⋮ Computability of the Solutions to Navier-Stokes Equations via Effective Approximation ⋮ Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces ⋮ Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus ⋮ Computing conformal maps of finitely connected domains onto canonical slit domains ⋮ Computability and the Implicit Function Theorem ⋮ Computability, noncomputability, and hyperbolic systems ⋮ Unnamed Item ⋮ On envelopes and backward approximations ⋮ Computational complexity of classical solutions of partial differential equations

Cites Work

• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Analytic machines
• Geometric algorithms and combinatorial optimization.
• On the definitions of computable real continuous functions
• On computations with integer division
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computability in linear algebra