Parallel computation of determinants of matrices with polynomial entries
From MaRDI portal
Publication:2643537
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
Cites work
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 41264 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1827103 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A generalized Kronecker product and linear systems
- An implicitization algorithm for rational surfaces with no base points
- Concise parallel Dixon determinant
- Efficient vector and parallel manipulation of tensor products
- Fast Solution of Confluent Vandermonde Linear Systems
- Implicitizing rational curves by the method of moving algebraic curves
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
- Multipolynomial resultant algorithms
- Parallelization of perturbation analysis: Application to large-scale engineering problems
- Polynomial algorithms in computer algebra
- Solution of Vandermonde systems of equations
- Using polynomial interpolation for implicitizing algebraic curves
Cited in
(19)- Multipolynomial resultant algorithms
- Complexity of constructing Dixon resultant matrix
- scientific article; zbMATH DE number 5627530 (Why is no real title available?)
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- Fast parallel algorithms for vandermonde determinants
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- Obtaining exact interpolation multivariate polynomial by approximation
- An effective hybrid algorithm for computing symbolic determinants
- Computation of a determinant and a matrix product in cellular automata
- 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
- scientific article; zbMATH DE number 4217603 (Why is no real title available?)
- 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)
