A class of ABS algorithms for Diophantine linear systems
An approach is proposed, based on Abaffy-Broyden-Spedicato methods (ABS), for solving the linear Diophantine vector equation \(Ax=b\), where \(A\in\mathbb{Z}^{m\times n}(m\leq n)\), \(b\in\mathbb{Z}^m\), \(x\in\mathbb{Z}^n\) is the solution and \(\mathbb{Z}\) is the set of integers. The approach constructively determines whether the equation has a solution. A counterexample for a previous hypothesis of \textit{E. Egerváry} [Publ. Math. Debrecen 4, 481-483 (1955-1956; Zbl 0074.27301); Z. Angew. Math. Phys. 11, 376-386 (1960; Zbl 0102.11401)] concerning such equations is given. Finally an application to the determination of the Hermite normal form of an integer matrix is presented.
- ABS algorithms for Diophantine linear equations and integer LP problems
- Solving rank one perturbed linear Diophantine systems by the ABS method
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- Symmetric and non-symmetric ABS methods for solving Diophantine systems of equations
- Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- ABS algorithms for Diophantine linear equations and integer LP problems
- 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
- Extended integer rank reduction formulas and Smith normal form
- Numerical analysis of integer ABS methods
- Solving rank one perturbed linear Diophantine systems by the ABS method
- Real and integer Wedderburn rank reduction formulas for matrix decompositions
- Real and integer extended rank reduction formulas and matrix decompositions: A review
- A note on solving linear Diophantine systems by usingL3-reduction algorithm
- A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations
- On generalized Schur complement of matrices and its applications to real and integer matrix factorizations
- An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach
- Symmetric and non-symmetric ABS methods for solving Diophantine systems of equations
- New solutions of LR fuzzy linear systems using ranking functions and ABS algorithms
- ABS methods for continuous and integer linear equations and optimization
- Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
- Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
This page was built for publication: A class of ABS algorithms for Diophantine linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958923)
