Pages that link to "Item:Q2469622"
From MaRDI portal
The following pages link to A structured rank-revealing method for Sylvester matrix (Q2469622):
Displaying 12 items.
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- A note on the inversion of Sylvester matrices in control systems (Q541493) (← links)
- On the computation of the rank of block bidiagonal Toeplitz matrices (Q1012505) (← links)
- The numerical rank of Krylov matrices (Q1789397) (← links)
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial (Q1874670) (← links)
- Polynomial greatest common divisor as a solution of system of linear equations (Q1992108) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- The generalized Schur algorithm and some applications (Q2305951) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- (Q3447170) (← links)
- A numerical characteristic of the Sylvester matrix (Q4809543) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)