Pages that link to "Item:Q803724"

The following pages link to Parallel algorithms for matrix normal forms (Q803724):

Displaying 16 items.

• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
• On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
• A local construction of the Smith normal form of a matrix polynomial (Q607157) (← links)
• Determining the structure of the Jordan normal form of a matrix by symbolic computation (Q676030) (← links)
• A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix (Q677132) (← links)
• Eigenvalue trim approach to exact order reduction for Roesser state-space model of multidimensional systems (Q784702) (← links)
• The rank of a random matrix (Q870223) (← links)
• Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
• Efficient decomposition of separable algebras. (Q1432890) (← links)
• Computing rational forms of integer matrices (Q1864883) (← links)
• High-order lifting and integrality certification (Q1878491) (← links)
• The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
• Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms (Q2429401) (← links)
• Normal forms for general polynomial matrices (Q2457359) (← links)
• The numerical rank of a matrix and its applications (Q2474904) (← links)
• Minimal matrix centralizers over the field ℤ₂ (Q2926009) (← links)