The Block Jacobi Method for Computing the Singular Value Decomposition

Other Titles
Abstract
Jacobi techniques for computing the symmetric eigenvalue and singular value decompositions have achieved recent prominence because of interest in parallel computation. They are ideally suited for certain multiprocessor systems having processors that are connected in nearest neighbor fashion. If the processors are reasonably powerful and have significant local memory, then block Jacobi procedures are attractive because they render a more favorable computation to communication ratio. This paper examines some of the practical details associated with two block Jacobi methods for the singular value decomposition. The methods differ in how the 2-by-2 subproblems are solved.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1985-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-680
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report
Accessibility Feature
Accessibility Hazard
Accessibility Summary
Link(s) to Catalog Record