Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials-Reference-Cited by-同舟云学术

Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials

Published:2014-04 Issue: Volume:260 Page:54-67
ISSN:0377-0427
Container-title:Journal of Computational and Applied Mathematics
language:en
Short-container-title:Journal of Computational and Applied Mathematics

Author:

Christou D.,Karcanias N.,Mitrouli M.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference30 articles.

1. The Thirteen Books of Euclid’s Elements;Heath,1956

2. A new version of Euclid’s algorithm;Blankiship;American Mathematics Monthly,1963

3. On Euclid’s algorithm and the computation of polynomials greatest common divisors;Brown;Journal of the Association for Computer Machinery,1971

4. Comparison of algorithms for calculation of g.c.d of polynomials;Pace;International Journal of Control,1973

5. Quasi-GCD computations;Schönhage;Journal of Complexity,1985

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation;Journal of Symbolic Computation;2025-03

2. SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

3. Structured Matrix Methods Computing the Greatest Common Divisor of Polynomials;Special Matrices;2017-10-26

4. Approximate least common multiple of several polynomials using the ERES division algorithm;Linear Algebra and its Applications;2016-12