Computability in linear algebra
Martin Ziegler,Vasco Brattka +1 more
53
TL;DR: 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.
read more
About: This article is published in Theoretical Computer Science. The article was published on 20 Oct 2004. and is currently open access. The article focuses on the topics: Numerical linear algebra & System of linear equations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Tutorial on Computable Analysis
Vasco Brattka,Peter Hertling,Klaus Weihrauch +2 more
- 01 Jan 2008
214
•Journal Article
Elementary Computable Topology
Klaus Weihrauch,Tanja Grubba +1 more
TL;DR: This work revise and extend the foundation of computable topology in the frame- work of Type-2 theory of effectivity, TTE, where continuity and computability on finite and infinite sequences of symbols are defined canonically and transferred to abstract sets by means of notations and representations.
•Posted Content
Relative Computability and Uniform Continuity of Relations
Arno Pauly,Martin Ziegler +1 more
TL;DR: A concept of uniform continuity based on the Henkin quantifier is proposed and proved necessary for relative computability of compact real relations, which is a strict hierarchy of notions each necessary — and the ω-th level also sufficient — forrelative computability.
Relative computability and uniform continuity of relations
Arno Pauly,Martin Ziegler +1 more
TL;DR: In this article, the Henkin quantifier is used to prove the relative computability of real relations in the context of the Weierstrass Theorem (i.e., every real function f :[0, 1]→ℝ is computable relative to some oracle).
Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra
TL;DR: This work turns folklore into a both topological and combinatorial complexity theory of information, investigating for several practical problems how much advice is necessary and sufficient to render them computable.
28
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•Book
Perturbation theory for linear operators
Tosio Kato
- 01 Jan 1966
TL;DR: The monograph by T Kato as discussed by the authors is an excellent reference work in the theory of linear operators in Banach and Hilbert spaces and is a thoroughly worthwhile reference work both for graduate students in functional analysis as well as for researchers in perturbation, spectral, and scattering theory.
22K
On Computable Numbers, with an Application to the Entscheidungsproblem
TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
•Book
Handbook of theoretical computer science
J. Van Leeuwen
- 19 Dec 1990
TL;DR: The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field.
4.3K
•Book
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel,László Lovász,Alexander Schrijver +2 more
- 01 Jan 1988
TL;DR: In this article, the Fulkerson Prize was won by the Mathematical Programming Society and the American Mathematical Society for proving polynomial time solvability of problems in convexity theory, geometry, and combinatorial optimization.
3.9K
Related Papers (5)
[...]
Klaus Weihrauch
- 01 Jan 2000
Marian Boykan Pour-El,J. Ian Richards +1 more
- 01 Jan 1989
Klaus Weihrauch
- 12 Mar 2014
Ker-I Ko
- 01 Jan 1991
Vasco Brattka,Gero Presser +1 more