English

Matrix factoring by fraction-free reduction

Symbolic Computation 2016-03-14 v1

Abstract

We consider exact matrix decomposition by Gauss-Bareiss reduction. We investigate two aspects of the process: common row and column factors and the influence of pivoting strategies. We identify two types of common factors: systematic and statistical. Systematic factors depend on the process, while statistical factors depend on the specific data. We show that existing fraction-free QR (Gram-Schmidt) algorithms create a common factor in the last column of Q. We relate the existence of row factors in LU decomposition to factors appearing in the Smith normal form of the matrix. For statistical factors, we identify mechanisms and give estimates of the frequency. Our conclusions are tested by experimental data. For pivoting strategies, we compare the sizes of output factors obtained by different strategies. We also comment on timing differences.

Keywords

Cite

@article{arxiv.1603.03565,
  title  = {Matrix factoring by fraction-free reduction},
  author = {Johannes Middeke and David J. Jeffrey},
  journal= {arXiv preprint arXiv:1603.03565},
  year   = {2016}
}

Comments

Submitted to ISSAC 2016

R2 v1 2026-06-22T13:08:43.542Z