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

DOI10.1007/S10288-010-0152-6zbMATH Open1215.11127OpenAlexW2019242178MaRDI QIDQ548678FDOQ548678

Nezam Mahdavi-Amiri, M. 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

Recommendations

• Solving rank one perturbed linear diophantine systems using the Hermite normal form
• On solving linear Diophantine systems using generalized Rosser's algorithm
• Solving rank one perturbed linear Diophantine systems by the ABS method
• An efficient incremental algorithm for solving systems of linear diophantine equations
• scientific article

zbMATH Keywords

rank one perturbationgreatest common divisorLDSSBRlinear Diophantine systemsRosser's algorithm

Mathematics Subject Classification ID

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

Cites Work

• An introduction to the geometry of numbers.
• On solving linear Diophantine systems using generalized Rosser's algorithm
• 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

Cited In (2)

• Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
• Title not available (Why is that?)

This page was built for publication: An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548678)