scientific article; zbMATH DE number 1263378
From MaRDI portal
Publication:4234262
Recommendations
Cited in
(33)- An effective hybrid algorithm for computing symbolic determinants
- Computation of determinants, adjoint matrices, and characteristic polynomials without division
- 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
- On the complexity of computing determinants
- A simple division-free algorithm for computing determinants
- 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
- Some fast algorithms multiplying a matrix by its adjoint
- New division free algorithm for finding the determinant
- Combinatorial optimization methods to determine the rank of a matrix over a commutative ring, with engineering applications
- Computation of the Adjoint Matrix
- An introspective algorithm for the integer determinant
- scientific article; zbMATH DE number 1775055 (Why is no real title available?)
- Relaxed Hensel lifting of triangular sets
- Algorithms of computing determinants in commutative rings
- Computing determinants of rational functions
- Expressing a fraction of two determinants as a determinant
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Acceleration of computation of determinants and characteristic polynomials without divisions
- Division-free computation of subresultants using Bezout matrices
- Computational Science and Its Applications – ICCSA 2004
- Computing the determinant of a dense matrix over \(\mathbb{Z}\)
- Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
- Faster modular composition
- An asymptotically fast polynomial space algorithm for Hamiltonicity detection in sparse directed graphs
- On computing the determinant in small parallel time using a small number of processors
- On the complexity of inverting integer and polynomial matrices
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234262)
