arXiv · 1408.5879
Computing the determinant of a matrix with polynomial entries by approximation
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.
Explore related subjects
Keep this discovery
Xiaolin Qin, Zhi Sun, Tuo Leng, Yong Feng. 2014-08-25. Computing the determinant of a matrix with polynomial entries by approximation. https://arxiv.org/abs/1408.5879
Cite the original work for its findings. Save a collection to share your selection of sources.