Preserving sparity for general solution of linear Diophantine systems

Abstract

Here, we present an efficient algorithm for preserveving sparsity in computing the general solution of linear Diophantin systems. In the kth iteration of the algorithm, the general solution k − 1 equations of the systems is at hand. Then, we present numerical results to justify the efficiency of the resulting algorithm. Mathematics Subject Classification: 11D04, 65Y04