Complexity of constructing Dixon resultant matrix
From MaRDI portal
Publication:3174885
DOI10.1080/00207160.2016.1276572zbMath1417.13006OpenAlexW2566721025MaRDI QIDQ3174885
Zhenyi Ji, Dingxiong Wu, Xiaolin Qin, Lin Tang
Publication date: 18 July 2018
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1276572
computational complexityelimination theoryrecursive algorithmpolynomial system solvingDixon resultant matrix
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Solving polynomial systems; resultants (13P15)
Related Items (5)
An analytical approach based on Dixon resultant for the inverse kinematics of 6R robot manipulators with offset wrists ⋮ Index reduction of differential algebraic equations by differential Dixon resultant ⋮ Stability and Hopf bifurcation of a love model with two delays ⋮ An interpolation algorithm for computing Dixon resultants ⋮ Heuristics to sift extraneous factors in Dixon resultants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential elimination with Dixon resultants
- A recursive algorithm for constructing complicated Dixon matrices
- Decomposition of algebraic sets and applications to weak centers of cubic systems
- Three kinds of extraneous factors in Dixon resultants
- Algorithm for implicitizing rational parametric surfaces
- Concise parallel Dixon determinant
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
- Fast computation of the Bézout and Dixon resultant matrices
- Computing the determinant of a matrix with polynomial entries by approximation
- Conic tangency equations and Apollonius problems in biochemistry and pharmacology
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Application of Dixon resultant to satellite trajectory control by pole placement
- Obtaining exact interpolation multivariate polynomial by approximation
- On the complexity of the multivariate resultant
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- An extended fast algorithm for constructing the Dixon resultant matrix
- Parallel computation of determinants of matrices with polynomial entries
- Powers of tensors and fast matrix multiplication
- Using Algebraic Geometry
- A practical symbolic algorithm for the inverse kinematics of 6R manipulators with simple geometry
- Computer Algebra and Geometric Algebra with Applications
- Explicit formulas for the multivariate resultant.
This page was built for publication: Complexity of constructing Dixon resultant matrix
