Beta 1


Title Sparse symmetric rank-revealing decompositions
Author Bratland, Jørn
Frimodt, Jesper
Supervisor Hansen, Per Christian (Department of Informatics and Mathematical Modeling, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Institution Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark
Thesis level Master's thesis
Year 2002
Abstract This thesis investigates the possibility of a sparse symmetric rank-revealing VSV decomposition. Rank-revealing decompositions of both general and symmetric rank-deficient matrices are described, as well as the numerical tools used in these. The cause of fill in the VSV decomposition is investigated, and numerical experiments with possible sparsity optimizations are discussed. Drop-tolerances in the estimated singular vectors are described as a tool in obtaining a sparse decomposition.
Imprint Department of Informatics and Mathematical Modeling, Technical University of Denmark, DTU : DK-2800 Kgs. Lyngby, Denmark
Keywords Sparse VSV decomposition; norm and condition estimation; ordering schemes; sparse factorizations and drop-tolerances
Fulltext
Original Postscript thesis.ps (12.28 MB)
Derived PDF thesis.pdf (27.92 MB)
Original compressed Postscript imm1282.zip (2.06 MB)
Admin Creation date: 2006-06-22    Update date: 2012-12-20    Source: dtu    ID: 58289    Original MXD