Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
Baker, C. G. (2004). A Block Incremental Algorithm for Computing Dominant Singular Subspaces. Retrieved from http://purl.flvc.org/fsu/fd/FSU_migr_etd-0961
This thesis presents and evaluates a generic algorithm for incrementally computing the dominant singular subspaces of a matrix. The relationship between the generality of the results and the necessary computation is explored. The performance of this method, both numerical and computational, is discussed in terms of the algorithmic parameters, such as block size and acceptance threshhold. Bounds on the error are presented along with a posteriori approximations of these bounds. Finally, a group of methods are proposed which iteratively improve the accuracy of computed results and the quality of the bounds.
Updating, Numerical Linear Algebra, Singular Value Decomposition, URV Factorization, Subspace Tracking
Date of Defense
Date of Defense: April 19, 2004.
Submitted Note
A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science.
Bibliography Note
Includes bibliographical references.
Publisher
Florida State University
Identifier
FSU_migr_etd-0961
Use and Reproduction
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them.
Baker, C. G. (2004). A Block Incremental Algorithm for Computing Dominant Singular Subspaces. Retrieved from http://purl.flvc.org/fsu/fd/FSU_migr_etd-0961
