MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Computing the dimension of linear subspaces (2000) [5 citations — 5 self]

Download:
Download as a PDF | Download as a PS
by Martin Ziegler, Vasco Brattka
In SOFSEM'2000: Theory and Practice of Informatics, Lecture Notes in Computer Science
http://www.informatik.fernuni-hagen.de/import/thi1/vasco.brattka/publications/dim.ps
Add To MetaCart

Abstract:

Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function. 1

Citations

624 On computable numbers, with an application to the Entscheidungsproblem – Turing - 1936
248 Vulnerabilities Analysis – Bishop - 1999
148 A foundation for computable analysis – Weihrauch - 1997
124 Complexity Theory of Real Functions – Ko - 1991
61 On the definitions of computable real continuous functions – Grzegorczyk - 1957
34 Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science – Brattka, Weihrauch - 1999
10 Les ensembles récursivement ouverts ou fermés, et leurs applications à l’analyse récursive – LACOMBE - 1958
9 Computable real-valued functions on recursive open and closed subsets of Euclidean space – Zhou - 1996
8 Recursively enumerable subsets of R q in two computing models: BlumShub -Smale machine and Turing machine – Zhong - 1998
4 On computable numbers, with an application to the "Entscheidungsproblem – Turing - 1936
1 Toward a data type for solid modeling based on domain theory – Lieutier - 1998