Pages that link to "Item:Q1004243"
From MaRDI portal
The following pages link to An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243):
Displaying 12 items.
- A local construction of the Smith normal form of a matrix polynomial (Q607157) (← links)
- On the computation of the null space of Toeplitz-like matrices (Q964070) (← links)
- On computing root polynomials and minimal bases of matrix pencils (Q2104967) (← links)
- Parameter identifiability for nonlinear LPV models (Q2162139) (← links)
- The generalized Schur algorithm and some applications (Q2305951) (← links)
- New properties of ARE solutions for strictly dissipative and lossless systems (Q2417891) (← links)
- Numerical computation of minimal polynomial bases: a generalized resultant approach (Q2484243) (← links)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices (Q4729243) (← links)
- Nearest Matrix Polynomials With a Specified Elementary Divisor (Q5146619) (← links)
- Revisiting the Matrix Polynomial Greatest Common Divisor (Q6116668) (← links)
- Nearest rank deficient matrix polynomials (Q6173924) (← links)
