Abstract
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 famous Gauß algorithm is one of its numerical answers. Today there exists a tremendous number of algorithms which solve this problem for different types of linear equations. However, actual implementations in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned inputs. This situation raises the question which of these instabilities are intrinsic, thus caused by the very nature of the problem, and which are just side effects of specific algorithms. To approach this principle question we revisit linear equations from the rigorous point of view of computability. Therefore we apply methods of computable analysis, which is the Turing machine based theory of computable real number functions. It turns out that, given the coefficients of a system of linear equations, we can compute the space of solutions, if and only if the dimension of the solution space is known in advance. Especially, this explains why there cannot exist any stable algorithms under weaker assumptions.
Work partially supported by DFG Grant BR 1807/4–1
Work partially supported by DFG Grant Me 872/7–3
Chapter PDF
Similar content being viewed by others
References
L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, New York 1998.
V. Brattka and P. Hertling, Feasible real random access machines, J. Complexity 14 (1998) 490–526.
V. Brattka and K. Weihrauch, Computability on subsets of Euclidean space I: Closed and compact subsets, Theoret. Comp. Sci. 219 (1999) 65–93.
A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math. 44 (1957) 61–71.
H. Kamo, K. Kawamura, and I. Takeuti, Computational complexity of fractal sets, Real Analysis Exchange 26 (2000/01) 773–793.
K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston 1991.
K.-I. Ko, On the computability of fractal dimensions and Hausdorff measure, Ann. Pure Appl. Logic 93 (1998) 195–216.
M. B. Pour-El and J. I. Richards, Computability in Analysis and Physics, Springer, Berlin 1989.
A. M. Turing, On computable numbers, with an application to the “Entscheidungsproblem”, Proc. London Math. Soc. 42 (1936) 230–265.
K. Weihrauch, Computable Analysis, Springer, Berlin 2000.
K. Weihrauch and N. Zhong, Turing computability of a nonlinear Schrödinger propagator, in: J. Wang (ed.), Computing and Combinatorics, vol. 2108 of Lect. Not. Comp. Sci., Springer, Berlin 2001, 596–599.
J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford 1965.
M. Ziegler and V. Brattka, Computing the dimension of linear subspaces, in: V. Hlava, K. G. Jeffery, and J. Wiedermann (eds.), SOFSEM 2000: Theory and Practice of Informatics, vol. 1963 of Lect. Not. Comp. Sci., Springer, Berlin 2000, 450–458.
M. Ziegler and V. Brattka, A computable spectral theorem, in: J. Blanck, V. Brattka, and P. Hertling (eds.), Computability and Complexity in Analysis, vol. 2064 of Lect. Not. Comp. Sci., Springer, Berlin 2001, 378–388.
M. Ziegler and V. Brattka, Turing computability of (non-)linear optimization, in: T. Biedl (ed.), Thirteenth Canadian Conference on Computational Geometry, University of Waterloo 2001, 181–184.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brattka, V., Ziegler, M. (2002). Computability of Linear Equations. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive