Publication:4234262
From MaRDI portal
zbMath0978.65502MaRDI QIDQ4234262
Publication date: 29 January 2002
65F50: Computational methods for sparse matrices
68W30: Symbolic computation and algebraic computation
65Y05: Parallel numerical computation
Related Items
Relaxed Hensel lifting of triangular sets, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, On the complexity of inverting integer and polynomial matrices, An effective algorithm of computing symbolic determinants with multivariate polynomial entries, An effective hybrid algorithm for computing symbolic determinants, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Computing the determinant of a matrix with polynomial entries by approximation, On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix, Essentially optimal computation of the inverse of generic polynomial matrices, Directed evaluation, The shifted number system for fast linear algebra on integer matrices, Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, Non-commutative Edmonds' problem and matrix semi-invariants