A New Version of the Euclidean Algorith

DOI10.2307/2312260MaRDI QIDQ5725754zbMATH OpenOpenAlexFDO

Authors William A. Blankinship

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

zbMATH Keywords

number theory

Cited in

(27)

• Complexity questions in number theory
• A duality property for the set of all feasible solutions to an integer program
• Using the Blankinship algorithm to find the general solution of a linear diophantine equation
• 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
• Factorization properties of lattices over the integers
• Quasi-affine transformations: Tilings by reciprocal images
• Structured matrix methods computing the greatest common divisor of polynomials
• Which pivot to solve linear systems?
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• On digital plane preimage structure
• Numerical and symbolical methods for the GCD of several polynomials
• scientific article; zbMATH DE number 3877015 (Why is no real title available?)
• Solving rank one perturbed linear Diophantine systems by the ABS method
• Digital plane preimage structure
• Multidimensional greatest common divisor and Lehmer algorithms
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• Part I-Smith form and common divisor of polynomial matrices
• The geometry of the intersection of voxel spaces
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Comparison of algorithms for calculation of g.c.d. of polynomials
• Quasi-affine transformations and parings of the discret plane
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• An application of the Hermite normal form in integer programming
• Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
• The ERES method for computing the approximate GCD of several polynomials

This page was built for publication: A New Version of the Euclidean Algorith

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5725754)