Loading...

An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach

Khorramizadeh, M ; Sharif University of Technology | 2011

339 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s10288-010-0152-6
  3. Publisher: 2011
  4. Abstract:
  5. Recently, we described a generalization of Rosser's algorithm for a single linear Diophantine equation to an algorithm for solving systems of linear Diophantine equations. Here, we make use of the new formulation to present a new algorithm for solving rank one perturbed linear Diophantine systems, based on using Rosser's approach. Finally, we compare the efficiency and effectiveness of our proposed algorithm with the algorithm proposed by Amini and Mahdavi-Amiri (Optim Methods Softw 21:819-831, 2006)
  6. Keywords:
  7. Greatest common divisor ; LDSSBR ; Linear Diophantine systems ; Rank one perturbation ; Rosser's algorithm
  8. Source: 4OR ; Volume 9, Issue 2 , June , 2011 , Pages 159-173 ; 16194500 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs10288-010-0152-6