The following pages link to Computing minimal nullspace bases (Q5244558):
Displaying 13 items.
- On the null spaces of the Macaulay matrix (Q405945) (← links)
- Efficient rational creative telescoping (Q820942) (← links)
- Lagrangian constraints and differential Thomas decomposition (Q895971) (← links)
- An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
- Algorithm for computing \(\mu\)-bases of univariate polynomials (Q1712001) (← 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)
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
- Numerical computation of minimal polynomial bases: a generalized resultant approach (Q2484243) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- Efficient computation of order bases (Q2883842) (← links)
- Nested Dissection for Sparse Nullspace Bases (Q3136547) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)
