Abstract
Systems of linear equations over a field K can be solved by various methods, e.g., by Gaussian elimination or Cramer’s rule. But if we start with a system over the integers, we will immediately introduce rational numbers, whose arithmetic operations are clearly more costly than the corresponding operations on integers. So for the same reason as in the computation of gcds of polynomials or factorization of polynomials, we are interested in a method for solving systems of linear equations which avoids computation with rational numbers as much as possible. Such a method for fraction free Gaussian elimination is Bareiss’s algorithm, as described in Bareiss (1968).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Wien
About this chapter
Cite this chapter
Winkler, F. (1996). Linear algebra—solving linear systems. In: Polynomial Algorithms in Computer Algebra. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6571-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6571-3_7
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82759-8
Online ISBN: 978-3-7091-6571-3
eBook Packages: Springer Book Archive