An effective algorithm of computing symbolic determinants with multivariate polynomial entries

DOI10.1016/j.amc.2007.03.015zbMath1193.65048MaRDI QIDQ990537

Yi Li

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.015

zbMATH Keywords

symbolic matrix; determinant expansion; fraction-free Gaussian elimination; resultant computation

Mathematics Subject Classification ID

65F40: Numerical computation of determinants

Related Items

Bezout matrices, subresultant polynomials and parameters, An effective hybrid algorithm for computing symbolic determinants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach for constructing subresultants
• Interpolating polynomials from their values
• Multipolynomial resultant algorithms
• On the complexity of computing determinants
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
• Parallel computation of determinants of matrices with polynomial entries
• On Computing the Exact Determinant of Matrices with Polynomial Entries
• Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
• Improved polynomial matrix determinant computation
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• An implicitization algorithm for rational surfaces with no base points
• Using polynomial interpolation for implicitizing algebraic curves