Results 11 to 20 of about 5,078 (233)
Sparsity Considerations in Dixon Resultants
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96, 1996 New results relating the sparsity of nonhomogeneous polynomial systems and computation of their projection operator (a non-trivial multiple of the multivariate resultant) using Dixon's method are developed.
Deepak Kapur, Tushar Saxena
core +2 more sources
Extraneous Factors in the Dixon Resultant Formulation
Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97, 1997 Elimination methods based on generalizations of the Dixon's resultant formulation have been demonstrated to be efficient for simultaneously eliminating many variables from polynomials. One of these methods, presented by the authors earlier, was even
Deepak Kapur, Tushar Saxena
core +2 more sources
Solving Robust Glucose-Insulin Control by Dixon Resultant Computations [PDF]
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012 We present a symbolic approach towards solving the Bergman three-state minimal patient model of glucose metabolism. Our work first translates the Bergman three-state minimal patient model into the modified control algebraic Riccati equation.
Kovács, Laura +5 more
core +3 more sources
Algebraic and Geometric Reasoning using Dixon Resultants
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994 Dixon's method for computing multivariate resultants by simultaneously eliminating many variables is reviewed. The method is found to be quite restrictive because often the Dixon matrix is singular, and the Dixon resultant vanishes identically ...
Lu Yang, Deepak Kapur, Tushar Saxena
core +2 more sources
On the efficiency and optimality of Dixon-based resultant methods [PDF]
Proceedings of the 2002 international symposium on Symbolic and algebraic computation, 2002 Structural conditions on polynomial systems are developed for which the Dixon-based resultant methods often compute exact resultants. For cases when this cannot be done, the degree of the extraneous factor in the projection operator computed using the Dixon-based methods is typically minimal.
Deepak Kapur, Arthur D. Chtcherba
core +2 more sources
Cayley-Dixon resultant matrices of multi-univariate composed polynomials
, 2005 . The behavior of the Cayley-Dixon resultant construction and the structure of Dixon matrices are analyzed for composed polynomial systems constructed from a multivariate system in which each variable is substituted by a univariate polynomial in a ...
Deepak Kapur +2 more
core +2 more sources
Fast computation of the Bezout and Dixon resultant matrices
Journal of Symbolic Computation, 2002 10.1006/jsco.2001.0462Journal of Symbolic Computation33113 ...
Goldman, R.N. +5 more
core +3 more sources
Journal of the Franklin Institute, 2022 This study scrutinizes the stability problem of linear time-invariant feedback control systems with a constant-coefficient, partial delay distribution from a new perspective, which is built on an equivalence between the system of interest and the one ...
Cai, J. +5 more
core +4 more sources
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
Journal of Symbolic Computation, 2004 A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants.
Chtcherba, A.D. +3 more
core +3 more sources
Checking RSC criteria for extended Dixon resultant by interpolation method
Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005 Dixon resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon resultant vanishes identically yielding no information about solutions for many algebraic and geometry problems.
Yaohui Li, Yong Feng
core +2 more sources