Pages that link to "Item:Q5423857"

The following pages link to Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857):

Displaying 10 items.

• Blind image deconvolution using a banded matrix method (Q369456) (← links)
• The computation of multiple roots of a polynomial (Q425345) (← links)
• An extended polynomial GCD algorithm using Hankel matrices (Q1186699) (← links)
• Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
• Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
• Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (Q2400326) (← links)
• Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
• (Q4221368) (← links)
• Special issue on the use of computer algebra systems for computer aided control system design (Q5423847) (← links)