Computability in linear algebra
DOI10.1016/J.TCS.2004.06.022zbMATH Open1063.03047OpenAlexW2080180423MaRDI QIDQ703545FDOQ703545
Authors: Martin Ziegler, Vasco Brattka 
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
Recommendations
- scientific article; zbMATH DE number 2079882
- Complexity of Solving Linear Systems in Different Models of Computation
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- A tutorial on computable analysis
- Real computation with least discrete advice: a complexity theory of nonuniform computability
stabilitycomputable analysislinear algebradistance functionlinear equationsreal number computationrational approximationsmatrix diagonalizationspectral resolution
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Error analysis and interval analysis (65G99) Constructive and recursive analysis (03F60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Title not available (Why is that?)
- Modern computer algebra
- On the definitions of computable real continuous functions
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Analytic machines
- Title not available (Why is that?)
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Title not available (Why is that?)
- On computations with integer division
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (27)
- Computing conformal maps of finitely connected domains onto canonical slit domains
- Computational complexity of classical solutions of partial differential equations
- On envelopes and backward approximations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval Linear Algebra and Computational Complexity
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Computability Models: Algebraic, Topological and Geometric Algorithms
- Relative computability and uniform continuity of relations
- Effectively open real functions
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Computability of the metric projection onto finite-dimensional linear subspaces
- Computational Complexity and Numerical Stability of Linear Problems
- Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
- Title not available (Why is that?)
- Computing the exact number of periodic orbits for planar flows
- Computability and the Implicit Function Theorem
- On the complexity of robust eventual inequality testing for C-finite functions
- Title not available (Why is that?)
- Beta-shifts, their languages, and computability
- Computability of finite-dimensional linear subspaces and best approximation
- Computer Science for Continuous Data
- Computing finite-dimensional realizations
- Computability, noncomputability, and hyperbolic systems
- Calculating proofs on a computer in studies of the properties of linear mappings in finite-dimensional spaces
- Real computation with least discrete advice: a complexity theory of nonuniform computability
This page was built for publication: Computability in linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703545)
