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

On a Lower Bound for the Rank of a Partitioned Square Matrix

Gene H. Golub
Mathematics of Computation
Vol. 17, No. 82 (Apr., 1963), pp. 186-188
DOI: 10.2307/2003639
Stable URL: http://www.jstor.org/stable/2003639
Page Count: 3
  • Get Access
  • Read Online (Free)
  • Download ($34.00)
  • Cite this Item
Item Type
Article
Thumbnails
If you need an accessible version of this item please contact JSTOR User Support
On a Lower Bound for the Rank of a Partitioned Square Matrix
Preview not available

Page Thumbnails

  • Thumbnail: Page 
186
    186
  • Thumbnail: Page 
187
    187
  • Thumbnail: Page 
188
    188