Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

Erwin H. Bareiss
Mathematics of Computation
Vol. 22, No. 103 (Jul., 1968), pp. 565-578
DOI: 10.2307/2004533
Stable URL: http://www.jstor.org/stable/2004533
Page Count: 14
  • Get Access
  • Read Online (Free)
  • Download ($34.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
Preview not available

Abstract

A method is developed which permits integer-preserving elimination in systems of linear equations, AX = B, such that (a) the magnitudes of the coefficients in the transformed matrices are minimized, and (b) the computational efficiency is considerably increased in comparison with the corresponding ordinary (single-step) Gaussian elimination. The algorithms presented can also be used for the efficient evaluation of determinants and their leading minors. Explicit algorithms and flow charts are given for the two-step method. The method should also prove superior to the widely used fraction-producing Gaussian elimination when A is nearly singular.

Page Thumbnails

  • Thumbnail: Page 
565
    565
  • Thumbnail: Page 
566
    566
  • Thumbnail: Page 
567
    567
  • Thumbnail: Page 
568
    568
  • Thumbnail: Page 
569
    569
  • Thumbnail: Page 
570
    570
  • Thumbnail: Page 
571
    571
  • Thumbnail: Page 
572
    572
  • Thumbnail: Page 
573
    573
  • Thumbnail: Page 
574
    574
  • Thumbnail: Page 
575
    575
  • Thumbnail: Page 
576
    576
  • Thumbnail: Page 
577
    577
  • Thumbnail: Page 
578
    578