Complexity of constructing Dixon resultant matrix
From MaRDI portal
Publication:3174885
Recommendations
Cites work
- scientific article; zbMATH DE number 1253976 (Why is no real title available?)
- scientific article; zbMATH DE number 1256734 (Why is no real title available?)
- scientific article; zbMATH DE number 1263399 (Why is no real title available?)
- scientific article; zbMATH DE number 1983346 (Why is no real title available?)
- scientific article; zbMATH DE number 2151215 (Why is no real title available?)
- scientific article; zbMATH DE number 806917 (Why is no real title available?)
- A practical symbolic algorithm for the inverse kinematics of 6R manipulators with simple geometry
- A recursive algorithm for constructing complicated Dixon matrices
- Algebraic geometry and geometric modeling: insight and computation
- Algorithm for implicitizing rational parametric surfaces
- An extended fast algorithm for constructing the Dixon resultant matrix
- Application of Dixon resultant to satellite trajectory control by pole placement
- Computer Algebra and Geometric Algebra with Applications
- Computing the determinant of a matrix with polynomial entries by approximation
- Concise parallel Dixon determinant
- Conic tangency equations and Apollonius problems in biochemistry and pharmacology
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
- Decomposition of algebraic sets and applications to weak centers of cubic systems
- Differential elimination with Dixon resultants
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Explicit formulas for the multivariate resultant.
- Fast computation of the Bézout and Dixon resultant matrices
- Multivariate Sylvester resultant and extraneous factors
- Obtaining exact interpolation multivariate polynomial by approximation
- On the complexity of the multivariate resultant
- Parallel computation of determinants of matrices with polynomial entries
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Powers of tensors and fast matrix multiplication
- Three kinds of extraneous factors in Dixon resultants
- Using Algebraic Geometry
Cited in
(11)- Undirected determinant and its complexity
- Identifying complexity by means of matrices
- Parallel Dixon matrices by bracket
- An extended fast algorithm for constructing the Dixon resultant matrix
- Index reduction of differential algebraic equations by differential Dixon resultant
- An interpolation algorithm for computing Dixon resultants
- 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
- Stability and Hopf bifurcation of a love model with two delays
- Constructing Sylvester-type resultant matrices using the Dixon formulation
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)
