메뉴 건너뛰기




Volumn 37, Issue 3, 2007, Pages 351-367

Dynamic enumeration of all mixed cells

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33947241231     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1300-9     Document Type: Article
Times cited : (25)

References (24)
  • 1
    • 34250406508 scopus 로고
    • The number of roots of a system of equations
    • D. N. Bernshtein, The number of roots of a system of equations, Funct. Anal. Appl. 9, 183-185 (1975).
    • (1975) Funct. Anal. Appl , vol.9 , pp. 183-185
    • Bernshtein, D.N.1
  • 2
    • 26344444273 scopus 로고
    • A faster way to count the solutions of inhomogeneous systems of algebraic equations
    • G. Björk and R.Fröberg, A faster way to count the solutions of inhomogeneous systems of algebraic equations, J. Symbolic Comput. 12(3), 329-336 (1991).
    • (1991) J. Symbolic Comput , vol.12 , Issue.3 , pp. 329-336
    • Björk, G.1    Fröberg, R.2
  • 3
    • 0002820505 scopus 로고
    • Some examples for solving systems of algebraic equations by calculating Groebner bases
    • W. Boege, R. Gebauer and H. Kredel, Some examples for solving systems of algebraic equations by calculating Groebner bases, J. Symbolic Comput. 2, 83-98 (1986).
    • (1986) J. Symbolic Comput , vol.2 , pp. 83-98
    • Boege, W.1    Gebauer, R.2    Kredel, H.3
  • 6
    • 0037334665 scopus 로고    scopus 로고
    • Computing all nonsingular solutions of a cyclic-n polynomial using polyhedral homotopy continuation methods
    • Y. Dai, S. Kim and M. Kojima, Computing all nonsingular solutions of a cyclic-n polynomial using polyhedral homotopy continuation methods, J. Comput. Appl. Math. 152, 83-97 (2003).
    • (2003) J. Comput. Appl. Math , vol.152 , pp. 83-97
    • Dai, Y.1    Kim, S.2    Kojima, M.3
  • 7
    • 0000348667 scopus 로고    scopus 로고
    • I. Z. Emiris and J. F. Canny, Efficient incremental algorithms for the sparse resultant and the mixed J. Symbolic Comput. 20, 117-149 (1995). Software available at http://cgi.di.uoa.gr/~emiris/index-eng. html.
    • I. Z. Emiris and J. F. Canny, Efficient incremental algorithms for the sparse resultant and the mixed volume, J. Symbolic Comput. 20, 117-149 (1995). Software available at http://cgi.di.uoa.gr/~emiris/index-eng. html.
  • 8
    • 0038499771 scopus 로고    scopus 로고
    • Mixed volume computation via linear programming
    • T. Gao and T. Y. Li, Mixed volume computation via linear programming, Taiwanese J. Math. 4, 599-619 (2000).
    • (2000) Taiwanese J. Math , vol.4 , pp. 599-619
    • Gao, T.1    Li, T.Y.2
  • 9
    • 0038675267 scopus 로고    scopus 로고
    • Mixed volume computation for semi-mixed systems
    • T. Gao and T. Y. Li, Mixed volume computation for semi-mixed systems, Discrete Comput. Geom. 29(2), 257-277 (2003).
    • (2003) Discrete Comput. Geom , vol.29 , Issue.2 , pp. 257-277
    • Gao, T.1    Li, T.Y.2
  • 10
    • 33745183751 scopus 로고    scopus 로고
    • T. Gao, T. Y. Li and M. Wu, MixedVol: a software package for mixed computation, ACM Trans. Math. Software 31(4), (2005). Software available at http://www.csulb.edu/~tgao/.
    • T. Gao, T. Y. Li and M. Wu, MixedVol: a software package for mixed volume computation, ACM Trans. Math. Software 31(4), (2005). Software available at http://www.csulb.edu/~tgao/.
  • 12
    • 33745676322 scopus 로고    scopus 로고
    • PHoMpara-parallel implementation of the polyhedral homotopy continuation method
    • T. Gunji, S. Kim, K. Fujisawa and M. Kojima, PHoMpara-parallel implementation of the polyhedral homotopy continuation method, Computing 77(4), 387-411 (2006).
    • (2006) Computing , vol.77 , Issue.4 , pp. 387-411
    • Gunji, T.1    Kim, S.2    Fujisawa, K.3    Kojima, M.4
  • 13
    • 0035999219 scopus 로고    scopus 로고
    • A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
    • L. Gurvits and A. Samorodnitsky, A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary, Discrete Comput. Geom. 27(4), 531-550 (2002).
    • (2002) Discrete Comput. Geom , vol.27 , Issue.4 , pp. 531-550
    • Gurvits, L.1    Samorodnitsky, A.2
  • 14
    • 84968520678 scopus 로고
    • A polyhedral method for solving sparse polynomial systems
    • B. Huber and B. Sturmfels, A polyhedral method for solving sparse polynomial systems, Math. Comp. 64, 1541-1555 (1995).
    • (1995) Math. Comp , vol.64 , pp. 1541-1555
    • Huber, B.1    Sturmfels, B.2
  • 15
    • 10644221358 scopus 로고    scopus 로고
    • Numerical stability of path tracing in polyhedral homotopy continuation methods
    • S. Kim and M. Kojima, Numerical stability of path tracing in polyhedral homotopy continuation methods, Computing 73, 329-348 (2004).
    • (2004) Computing , vol.73 , pp. 329-348
    • Kim, S.1    Kojima, M.2
  • 16
    • 0012328027 scopus 로고    scopus 로고
    • Solving polynomial systems by polyhedral homotopies
    • T. Y. Li, Solving polynomial systems by polyhedral homotopies, Taiwanese J. Math. 3, 251-279 (1999).
    • (1999) Taiwanese J. Math , vol.3 , pp. 251-279
    • Li, T.Y.1
  • 17
    • 0012316556 scopus 로고    scopus 로고
    • T. Y. Li and X. Li, Finding mixed cells in the mixed computation, Found. Comput. Math. 1, 161-181 (2001). Software available at http://www.math.msu.edu/~li/.
    • T. Y. Li and X. Li, Finding mixed cells in the mixed volume computation, Found. Comput. Math. 1, 161-181 (2001). Software available at http://www.math.msu.edu/~li/.
  • 18
    • 0001332760 scopus 로고    scopus 로고
    • A computational study of branch and bound search strategies for mixed integer programming
    • J. T. Linderoth and M. W. P. Savelsbergh, A computational study of branch and bound search strategies for mixed integer programming, INFORMS J. Comput. 11, 173-187 (1999)
    • (1999) INFORMS J. Comput , vol.11 , pp. 173-187
    • Linderoth, J.T.1    Savelsbergh, M.W.P.2
  • 20
    • 0000974924 scopus 로고
    • A neural network modeled by an adaptive Lotka-Volterra system
    • V. W. Noonburg, A neural network modeled by an adaptive Lotka-Volterra system, SIAM J. Appl. Math. 49, 1779-1792 (1989).
    • (1989) SIAM J. Appl. Math , vol.49 , pp. 1779-1792
    • Noonburg, V.W.1
  • 21
    • 0242530938 scopus 로고    scopus 로고
    • A. Takeda, M. Kojima and K. Fujisawa, Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method, J. Oper, Res. Soc. Japan 45, 64-82 (2002). Software available at http://www.is.titech.ac.jp/~kojima/index.html.
    • A. Takeda, M. Kojima and K. Fujisawa, Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method, J. Oper, Res. Soc. Japan 45, 64-82 (2002). Software available at http://www.is.titech.ac.jp/~kojima/index.html.
  • 23
    • 0001656792 scopus 로고    scopus 로고
    • J. Verschelde, Algorithm 795: PHCPACK: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software 25, 251-276 (1999). Software available at http://www.math.uic.edu/~jan/.
    • J. Verschelde, Algorithm 795: PHCPACK: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software 25, 251-276 (1999). Software available at http://www.math.uic.edu/~jan/.
  • 24
    • 0028449799 scopus 로고
    • Homotopies exploiting Newton polytopes for solving sparse polynomial systems
    • J. Verschelde, P. Verlinden and R. Cools, Homotopies exploiting Newton polytopes for solving sparse polynomial systems, SIAM J. Numer. Anal. 31, 915-930 (1994).
    • (1994) SIAM J. Numer. Anal , vol.31 , pp. 915-930
    • Verschelde, J.1    Verlinden, P.2    Cools, R.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.