Computing the determinant of a matrix with polynomial entries by approximation
From MaRDI portal
Abstract: Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the determinant of a matrix with polynomial entries using hybrid symbolic and numerical computation. The algorithm relies on the Newton's interpolation method with error control for solving Vandermonde systems. It is also based on a novel approach for estimating the degree of variables, and the degree homomorphism method for dimension reduction. Furthermore, the parallelization of the method arises naturally.
Recommendations
- Parallel computation of determinants of matrices with polynomial entries
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- An effective hybrid algorithm for computing symbolic determinants
- Improved polynomial matrix determinant computation
- Multipolynomial resultant algorithms
Cites work
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 3783186 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1263378 (Why is no real title available?)
- scientific article; zbMATH DE number 1263399 (Why is no real title available?)
- A complete algorithm to find exact minimal polynomial by approximations
- An effective hybrid algorithm for computing symbolic determinants
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
- Efficient matrix preconditioners for black box linear algebra
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Fast computation of determinants of Bézout matrices and application to curve implicitization
- From an approximate to an exact absolute polynomial factorization
- Obtaining exact interpolation multivariate polynomial by approximation
- Obtaining exact value by approximate computations
- On Computing the Exact Determinant of Matrices with Polynomial Entries
- On exact and approximate interpolation of sparse rational functions
- Parallel computation of determinants of matrices with polynomial entries
- Solution of Vandermonde systems of equations
- Using Algebraic Geometry
Cited in
(9)- Complexity of constructing Dixon resultant matrix
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Error-controlled values of determinant obtained by approximate calculation
- Improved polynomial matrix determinant computation
- An effective hybrid algorithm for computing symbolic determinants
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 1869703 (Why is no real title available?)
- Parallel computation of determinants of matrices with polynomial entries
- Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
This page was built for publication: Computing the determinant of a matrix with polynomial entries by approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621164)
