Pages that link to "Item:Q5287932"

The following pages link to Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932):

Displaying 21 items.

• Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
• On the zeros of blocked time-invariant systems (Q386249) (← links)
• Approximate zero polynomials of polynomial matrices and linear systems (Q389575) (← links)
• Approximate polynomial GCD over integers (Q651873) (← links)
• The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
• Compound matrices: Properties, numerical issues and analytical computations (Q1014362) (← links)
• A compound matrix algorithm for the computation of the Smith form of a polynomial matrix (Q1334229) (← links)
• Normal factorisation of polynomials and computational issues. (Q1416384) (← links)
• System theoretic based characterisation and computation of the least common multiple of a set of polynomials. (Q1430368) (← links)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
• Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies (Q2785714) (← links)
• Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
• On the Computation of the GCD of 2-D Polynomials (Q3089756) (← links)
• (Q3143831) (← links)
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
• A Paper-and-Pencil gcd Algorithm for Gaussian Integers (Q5446307) (← links)
• The feedback invariant measures of distance to uncontrollability and unobservability (Q5863702) (← links)
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649) (← links)