On general row merging schemes for sparse Givens transformations

Journal Article · Wed Oct 01 04:00:00 EDT 1986 · SIAM J. Sci. Stat. Comput.; (United States)

DOI:https://doi.org/10.1137/0907081· OSTI ID:5100212

Liu, J W.H.

This paper introduces general row merging schemes for the QR decomposition of sparse matrices by Givens rotations. They can be viewed as a generalization of row rotations to submatrix rotations (or merging) in the recent method by George and Heath. Based on the column ordering and the structure of the given sparse matrix, we present an algorithm to determine automatically a sequence of submatrix rotations appropriate for sparse decomposition. It is shown that the actual numerical computation can be organized as a sequence of reductions of two upper trapezoidal full submatrices into another upper trapezoidal full matrix. Experimental results are provided to compare the practical performance of the proposed method and the George-Heath scheme. Significant reduction in arithmetic operations and factorization time is achieved in exchange for a very modest increase in working storage. The interpretation of general row merging as a special variable row pivoting method is also presented.

• Research Organization: Dept. of Computer Science, York Univ., Downsview, Ontario M3J 1P3
• OSTI ID: 5100212
• Journal Information: SIAM J. Sci. Stat. Comput.; (United States), Journal Name: SIAM J. Sci. Stat. Comput.; (United States) Vol. 7:4; ISSN SIJCD
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
FACTORIZATION
MATHEMATICAL LOGIC
MATRICES
TIME DEPENDENCE
TRANSFORMATIONS