Solving rank one perturbed linear Diophantine systems by the ABS method
From MaRDI portal
Publication:3423597
DOI10.1080/10556780500247766zbMath1115.65031OpenAlexW2091055493MaRDI QIDQ3423597
Nezam Mahdavi-Amiri, Keyvan Amini
Publication date: 14 February 2007
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500247766
Computer solution of Diophantine equations (11Y50) Direct numerical methods for linear systems and matrix inversion (65F05) Linear Diophantine equations (11D04)
Related Items (2)
An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach ⋮ Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of direct methods for linear systems
- Using the Blankinship algorithm to find the general solution of a linear diophantine equation
- A New Version of the Euclidean Algorith
- A Note on the Linear Diophantine Equation
- A class of ABS algorithms for Diophantine linear systems
This page was built for publication: Solving rank one perturbed linear Diophantine systems by the ABS method