Pages that link to "Item:Q5668674"
From MaRDI portal
The following pages link to Comparison of algorithms for calculation of g.c.d. of polynomials (Q5668674):
Displayed 13 items.
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← 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)
- Algorithms for symbolic reduction of signal flow graphs. (Q1565854) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Unified adaptive control of non-minimum-phase systems Part 2. Target tracking and dynamic compensation (Q3496249) (← links)
- Numerically stable algorithm for transfer function matrix evaluation (Q3922553) (← links)
- Part I-Smith form and common divisor of polynomial matrices (Q4775731) (← links)
- Part II Minimal realization (Q4775732) (← links)
- Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
- Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method (Q5717696) (← links)
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649) (← links)