Ordering givens transformations for sparse QR factorization
| dc.contributor.author | Gillespie, Mary Irene | en_US |
| dc.date.accessioned | 2024-08-13T22:54:18Z | |
| dc.date.available | 2024-08-13T22:54:18Z | |
| dc.date.copyright | 1992 | en_US |
| dc.date.issued | 1992 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | The QR factorization of a matrix A is commonly used to solve least squares problems. One way to compute such a factorization is by using Givens transformations. When A is sparse, the precise order in which the transformations are applied can affect the amount of storage required. In this work we present an ordering for the Givens transformations that is optiĀmal with regard to storage (a so-called "tight" ordering) and that preserves sparsity by restricting fill to those locations in R that are necessarily nonzero when A has the Hall property. This ordering is of particular interest when A does not have the strong Hall property and is not permuted into block upper trapezoidal form. We describe a bipartite graph model of sparse matrix structures, and summarize the characterization of the structures of the factors Q and R. We define the product of structures of matrices, determine the product of the structures of a sequence of Givens transformations, and define a tight ordering for the Givens transformations We then present a family of tight orderings for a given matrix structure. | en |
| dc.format.extent | 75 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/17895 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | UN SDG 11: Sustainable Cities and Communities | en |
| dc.title | Ordering givens transformations for sparse QR factorization | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- GILLESPIE_Mary_Irene_MSc_1992_558060.pdf
- Size:
- 14.34 MB
- Format:
- Adobe Portable Document Format