Pages that link to "Item:Q5962121"

The following pages link to On rank and null space computation of the generalized Sylvester matrix (Q5962121):

Displaying 12 items.

• Blind image deconvolution using a banded matrix method (Q369456) (← links)
• On the null spaces of the Macaulay matrix (Q405945) (← links)
• Parallel QR processing of generalized Sylvester matrices (Q633629) (← links)
• Properties of a generalized Sylvester matrix (Q763507) (← links)
• An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• A hybrid method for computing the intersection and tangency points of plane curves (Q2250221) (← links)
• The generalized Schur algorithm and some applications (Q2305951) (← links)
• A structured rank-revealing method for Sylvester matrix (Q2469622) (← links)
• THE GENERALIZED SYLVESTER MATRIX EQUATION, RANK MINIMIZATION AND ROTH’S EQUIVALENCE THEOREM (Q3110923) (← links)
• First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials (Q3300516) (← links)
• A generalized Sylvester identity and fraction-free random Gaussian elimination (Q5933502) (← links)