article

Free access

On Euclid's Algorithm and the Theory of Subresultants

Authors:

W. S. Brown,

J. F. TraubAuthors Info & Claims

Journal of the ACM (JACM), Volume 18, Issue 4

Pages 505 - 514

https://doi.org/10.1145/321662.321665

Published: 01 October 1971 Publication History

PDF eReader

References

[1]

KNUTH, D.E. The Art of Computer Programming, Vol. 2. Addison-Wesley, Reading, Mass., 1969.

Crossref

Google Scholar

[2]

BROWN, W.S. On Euclid's algorithm and the computation of polynomial greater.",mmmon divisors. Proc. 2nd Symposium on Symbolic and Algebraic Manipulation. ACM, New York, 1971, pp. 195--211; J. ACM I,? (Oct. 1971), 478-504.

Crossref

Google Scholar

[3]

COLLINS, G. E. Subresultants and reduced polynomial remainder sequences. J. ACM 14 (1967), 1.28-142.

Crossref

Google Scholar

[4]

BIRKHOFF, G., AND MACLANE, S. A Survey of Modern Algebra, 3rd ed. Macmillan, New York, 1965.

Google Scholar

[5]

USPENSKY, J.V. Theory of Equations. McGraw-Hill, New York, 1948.

Google Scholar

[6]

BOCHEa, M. Introduction to Higher Algebra. Macmillan, New York, 1907.

Google Scholar

[7]

HOUSEHOLDER, A.S. Bigradients and the problem of Routh and Hurwitz. SIAM Rev. 10 (1968), 56--66.

Google Scholar

[8]

COLLINS, G.E. The calculation of multivariate polynomial resultants. Proc. 2nd Symposium on Symbolic and Algebraic Manipulation. ACM, New York, 1971, pp. 212-222; J. A CM. 18 (Oct. 1971) 515-532.

Crossref

Google Scholar

[9]

HEINDEL, L. E. Algorithms for Exact Polynomial Rool Calculation, Ph.D. Diss., U. of Wisconsin (1970).

Crossref

Google Scholar

Cited By

View all

Lutsenko VBabenko MDeryabin M(2024)Construction of Akushsky Core Functions Without Critical CoresMathematics10.3390/math1221339912:21(3399)Online publication date: 30-Oct-2024
https://doi.org/10.3390/math12213399
Monagan MHuang Q(2024)A New Sparse Polynomial GCD by Separating TermsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669684(134-142)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669684
Hong HYang J(2024)Parametric “non-nested” discriminants for multiplicities of univariate polynomialsScience China Mathematics10.1007/s11425-023-2143-367:8(1911-1932)Online publication date: 8-Mar-2024
https://doi.org/10.1007/s11425-023-2143-3
Show More Cited By

Index Terms

On Euclid's Algorithm and the Theory of Subresultants
1. Mathematics of computing
  1. Mathematical analysis
    1. Nonlinear equations
    2. Numerical analysis
      1. Computations on polynomials

Recommendations

Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm

The Lehmer–Euclid Algorithm is an improvement of the Euclid Algorithm when applied to large integers. The original Lehmer–Euclid Algorithm replaces divisions on multi-precision integers by divisions on single-precision integers. Here we study a slightly ...
On Euclid's algorithm and elementary number theory

Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to use the ...
An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm

An algorithm for solving a discrete-time Wiener-Hopf equation is presented based upon Euclid's algorithm. The discrete-time Wiener-Hopf equation is a system of linear inhomogeneous equations with a given Toeplitz matrix M, a given vector b, and an ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 18, Issue 4

Oct. 1971

170 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321662

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1971

Published in JACM Volume 18, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

189
Total Citations
View Citations
1,318
Total Downloads

Downloads (Last 12 months)159
Downloads (Last 6 weeks)24

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lutsenko VBabenko MDeryabin M(2024)Construction of Akushsky Core Functions Without Critical CoresMathematics10.3390/math1221339912:21(3399)Online publication date: 30-Oct-2024
https://doi.org/10.3390/math12213399
Monagan MHuang Q(2024)A New Sparse Polynomial GCD by Separating TermsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669684(134-142)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669684
Hong HYang J(2024)Parametric “non-nested” discriminants for multiplicities of univariate polynomialsScience China Mathematics10.1007/s11425-023-2143-367:8(1911-1932)Online publication date: 8-Mar-2024
https://doi.org/10.1007/s11425-023-2143-3
Ansari MMonagan M(2024)A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple ExtensionsComputer Algebra in Scientific Computing10.1007/978-3-031-69070-9_3(27-46)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-69070-9_3
Shiriaev EKucherov NBabenko MNazarov A(2023)Fast Operation of Determining the Sign of a Number in RNS Using the Akushsky Core FunctionComputation10.3390/computation1107012411:7(124)Online publication date: 28-Jun-2023
https://doi.org/10.3390/computation11070124
Sasaki T(2023)A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)ACM Communications in Computer Algebra10.1145/3594252.359425356:3(97-124)Online publication date: 20-Apr-2023
https://dl.acm.org/doi/10.1145/3594252.3594253
Quintana-Ortí GHernando FIgual F(2023)Algorithm 1033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory ArchitecturesACM Transactions on Mathematical Software10.1145/357338349:1(1-24)Online publication date: 21-Mar-2023
https://dl.acm.org/doi/10.1145/3573383
Bistritz Y(2023)A couple of catch-ups for the modified unit-circle zero location test2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC61333.2023.00014(52-59)Online publication date: 11-Sep-2023
https://doi.org/10.1109/SYNASC61333.2023.00014
Pasquale NGiorgio S(2022)Simple Algorithm for GCD of PolynomialsWSEAS TRANSACTIONS ON MATHEMATICS10.37394/23206.2022.21.9921(869-871)Online publication date: 31-Dec-2022
https://doi.org/10.37394/23206.2022.21.99
Pasquale NGiorgio S(2022)A simple algorithm for GCD of polynomialsAnnals of Mathematics and Physics10.17352/amp.0000655:2(193-195)Online publication date: 23-Dec-2022
https://doi.org/10.17352/amp.000065
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm

On Euclid's algorithm and elementary number theory

An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations