MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Banded matrices with banded inverses

Author(s)
Srinivasa Gopala Raghavan, Venugopalan
Thumbnail
DownloadFull printable version (2.928Mb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Gilbert Strang.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
We discuss the conditions that are necessary for a given banded matrix to have a banded inverse. Although a generic requirement is known from previous studies, we tend to focus on the ranks of the block matrices that are present in the banded matrix. We consider mainly the two factor 2-by- 2 block matrix and the three factor 2-by-2 block matrix cases. We prove that the ranks of the blocks in the larger banded matrix need to necessarily conform to a particular order. We show that for other orders, the banded matrix in question may not even be invertible. We are then concerned with the factorization of the banded matrix into simpler factors. Simpler factors that we consider are those that are purely block diagonal. We show how we can obtain the different factors and develop algorithms and codes to solve for them. We do this for the two factor 2-by-2 and the three factor 2-by-2 matrices. We perform this factorization on both the Toeplitz and non-Toeplitz case for the two factor case, while we do it only for the Toeplitz case in the three factor case. We then look at extending our results when the banded matrix has elements at its corners. We show that this case is not very different from the ones analyzed before. We end our discussion with the solution for the factors of the circulant case. Appendix A deals with a conjecture about the minimum possible rank of a permutation matrix. Appendices B & C deal with some of the miscellaneous properties that we obtain for larger block matrices and from extending some of the previous work done by Strang in this field.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2010.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (p. 99).
 
Date issued
2010
URI
http://hdl.handle.net/1721.1/61896
Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
Publisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.