Pages that link to "Item:Q1348088"
From MaRDI portal
The following pages link to Efficient matrix preconditioners for black box linear algebra (Q1348088):
Displaying 9 items.
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Computing the determinant of a matrix with polynomial entries by approximation (Q1621164) (← links)
- Probabilistic analysis of block Wiedemann for leading invariant factors (Q2048159) (← links)
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals (Q2229288) (← links)
- Automating algorithm selection: checking for matrix properties that can simplify computations (Q2422701) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Certified sparse linear system solving (Q2643567) (← links)