An effective algorithm of computing symbolic determinants with multivariate polynomial entries

作者:

Highlights:

摘要

An algorithm for computing the determinant of a matrix whose entries are multivariate polynomials is presented. It converts a multivariate matrix to an univariate matrix such that one only computes the determinant of univariate matrix. Experimental results show that this algorithm can efficiently reduce the intermediate expression expansion appearing in the computation of determinants of multivariate matrices.

论文关键词:Symbolic matrix,Determinant expansion,Fraction-free Gaussian elimination,Resultant computation

论文评审过程:Available online 19 March 2007.

论文官网地址:https://doi.org/10.1016/j.amc.2007.03.015