An effective hybrid algorithm for computing symbolic determinants
type: Item
instance of: scholarly article
title: An effective hybrid algorithm for computing symbolic determinants
zbMATH Open document ID: 1177.65069
author: Yi Li
published in: Applied Mathematics and Computation
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 65F40
zbMATH DE Number: 5649898
zbMATH Keywords: symbolic determinants
zbMATH Keywords: dimension-decreasing algorithm
zbMATH Keywords: parallel computation
zbMATH Keywords: resultant computation
MaRDI profile type: Publication
full work available at URL: j.amc.2009.08.056
OpenAlex ID: W2029963547
cites work: Q5510744
cites work: On Computing the Exact Determinant of Matrices with Polynomial Entries
cites work: Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
cites work: Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
cites work: Algorithm for implicitizing rational parametric surfaces
cites work: Interpolating polynomials from their values
cites work: Q4234262
cites work: Q4234238
cites work: An implicitization algorithm for rational surfaces with no base points
cites work: Implicitization of rational surfaces by means of polynomial interpolation
cites work: Parallel computation of determinants of matrices with polynomial entries
cites work: An effective algorithm of computing symbolic determinants with multivariate polynomial entries
DOI: 10.1016/J.AMC.2009.08.056
description: scientific article; zbMATH DE number 5649898