Computing the determinant of a matrix with polynomial entries by approximation

DOI10.1007/s11424-017-6033-8zbMath1402.65036arXiv1408.5879OpenAlexW2964085817MaRDI QIDQ1621164

Zhi Sun, Xiaolin Qin, Yong Feng, Tuo Leng

Publication date: 8 November 2018

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

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

zbMATH Keywords

dimension reductionapproximate interpolationVandermonde systemserror controllable algorithmsymbolic determinant

Mathematics Subject Classification ID

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

Related Items (1)

Complexity of constructing Dixon resultant matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An effective hybrid algorithm for computing symbolic determinants
• Efficient matrix preconditioners for black box linear algebra
• Obtaining exact interpolation multivariate polynomial by approximation
• From an approximate to an exact absolute polynomial factorization
• Obtaining exact value by approximate computations
• Parallel computation of determinants of matrices with polynomial entries
• Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
• On Computing the Exact Determinant of Matrices with Polynomial Entries
• Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
• Using Algebraic Geometry
• A complete algorithm to find exact minimal polynomial by approximations
• Solution of Vandermonde systems of equations

This page was built for publication: Computing the determinant of a matrix with polynomial entries by approximation