Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
From MaRDI portal
Publication:2511181
DOI10.1016/j.cam.2013.09.021zbMath1293.12007OpenAlexW2144236383MaRDI QIDQ2511181
Dimitrios Christou, Marilena Mitrouli, Nicos Karcanias
Publication date: 5 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.09.021
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Nonlinear algebraic or transcendental equations (65H99)
Related Items
Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- The ERES method for computing the approximate GCD of several polynomials
- Quasi-gcd computations
- Approximate GCD and its application to ill-conditioned algebraic equations
- On approximate GCDs of univariate polynomials
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Certified approximate univariate GCDs
- Computation of approximate polynomial GCDs and an extension
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Numerical and Symbolical Methods for the GCD of Several Polynomials
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Greatest common divisors from generalized sylvester resultant matrices
- A matrix pencil based numerical method for the computation of the GCD of polynomials
- Computing multiple roots of inexact polynomials
- Computation of the GCD of polynomials using gaussian transformations and shifting
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Comparison of algorithms for calculation of g.c.d. of polynomials
- A New Version of the Euclidean Algorith
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
This page was built for publication: Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
