Results 211 to 220 of about 5,078 (233)
Application of Dixon resultant to satellite trajectory control by pole placement
Journal of Symbolic Computation, 2013 Control system design process based on pole placement frequently requires to solve underdetermined multivariate polynomial systems. Since only the real solutions can be accepted for hardware implementation, we are looking for exclusively these roots.
B Paláncz
exaly +2 more sources
Some of the next articles are maybe not open access.
Differential elimination with Dixon resultants
Applied Mathematics and Computation, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhenbing Zeng, Weinian Zhang
exaly +3 more sources
Implicitization by Dixon A-resultants
Proceedings Geometric Modeling and Processing 2000. Theory and Applications, 2000It is well-known that the Dixon resultant implicitizes exactly a general tensor product surface. We show that a minor of the Dixon resultant matrix can also implicitize exactly. This occurs when the monomial support of the surface parametrization is a rectangle missing at most one sub-rectangle at each of its its corners.
Eng-Wee Chionh +2 more
openaire +1 more source
Comparing acceleration techniques for the Dixon and Macaulay resultants
Mathematics and Computers in Simulation, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert H Lewis
exaly +2 more sources
Dixon resultant’s solution of systems of geodetic polynomial equations
Journal of Geodesy, 2007The Dixon resultant is proposed as an alternative to Grobner basis or multipolynomial resultant approaches for solving systems of polynomial equations inherent in geodesy. Its smallness in size, high density (ratio on the number of nonzero elements to the number of all elements), speed, and robustness (insensitive to combinatorial sequence and monomial
Bela Paláncz +2 more
exaly +3 more sources
Conditions for exact resultants using the Dixon formulation
Proceedings of the 2000 international symposium on Symbolic and algebraic computation, 2000A structural criteria on polynomial systems is developed for which the generalized Dixon formulation of multivariate resultants defined by Kapur, Saxena and Yang (1994) computes the resultant exactly. The concept of a Dixon-exact support (the set of exponent vectors of terms appearing in a polynomial system) is introduced so that the Dixon formulation ...
Arthur D. Chtcherba, Deepak Kapur
openaire +1 more source
Dixon Resultant for Cluster Treatment of LTI Systems with Multiple Delays
IFAC-PapersOnLine, 2015 Abstract The cluster treatment of characteristic roots (CTCR) paradigm, is studied in a new angle for the stability analysis of linear time invariant (LTI) systems with multiple independent delays. For such systems, all the imaginary characteristic roots can be found exactly and exhaustively along a set of hypersurfaces in the domain of the delays ...
Qingbin Gao, Nejat Olgaç
exaly +2 more sources
Three kinds of extraneous factors in Dixon resultants
Science in China Series A: Mathematics, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, ShiZhong, Fu, HongGuang
exaly +3 more sources
Solving 3-6 Parallel Robots by Dixon Resultant
Applied Mechanics and Materials, 2012In this paper, we investigated the forward kinematic problem of the 3-6 parallel robots (Stewart platform) via a symbolic computation tool called Dixon resultant. 3-6 parallel robot is a variation of the classic 6-6 Stewart platform. First we constructed the system equations of 3-6 parallel robots with a certain coordinate system, and then gave the ...
exaly +2 more sources
ACM SIGSAM Bulletin, 2003
Different matrix based resultant formulations use the support of the polynomials in a polynomial system in various ways for setting up resultant matrices for computing resultants. Every formulation suffers, however, from the fact that for most polynomial systems, the output is not a resultant, but rather a nontrivial multiple of the ...
Arthur D. Chtcherba, Deepak Kapur
openaire +1 more source
Different matrix based resultant formulations use the support of the polynomials in a polynomial system in various ways for setting up resultant matrices for computing resultants. Every formulation suffers, however, from the fact that for most polynomial systems, the output is not a resultant, but rather a nontrivial multiple of the ...
Arthur D. Chtcherba, Deepak Kapur
openaire +1 more source