An effective hybrid algorithm for computing symbolic determinants

DOI10.1016/j.amc.2009.08.056zbMath1177.65069OpenAlexW2029963547MaRDI QIDQ1044418

Yi Li

Publication date: 18 December 2009

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

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

zbMATH Keywords

parallel computationresultant computationdimension-decreasing algorithmsymbolic determinants

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Related Items (1)

Computing the determinant of a matrix with polynomial entries by approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolating polynomials from their values
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries
• Algorithm for implicitizing rational parametric surfaces
• Implicitization of rational surfaces by means of polynomial interpolation
• 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
• An implicitization algorithm for rational surfaces with no base points

This page was built for publication: An effective hybrid algorithm for computing symbolic determinants