Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
From MaRDI portal
Publication:699262
Recommendations
- A class of ABS algorithms for Diophantine linear systems
- ABS algorithms for linear equations and ABSPACK
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- ABS algorithms for Diophantine linear equations and integer LP problems
- Solving rank one perturbed linear Diophantine systems by the ABS method
Cited in
(9)- Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms
- Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
- ABS algorithms for Diophantine linear equations and integer LP problems
- Real and integer extended rank reduction formulas and matrix decompositions: A review
- Solving rank one perturbed linear Diophantine systems by the ABS method
- On generalized Schur complement of matrices and its applications to real and integer matrix factorizations
- A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations
This page was built for publication: Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699262)