Pages that link to "Item:Q5119938"
From MaRDI portal
The following pages link to Computing the Nearest Rank-Deficient Matrix Polynomial (Q5119938):
Displayed 7 items.
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization (Q2114103) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- Nearest rank deficient matrix polynomials (Q6173924) (← links)