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

DOI10.1007/s10288-010-0152-6zbMath1215.11127OpenAlexW2019242178MaRDI QIDQ548678

Nezam Mahdavi-Amiri, Mostafa Khorramizadeh

Publication date: 30 June 2011

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0152-6

zbMATH Keywords

greatest common divisorrank one perturbationLDSSBRlinear Diophantine systemsRosser's algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computer solution of Diophantine equations (11Y50) Direct numerical methods for linear systems and matrix inversion (65F05) Linear Diophantine equations (11D04) Linear equations (linear algebraic aspects) (15A06)

Related Items

Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review

Cites Work

• On solving linear Diophantine systems using generalized Rosser's algorithm
• An introduction to the geometry of numbers.
• Solving rank one perturbed linear Diophantine systems by the ABS method
• A Note on the Linear Diophantine Equation
• A class of ABS algorithms for Diophantine linear systems