Parallel computation of determinants of matrices with polynomial entries
From MaRDI portal
Publication:2643537
DOI10.1016/J.JSC.2003.11.002zbMATH Open1137.65344OpenAlexW2031337781MaRDI QIDQ2643537FDOQ2643537
Authors: Ana Marco, José-Javier Martínez 
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.11.002
Recommendations
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Computing the determinant of a matrix with polynomial entries by approximation
- An effective hybrid algorithm for computing symbolic determinants
- Parallel evaluation of the determinant and of the inverse of a matrix
- Multipolynomial resultant algorithms
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Numerical computation of determinants (65F40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial algorithms in computer algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solution of Vandermonde systems of equations
- Title not available (Why is that?)
- Multipolynomial resultant algorithms
- Title not available (Why is that?)
- An implicitization algorithm for rational surfaces with no base points
- Implicitizing rational curves by the method of moving algebraic curves
- Fast Solution of Confluent Vandermonde Linear Systems
- A generalized Kronecker product and linear systems
- Efficient vector and parallel manipulation of tensor products
- Using polynomial interpolation for implicitizing algebraic curves
- Concise parallel Dixon determinant
- Parallelization of perturbation analysis: Application to large-scale engineering problems
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
Cited In (19)
- Complexity of constructing Dixon resultant matrix
- Multipolynomial resultant algorithms
- Title not available (Why is that?)
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Fast parallel algorithms for vandermonde determinants
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- Computation of a determinant and a matrix product in cellular automata
- Obtaining exact interpolation multivariate polynomial by approximation
- An effective hybrid algorithm for computing symbolic determinants
- Validated numerical computation of the \(\mathcal L_{\infty}\)-norm for linear dynamical systems
- Computing the determinant of a matrix with polynomial entries by approximation
- Two-dimensional symmetric and antisymmetric generalizations of exponential and cosine functions
- Massively parallel computations on many-variable polynomials
- Data parallel evaluation-interpolation algorithm for polynomial matrix inversion
- Computing the intersection of two ruled surfaces by using a new algebraic approach
- The division free parallel algorithm for finding determinant
- Title not available (Why is that?)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
This page was built for publication: Parallel computation of determinants of matrices with polynomial entries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643537)
