A New Version of the Euclidean Algorith
From MaRDI portal
Publication:5725754
DOI10.2307/2312260zbMath0116.26801OpenAlexW2089514214MaRDI QIDQ5725754
Publication date: 1963
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2312260
Related Items
A duality property for the set of all feasible solutions to an integer program ⋮ Computation of the GCD of polynomials using gaussian transformations and shifting ⋮ Factorization properties of lattices over the integers ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Quasi-affine transformations: Tilings by reciprocal images ⋮ Unnamed Item ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ Comparison of algorithms for calculation of g.c.d. of polynomials ⋮ The Geometry of the Intersection of Voxel Spaces ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance ⋮ Quasi-affine transformations and parings of the discret plane ⋮ Multidimensional greatest common divisor and Lehmer algorithms ⋮ Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ Using the Blankinship algorithm to find the general solution of a linear diophantine equation ⋮ An application of the Hermite normal form in integer programming ⋮ Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review ⋮ Solving rank one perturbed linear Diophantine systems by the ABS method ⋮ On digital plane preimage structure ⋮ Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction ⋮ Complexity questions in number theory ⋮ Digital plane preimage structure ⋮ Which pivot to solve linear systems? ⋮ Part I-Smith form and common divisor of polynomial matrices ⋮ Synthesis aspects in the design of efficient processor arrays from affine recurrence equations ⋮ Geometrical tools to map systems of affine recurrence equations on regular arrays
