scientific article; zbMATH DE number 1263378
From MaRDI portal
Publication:4234262
zbMath0978.65502MaRDI QIDQ4234262
Publication date: 29 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Parallel numerical computation (65Y05)
Related Items (13)
Computing the determinant of a matrix with polynomial entries by approximation ⋮ The shifted number system for fast linear algebra on integer matrices ⋮ 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 ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Directed evaluation ⋮ On the complexity of inverting integer and polynomial matrices ⋮ Computing the sign or the value of the determinant of an integer matrix, a complexity survey. ⋮ Relaxed Hensel lifting of triangular sets ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ An effective hybrid algorithm for computing symbolic determinants
This page was built for publication:
