Complexity of constructing Dixon resultant matrix

References

• E. Bézout, Theorie Generale Des Equations Algebriques (1779), Kessinger Publishing, Whitefish, Montana, USA, 2010.
   Google Scholar
• A. Cayley, On the theory of elimination, Cambridge Dublin Math. J. 3 (1848), pp. 116–120.
   Google Scholar
• L.Y. Chen and Z.B. Zeng, Parallel computation of determinants of matrices with multivariate polynomial entries, Science China Inf. Sci. 56(11) (2013), pp. 1–16.
   PubMed Web of Science ®Google Scholar
• X.W. Chen and W.N. Zhang, Decomposition of algebraic sets and applications to weak centers of cubic systems, J. Comput. Appl. Math. 232 (2009), pp. 565–581. doi: 10.1016/j.cam.2009.06.029
   Web of Science ®Google Scholar
• J. Chiasson, L.M. Tolbert, K. McKenzie, and Z. Du, Elimination of harmonics in a multilevel converter using the theory of symmetric polynomials and resultants, IEEE Trans. Control Syst. Technol. 13(2) (2005), pp. 216–223. doi: 10.1109/TCST.2004.839556
   Web of Science ®Google Scholar
• E.W. Chionh, Concise parallel Dixon determinant, Computer Aided Geom. Des. 14 (1997), pp. 561–570. doi: 10.1016/S0167-8396(96)00046-5
   Web of Science ®Google Scholar
• E.W. Chionh, M. Zhang, and R.N. Goldman, Fast computation of the Bezout and Dixon resultant matrices, J. Symbolic Comput. 33 (2002), pp. 13–29. doi: 10.1006/jsco.2001.0462
   Web of Science ®Google Scholar
• A.D. Chtcherba and D. Kapur, On the Efficiency and Optimality of Dixon-based Resultant Methods, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2002, pp. 29–36.
   Google Scholar
• A.D. Chtcherba and D. Kapur, Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation, J. Symbolic Comput. 36(3–4) (2003), pp. 289–315. doi: 10.1016/S0747-7171(03)00084-1
   Web of Science ®Google Scholar
• D.A. Cox, J. Little, and D. OShea, Using Algebraic Geometry, 2nd ed., Springer, Berlin Heidelberg, 2005.
   Google Scholar
• C. D'Andrea and A. Dickenstein, Explicit formulas for the multivariate resultant, J. Pure Appl. Algebra 164(1–2) (2001), pp. 59–86. doi: 10.1016/S0022-4049(00)00145-6
   Web of Science ®Google Scholar
• A.L. Dixon, The eliminant of three quantics in two independent variables, Proc. London Math. Soc. 6 (1908), pp. 468–478. doi: 10.1112/plms/s2-6.1.468
   Google Scholar
• Y. Feng, X.L. Qin, J.Z. Zhang, and X. Yuan, Obtaining exact interpolation multivariate polynomial by approximation, J. Syst. Sci. Complex. 24(4) (2011), pp. 803–815. doi: 10.1007/s11424-011-8312-0
   Web of Science ®Google Scholar
• M.c. Foo and E.W. Chinoh, Corner edge cutting and Dixon A-resultant quotients, J. Symbolic Comput. 37(1) (2004), pp. 101–119. doi: 10.1016/j.jsc.2003.06.001
   Web of Science ®Google Scholar
• H.G. Fu, Y. Wang, S.Z. Zhao, and Q. Wang, A recursive algorithm for constructing complicated Dixon matrices, Appl. Math. Comput. 217(6) (2010), pp. 2595–2601.
   Web of Science ®Google Scholar
• F.L. Gall, Powers of Tensors and Fast Matrix Multiplication, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2014, pp. 296–303.
   Google Scholar
• R. Goldman, Algebraic Geometry and Geometric Modeling: Insight and computation, Algebraic Geometry and Geometric Modeling. Mathematics and Visualization, Springer, Berlin Heidelberg, 2006, pp. 1–22.
   Google Scholar
• B. Grenet, P. Koiran, and N. Portier, On the complexity of the multivariate resultant, J. Complex. 29(2) (2013), pp. 142–157. doi: 10.1016/j.jco.2012.10.001
   Web of Science ®Google Scholar
• H.Y. Hu and Z.H. Wang, Dynamics of Controlled Mechanical Systems with Delayed Feedback, Springer, Berlin Heidelberg, 2002.
   Google Scholar
• D. Kapur and T. Saxena, Sparsity Considerations in Dixon Resultants, Proceedings of the 28th Annual ACM Symposium on Theory of Computation (STOC-28), Philadelphia, 1996, pp. 184–191.
   Google Scholar
• D. Kapur and T. Saxena, Extraneous Factors in the Dixon Resultant Formulation, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ACM, New York, 1997, pp. 141–148.
   Google Scholar
• D. Kapur, T. Saxena, and L. Yang, Algebraic and Geometric Reasoning using Dixon Resultants, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ACM, New York, 1994, pp. 99–107.
   Google Scholar
• L. Kovács, B. Paláncz, and L. Kovács, Solving Robust Glucose-insulin Control by Dixon Resultant Computations, 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE, 2012, pp. 53–61.
   Google Scholar
• R.H. Lewis and S. Bridgett, Conic tangency equations and Apollonius problems in biochemistry and pharmacology, Math. Comput. Simul. 61(2) (2003), pp. 101–114. doi: 10.1016/S0378-4754(02)00122-2
   Web of Science ®Google Scholar
• R.H. Lewis and P.F. Stiller, Solving the recognition problem for six lines using the Dixon resultant, Math. Comput. Simul. 49(3) (1999), pp. 205–219. doi: 10.1016/S0378-4754(99)00050-6
   Web of Science ®Google Scholar
• F.S. Macaulay, The Algebraic Theory of Modular Systems, Cambridge Tracts in Mathematics Mathematical Physics, Cambridge University Press, Cambridge, 1916.
   Google Scholar
• D. Manocha and J.F. Canny, Algorithm for implicitizing rational parametric surfaces, Computer Aided Geom. Des. 9(1) (1992), pp. 25–50. doi: 10.1016/0167-8396(92)90051-P
   Google Scholar
• A. Marco and J.J. Martínez, Parallel computation of determinants of matrices with polynomial entries, J. Symbolic Comput. 37(6) (2004), pp. 749–760. doi: 10.1016/j.jsc.2003.11.002
   Web of Science ®Google Scholar
• B. Paláncz, Application of Dixon resultant to satellite trajectory control by pole placement, J. Symbolic Comput. 50 (2013), pp. 79–99. doi: 10.1016/j.jsc.2012.05.007
   Web of Science ®Google Scholar
• B. Paláncz, P. Zaletnyik, J.L. Awange, and E.W. Grafarend, Dixon resultant's solution of systems of geodetic polynomial equations, J. Geodesy 82(8) (2008), pp. 505–511. doi: 10.1007/s00190-007-0199-0
   Web of Science ®Google Scholar
• X.L. Qin, Y. Feng, J.W. Chen, and J.Z. Zhanga, Parallel computation of real solving bivariate polynomial systems by zero-matching method, Appl. Math. Comput. 219(14) (2013), pp. 7533–7541.
   Web of Science ®Google Scholar
• X.L. Qin, Z. Sun, T. Leng, and Y. Feng, Computing the determinant of a matrix with polynomial entries by approximation, J. Syst. Sci. Complex., in press.
   Web of Science ®Google Scholar
• X.L. Qin, L. Yang, Y. Feng, B. Bachmann, and P. Fritzson, Index reduction of differential algebraic equations by differential algebraic elimination, preprint (2015). Available at http://arxiv.org/abs/1504.04977.
   Google Scholar
• T. Saxena, Efficient variable elimination using resultants, Ph.D. thesis, the University at Albany, State University of New York, 1996.
   Google Scholar
• B. Sturmfels, Sparse elimination theory, in Proceedings of Computational Algebraic Geometry and Commutative Algebra, Cortona, Italy, June 1991, D. Eisenbud and L. Robbiano, eds., Cambridge University Press, Cambridge, 1993, pp. 264–298.
   Google Scholar
• J J. Sylvester, On a theory of syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm's functions, and that of the greatest algebraical common measure, Philos. Trans. R. Soc. London 143 (1853), pp. 407–548. doi: 10.1098/rstl.1853.0018
   Google Scholar
• Z.H. Wang, H.Y. Hu, and T. Küpper, Robust stability test of polytopic family of polynomials: The Dixon's resultant method, Latin Amer. Appl. Res. 33(1) (2003), pp. 63–66.
   Web of Science ®Google Scholar
• W. Wu and X.S. Gao, Mathematics mechanization and applications after thirty years, Front. Comput. Sci. 1(1) (2007), pp. 1–8. doi: 10.1007/s11704-007-0001-8
   Google Scholar
• W. Xiao and E.W. Chionh, Formal Power Series and Loose Entry Formulas for the Dixon Matrix, Lecture Notes in Computer Science, Springer, Berlin, 2005, pp. 72–82.
   Google Scholar
• L. Yang, H.G. Fu, and Z.B. Zeng, A Practical Symbolic Algorithm for Inverse Kinematics of 6R Manipulators with Simple Geometry. Automated Deduction-CADE-14, Lecture Notes in Computer Science Volume 1249, Springer, Berlin, 1997, pp. 73–86.
   Google Scholar
• L. Yang and X.R. Hou, Gather-and-Shift: A Symbolic Method for Solving Polynomial Systems, Proceedings of the First Asian Technology Conference on Mathematics, Association of Mathematics Educators, Singapore, 1995, pp. 771–780.
   Google Scholar
• L. Yang, Z.B. Zeng, and W.N. Zhang, Differential elimination with Dixon resultants, Appl. Math. Comput. 218(21) (2012), pp. 10679–10690.
   Web of Science ®Google Scholar
• L. Yang, J.Z. Zhang, and X.R. Hou, Nonlinear Algbraic Equation System and Automated Theorem Proving (in Chinese), Shanghai Scientific and Technological Education Publishing House, Shanghai, 1996, pp. 86–92.
   Google Scholar
• S.Z. Zhao, Dixon resultant research and new algorithms (in Chinese), Ph.D. thesis, Graduate University of Chinese Academy of Sciences, Beijing, 2006.
   Google Scholar
• S.Z. Zhao and H.G. Fu, An extended fast algorithm for constructing the Dixon resultant matrix, Sci. China Ser. A: Math. 48(1) (2005), pp. 131–143. doi: 10.1360/04YS0166
   Google Scholar
• S.Z. Zhao and H.G. Fu, Three kinds of extraneous factors in Dixon resultants, Sci. China Ser. A: Math. 52(1) (2009), pp. 160–172. doi: 10.1007/s11425-008-0094-z
   Google Scholar
• S.Z. Zhao and H.G. Fu, Multivariate Sylvester resultant and extraneous factors (in Chinese), Sci. China Ser. A: Math. 40(7) (2010), pp. 649–660.
   Google Scholar