An effective hybrid algorithm for computing symbolic determinants
From MaRDI portal
Recommendations
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Parallel computation of determinants of matrices with polynomial entries
- Computing the determinant of a matrix with polynomial entries by approximation
- Parallel evaluation of the determinant and of the inverse of a matrix
- A simple division-free algorithm for computing determinants
Cites work
- scientific article; zbMATH DE number 1263357 (Why is no real title available?)
- scientific article; zbMATH DE number 1263378 (Why is no real title available?)
- scientific article; zbMATH DE number 3221233 (Why is no real title available?)
- Algorithm for implicitizing rational parametric surfaces
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- An implicitization algorithm for rational surfaces with no base points
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
- Implicitization of rational surfaces by means of polynomial interpolation
- Interpolating polynomials from their values
- On Computing the Exact Determinant of Matrices with Polynomial Entries
- Parallel computation of determinants of matrices with polynomial entries
Cited in
(5)- Modified Gauss algorithm for matrices with symbolic entries
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Computing the determinant of a matrix with polynomial entries by approximation
- scientific article; zbMATH DE number 1113842 (Why is no real title available?)
- Parallel computation of determinants of matrices with polynomial entries
This page was built for publication: An effective hybrid algorithm for computing symbolic determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044418)
