Numerical analysis of integer ABS methods
The authors provide the first detailed numerical analysis of integer Abaffy-Broyden-Spedicato (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 pre-defined and randomly generated linear Diophantine systems of equations. Analysis of a large set of randomly generated systems of equations identified one sub-variant (called W2 implementation) of the scaled non-symmetric 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.
- ABS algorithms for linear equations and ABSPACK
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- A class of ABS algorithms for Diophantine linear systems
- Numerical testing on the ABS-type algorithms
- ABS algorithms for Diophantine linear equations and integer LP problems
This page was built for publication: Numerical analysis of integer ABS methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915554)
