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 Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Reducing a Matrix to Hessenberg Form

P. A. Businger
Mathematics of Computation
Vol. 23, No. 108 (Oct., 1969), pp. 819-821
DOI: 10.2307/2004967
Stable URL: http://www.jstor.org/stable/2004967
Page Count: 3
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Reducing a Matrix to Hessenberg Form
Preview not available

Abstract

It has been an open problem whether the reduction of a matrix to Hessenberg (almost triangular) form by Gaussian similarity transformations is numerically stable [2, p. 364]. We settle this question by exhibiting a class of matrices for which this process is unstable.

Page Thumbnails

  • Thumbnail: Page 
819
    819
  • Thumbnail: Page 
820
    820
  • Thumbnail: Page 
821
    821