Complexity of constructing Dixon resultant matrix
DOI10.1080/00207160.2016.1276572zbMATH Open1417.13006OpenAlexW2566721025MaRDI QIDQ3174885FDOQ3174885
Authors: Xiaolin Qin, Dingxiong Wu, Lin Tang, Zhenyi Ji 
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
Recommendations
computational complexityrecursive algorithmelimination theorypolynomial system solvingDixon resultant matrix
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Solving polynomial systems; resultants (13P15)
Cites Work
- Powers of tensors and fast matrix multiplication
- Using Algebraic Geometry
- Parallel computation of determinants of matrices with polynomial entries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of algebraic sets and applications to weak centers of cubic systems
- Explicit formulas for the multivariate resultant.
- Algorithm for implicitizing rational parametric surfaces
- Three kinds of extraneous factors in Dixon resultants
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
- Conic tangency equations and Apollonius problems in biochemistry and pharmacology
- An extended fast algorithm for constructing the Dixon resultant matrix
- Differential elimination with Dixon resultants
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Fast computation of the Bézout and Dixon resultant matrices
- A recursive algorithm for constructing complicated Dixon matrices
- Algebraic geometry and geometric modeling: insight and computation
- Computing the determinant of a matrix with polynomial entries by approximation
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Title not available (Why is that?)
- Computer Algebra and Geometric Algebra with Applications
- Title not available (Why is that?)
- Concise parallel Dixon determinant
- Title not available (Why is that?)
- On the complexity of the multivariate resultant
- A practical symbolic algorithm for the inverse kinematics of 6R manipulators with simple geometry
- Obtaining exact interpolation multivariate polynomial by approximation
- Title not available (Why is that?)
- Application of Dixon resultant to satellite trajectory control by pole placement
Cited In (11)
- Stability and Hopf bifurcation of a love model with two delays
- Parallel Dixon matrices by bracket
- An interpolation algorithm for computing Dixon resultants
- Identifying complexity by means of matrices
- Index reduction of differential algebraic equations by differential Dixon resultant
- Undirected determinant and its complexity
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- An analytical approach based on Dixon resultant for the inverse kinematics of 6R robot manipulators with offset wrists
- A recursive algorithm for constructing complicated Dixon matrices
- Heuristics to sift extraneous factors in Dixon resultants
- An extended fast algorithm for constructing the Dixon resultant matrix
This page was built for publication: Complexity of constructing Dixon resultant matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174885)
