Heuristics to sift extraneous factors in Dixon resultants
DOI10.1016/J.JSC.2022.01.003OpenAlexW4210726114MaRDI QIDQ2117431FDOQ2117431
Authors: Xiaolin Qin, Lige Zhang, Lu Yang, Sheng Cao 
Publication date: 21 March 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2022.01.003
Recommendations
- Heuristics to accelerate the Dixon resultant
- scientific article; zbMATH DE number 1253976
- scientific article; zbMATH DE number 2151215
- scientific article; zbMATH DE number 1256734
- Three kinds of extraneous factors in Dixon resultants
- scientific article; zbMATH DE number 1189069
- An interpolation algorithm for computing Dixon resultants
- A new interpolation algorithm for computing dixon resultants
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Conditions for exact resultants using the Dixon formulation
parallel computationDixon resultantextraneous factorsparametric polynomial systems solvingresultant methods
Algorithms in computer science (68Wxx) Computational aspects and applications of commutative rings (13Pxx) Nonlinear algebraic or transcendental equations (65Hxx)
Cites Work
- Using Algebraic Geometry
- Implicit representation of parametric curves and surfaces
- The number of roots of a system of equations
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Title not available (Why is that?)
- Computing triangular systems and regular systems
- Title not available (Why is that?)
- 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
- Generalized resultants over unirational algebraic varieties
- Complexity of constructing Dixon resultant matrix
- Heuristics to accelerate the Dixon resultant
- Fraction free Gaussian elimination for sparse matrices
- Strong \(\mu\)-bases for rational tensor product surfaces and extraneous factors associated to bad base points and anomalies at infinity
- Rectangular corner cutting and Sylvester \(\mathcal{A}\)-resultants
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants
- Cayley-Dixon projection operator for multi-univariate composed polynomials
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Conditions for exact resultants using the Dixon formulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Algebra and Geometric Algebra with Applications
- Title not available (Why is that?)
- Multivariate Sylvester resultant and extraneous factors
- A practical symbolic algorithm for the inverse kinematics of 6R manipulators with simple geometry
- Title not available (Why is that?)
- Application of Dixon resultant to satellite trajectory control by pole placement
- Integral points on algebraic varieties. An introduction to Diophantine geometry
- Randomized detection of extraneous factors
Cited In (4)
- A human error risk priority number calculation methodology using fuzzy and TOPSIS grey
- \(N\)-lump solutions to a \((3+1)\)-dimensional variable-coefficient generalized nonlinear wave equation in a liquid with gas bubbles
- Title not available (Why is that?)
- Applications of an improved Dixon elimination method for the inverse kinematics of 6R manipulators
Uses Software
This page was built for publication: Heuristics to sift extraneous factors in Dixon resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117431)
