Computing the determinant of a matrix with polynomial entries by approximation

DOI10.1007/S11424-017-6033-8zbMATH Open1402.65036arXiv1408.5879OpenAlexW2964085817MaRDI QIDQ1621164FDOQ1621164

Authors: Xiaolin Qin, Zhi Sun, Tuo Leng, Yong Feng 

Publication date: 8 November 2018

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1408.5879

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

zbMATH Keywords

dimension reductionapproximate interpolationVandermonde systemserror controllable algorithmsymbolic determinant

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of determinants (65F40)

Cites Work

• Using Algebraic Geometry
• Title not available (Why is that?)
• Solution of Vandermonde systems of equations
• Parallel computation of determinants of matrices with polynomial entries
• Title not available (Why is that?)
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• On exact and approximate interpolation of sparse rational functions
• Title not available (Why is that?)
• From an approximate to an exact absolute polynomial factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient matrix preconditioners for black box linear algebra
• Fast computation of determinants of Bézout matrices and application to curve implicitization
• Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
• An effective hybrid algorithm for computing symbolic determinants
• On Computing the Exact Determinant of Matrices with Polynomial Entries
• Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
• Obtaining exact interpolation multivariate polynomial by approximation
• Obtaining exact value by approximate computations
• A complete algorithm to find exact minimal polynomial by approximations

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
• Title not available (Why is that?)
• 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)