Computation of the GCD of polynomials using gaussian transformations and shifting
From MaRDI portal
Publication:5287932
Recommendations
- Computation of approximate polynomial GCDs and an extension
- Computing approximate GCD of multivariate polynomials
- Numerical and symbolical methods for the GCD of several polynomials
- A subspace method for the computation of the GCD of polynomials
- On the computation of the GCD of 2-D polynomials
- Computing GCDs of polynomials over algebraic number fields
- On computing polynomial GCDs in alternate bases
- An iterative method for calculating approximate GCD of univariate polynomials
- Approximate GCD of multivariate polynomials
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3661177 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- A New Version of the Euclidean Algorith
- Comparison of algorithms for calculation of g.c.d. of polynomials
- Generalized Resultant Theorem
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Matrix Analysis
- Rank and null space calculations using matrix decomposition without column interchanges
Cited in
(23)- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- Nearest common root of a set of polynomials: a structured singular value approach
- Normal factorisation of polynomials and computational issues.
- Approximate polynomial GCD over integers
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Compound matrices: Properties, numerical issues and analytical computations
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- On the computation of the GCD of 2-D polynomials
- Approximate least common multiple of several polynomials using the ERES division algorithm
- The numerical greatest common divisor of univariate polynomials
- Derivation of effective transfer function models by input, output variables selection.
- Structured matrix methods computing the greatest common divisor of polynomials
- The feedback invariant measures of distance to uncontrollability and unobservability
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
- The ERES method for computing the approximate GCD of several polynomials
- System theoretic based characterisation and computation of the least common multiple of a set of polynomials.
- Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
- A Paper-and-Pencil gcd Algorithm for Gaussian Integers
- Numerical and symbolical methods for the GCD of several polynomials
- On the zeros of blocked time-invariant systems
- Approximate zero polynomials of polynomial matrices and linear systems
This page was built for publication: Computation of the GCD of polynomials using gaussian transformations and shifting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287932)
