An effective algorithm of computing symbolic determinants with multivariate polynomial entries
From MaRDI portal
Publication:990537
DOI10.1016/J.AMC.2007.03.015zbMATH Open1193.65048OpenAlexW1984289670MaRDI QIDQ990537FDOQ990537
Authors: 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
Recommendations
- An effective hybrid algorithm for computing symbolic determinants
- An efficient algorithm for the multivariable Adomian polynomials
- Algorithms for factorization of the irregular matrix polynomials using symbolic computations
- scientific article; zbMATH DE number 1639651
- Computing the determinant of a matrix with polynomial entries by approximation
- A symbolic evaluation of determinants of matrices with recursive entries
- A reliable symbolic implementation of algorithm for calculating Adomian polynomials
- An algorithm for the multiplication of symmetric polynomials
- Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
- A new algorithm for general factorizations of multivariate polynomial matrices
Cites Work
- Title not available (Why is that?)
- On the complexity of computing determinants
- Parallel computation of determinants of matrices with polynomial entries
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Interpolating polynomials from their values
- Title not available (Why is that?)
- Multipolynomial resultant algorithms
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- An implicitization algorithm for rational surfaces with no base points
- Title not available (Why is that?)
- A new approach for constructing subresultants
- Title not available (Why is that?)
- Improved polynomial matrix determinant computation
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
- Using polynomial interpolation for implicitizing algebraic curves
- On Computing the Exact Determinant of Matrices with Polynomial Entries
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
Cited In (11)
- Modified Gauss algorithm for matrices with symbolic entries
- Improved polynomial matrix determinant computation
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
- An effective hybrid algorithm for computing symbolic determinants
- Computing determinants of rational functions
- Computing the determinant of a matrix with polynomial entries by approximation
- Title not available (Why is that?)
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
- Parallel computation of determinants of matrices with polynomial entries
- Determinant polynomial sequences
- Bezout matrices, subresultant polynomials and parameters
This page was built for publication: An effective algorithm of computing symbolic determinants with multivariate polynomial entries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990537)
