Pages that link to "Item:Q2457359"

The following pages link to Normal forms for general polynomial matrices (Q2457359):

Displaying 17 items.

• Scaling invariants and symmetry reduction of dynamical systems (Q372874) (← links)
• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
• Efficient algorithms for order basis computation (Q420746) (← links)
• A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
• A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
• Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
• Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
• Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
• Laurent, rational, and hypergeometric solutions of linear \(q\)-difference systems of arbitrary order with polynomial coefficients (Q2216875) (← links)
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
• A deterministic algorithm for inverting a polynomial matrix (Q2254681) (← links)
• Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
• Fraction-free row reduction of matrices of Ore polynomials. (Q2457346) (← links)
• Output-sensitive modular algorithms for polynomial matrix normal forms (Q2470057) (← links)
• Computing minimal interpolation bases (Q2628323) (← links)
• Asymptotically fast polynomial matrix algorithms for multivariable systems (Q5423851) (← links)