swMATH ID: 
7297

Software Authors: 
Fodor, Szabina; M'ocsai, Attila

Description: 
Numerical analysis of integer ABS methods
The authors provide the first detailed numerical analysis of integer AbaffyBroydenSpedicato (iABS) algorithms. The different iABS variants were implemented using a new Java numerical package (JiABS) and their performance in terms of speed and the magnitude of the intermediate values was tested. All implemented algorithms were able to solve predefined and randomly generated linear Diophantine systems of equations. Analysis of a large set of randomly generated systems of equations identified one subvariant (called W2 implementation) of the scaled nonsymmetric integer ABS algorithm (snsiABS) algorithm to be the fastest of the algorithms tested while also generating low intermediate values. This subvariant also proved to be comparable to, or even faster than, the Linsolve algorithm of the commercially available Maple software under most conditions tested. 
Homepage: 
http://math.nist.gov/javanumerics/

Programming Languages: 
Java

Keywords: 
Diophantine system;
integer arithmetic;
AbaffyBroydenSpedicato algorithm

Related Software: 
Maple

Referenced in: 
1 Publication
