VTechWorks staff will be away for the Independence Day holiday from July 4-7. We will respond to email inquiries on Monday, July 8. Thank you for your patience.
 

The Sherman Morrison Iteration

Simple item page
dc.contributor.authorSlagel, Joseph Tanneren
dc.contributor.committeechairChung, Matthiasen
dc.contributor.committeememberGugercin, Serkanen
dc.contributor.committeememberChung, Julianneen
dc.contributor.departmentMathematicsen
dc.date.accessioned2015-06-18T08:03:04Zen
dc.date.available2015-06-18T08:03:04Zen
dc.date.issued2015-06-17en
dc.description.abstractThe Sherman Morrison iteration method is developed to solve regularized least squares problems. Notions of pivoting and splitting are deliberated on to make the method more robust. The Sherman Morrison iteration method is shown to be effective when dealing with an extremely underdetermined least squares problem. The performance of the Sherman Morrison iteration is compared to classic direct methods, as well as iterative methods, in a number of experiments. Specific Matlab implementation of the Sherman Morrison iteration is discussed, with Matlab codes for the method available in the appendix.en
dc.description.degreeMaster of Scienceen
dc.format.mediumETDen
dc.identifier.othervt_gsexam:5745en
dc.identifier.urihttp://hdl.handle.net/10919/52966en
dc.publisherVirginia Techen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectSherman Morrisonen
dc.subjectregularized least squares problemen
dc.subjectextremely underdetermined linear systemen
dc.titleThe Sherman Morrison Iterationen
dc.typeThesisen
thesis.degree.disciplineMathematicsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Slagel_JT_T_2015.pdf
Size:
429.6 KB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses