A software package for sparse orthogonal factorization and updating

  • Authors:

  • Ove Edlund

  • Affiliations:

  • Luleå University of Technology, Sweden

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Although there is good software for sparse QR factorization, there is little support for updating and downdating, something that is absolutely essential in some linear programming algorithms, for example. This article describes an implementation of sparse LQ factorization, including block triangularization, approximate minimum degree ordering, symbolic factorization, multifrontal factorization, and updating and downdating. The factor Q is not retained. The updating algorithm expands the nonzero pattern of the factor L, which is reflected in dynamic representation of L. The block triangularization is used as an "ordering for sparsity" rather than as a prerequisite for block backward substitution. In symbolic factorization, something called "element counters" is introduced to reduce the overestimation of the number of nonzeros that the commonly used methods do. Both the approximate minimum degree ordering and the symbolic factorization are done without explicitly forming the nonzero pattern of the symmetric matrix in the corresponding normal equations. Tests show that the average time used for a single update or downdate is essentially the same as the time used for a single forward or backward substitution. Other parts of the implementation show the same range of performance as existing code, but cannot be replaced because of the special character of the systems that are solved.