Pages that link to "Item:Q2484243"

The following pages link to Numerical computation of minimal polynomial bases: a generalized resultant approach (Q2484243):

Displaying 7 items.

• An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
• Block minimal bases \(\ell\)-ifications of matrix polynomials (Q1629840) (← links)
• Algorithm for computing \(\mu\)-bases of univariate polynomials (Q1712001) (← links)
• Robustness and perturbations of minimal bases (Q2002782) (← links)
• On computing root polynomials and minimal bases of matrix pencils (Q2104967) (← links)
• The generalized Schur algorithm and some applications (Q2305951) (← links)
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)