Parallel computation of determinants of matrices with polynomial entries
From MaRDI portal
Publication:2643537
DOI10.1016/j.jsc.2003.11.002zbMath1137.65344OpenAlexW2031337781MaRDI QIDQ2643537
Ana Marco, José-Javier Martıńez
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
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Numerical computation of determinants (65F40)
Related Items (9)
Computing the determinant of a matrix with polynomial entries by approximation ⋮ Complexity of constructing Dixon resultant matrix ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ Validated numerical computation of the \(\mathcal L_{\infty}\)-norm for linear dynamical systems ⋮ Computing the intersection of two ruled surfaces by using a new algebraic approach ⋮ COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ An effective hybrid algorithm for computing symbolic determinants ⋮ Two-dimensional symmetric and antisymmetric generalizations of exponential and cosine functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multipolynomial resultant algorithms
- Implicitizing rational curves by the method of moving algebraic curves
- Concise parallel Dixon determinant
- Polynomial algorithms in computer algebra
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
- A generalized Kronecker product and linear systems
- Fast Solution of Confluent Vandermonde Linear Systems
- Efficient vector and parallel manipulation of tensor products
- Solution of Vandermonde systems of equations
- An implicitization algorithm for rational surfaces with no base points
- Parallelization of perturbation analysis: Application to large-scale engineering problems
- Using polynomial interpolation for implicitizing algebraic curves
This page was built for publication: Parallel computation of determinants of matrices with polynomial entries