Show simple item record

dc.contributor.authorColeman, Thomas F.en_US
dc.contributor.authorEdenbrandt, Andersen_US
dc.contributor.authorGilbert, John R.en_US
dc.date.accessioned2007-04-23T16:49:28Z
dc.date.available2007-04-23T16:49:28Z
dc.date.issued1983-10en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-578en_US
dc.identifier.urihttps://hdl.handle.net/1813/6418
dc.description.abstractIn solving large sparse linear least squares problems $Ax \cong b$, several different numeric methods involve computing the same upper triangular factor $R$ of $A$. It is of interest to be able to compute the nonzero structure of $R$, given only the structure of $A$. The solution to this problem comes from the theory of matchings in bipartite graphs. The structure of $A$ is modeled with a bipartite graph and it is shown how the rows and columns of $A$ can be rearranged into a structure from which the structure of its upper triangular factor can be correctly computed. Also, a new method for solving sparse least squares problems, called block back-substitution, is presented. This method assures that no unnecessary space is allocated for fill, and that no space is needed for intermediate fill.en_US
dc.format.extent1986760 bytes
dc.format.extent549953 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePredicting Fill for Sparse Orthogonal Factorizationen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics