• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2002 Fiscal Year Final Research Report Summary

Polyhedral Homotopy Continuation Methods for Computing All Real and Complex Solutions of Systems of Polynomial Equations

Research Project

Project/Area Number 13650444
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field System engineering
Research InstitutionTokyo Institute of Technology

Principal Investigator

KOJIMA Masakazu  Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Professor, 大学院・情報理工学研究科, 教授 (90092551)

Co-Investigator(Kenkyū-buntansha) FUJISAWA Katsuki  Tokyo Denki University, Faculty of Science and Engineering, Associate Professor, 理工学部, 助教授 (40303854)
MATSUOKA Satoshi  Tokyo Institute of Technology, Global Scientific Information and Computing Center, Professor, 学術国際情報センター, 教授 (20221583)
Project Period (FY) 2001 – 2002
KeywordsSystem of Polynomial Equations / Polyhedral Homotopy Method / Predictor-Corrector Method / Parallel Computation / Ninf
Research Abstract

The purpose of this research project is to develop practical numerical methods for all real and complex solutions of large scale systems of polynomial equations. The polyhedral homotopy continuation method used in this research consists of the following three phases :
Phase 1 : Construction of polyhedral homotopy systems.
Phase 2 : Numerical tracing of homotopy paths by the predictor-corrector method.
Phase 3 : Verification of solutions.
In 2001, we designed and developed basic algorithms for each phase above. In 2002, we studied the following issues.
1. Improvement of computational efficiency in each phase. In phase 1, we proposed an efficient construction of homotopy systems arising from symmetric systems of polynomial equations. We incorporated a linear algebra library LAPACK into phase 2, and developed a new method for verifying and classifying solutions of the cyclic polynomial.
2. Improvement of numerical stability in each phase. Linear systems to be solved in phase 2 become often so ill-conditioned that computation of their accurate solutions are difficult. We devised new dynamic scaling techniques to resolve this difficulty. We confirmed through numerical experiments that the use of these scaling techniques together with the singular value decomposition worked very effectively to improve the numerical stability of phase 2.
3. We combined the three phases into a software package PHoM, and released it through Internet. This software solved some large scale systems of polynomial equations that had not been solved before. In conclusion, this research project has accomplished its purpose mentioned above.
4. We have started a parallel implementation of PHoM, which will continue in the next year.

  • Research Products

    (12 results)

All Other

All Publications (12 results)

  • [Publications] Y.Dai: "Computing All Nonsingular Solutions of Cyclic-n Polynomial Using Polyhedral Homotopy Continuation Methods"Journal of Computational and Applied Mathematics. 152・1-2. 83-97 (2003)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Gunji: "PHoM --a Polyhedral Homotopy Continuation Method"Research Report. B-386. 1-17 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Kim: "CMPSm : A Continuation Method for Polynomial Systems (MATLAB version)"Mathematical Software (Arjeh M Cohen, Xiao-Shan Gao and Nobuki Takakayama, Editors), World Scientific, Singapore. 285-306 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Kim: "CMPSc : A Continuation Method for Polynomial Systems (C++ version)"Research Report. B-378. 1-19 (2003)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Kim: "Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods"Research Report. B-390. 1-12 (2003)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] A.Takeda: "Enumeration of All Solutions of a Combinatorial Linear Inequality System Arising from the Polyhedral Homotopy Continuation Method"Journal of the Operations Research Society of Japan. 45・1. 64-82 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y. Dai et al.: "Computing All Nonsingular Solutions of Cyclic-n Polynomial Using Polyhedral Homotopy Continuation Methods"Journal of Computational and Applied Mathematics. 152, No.1-2. 83-97 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T. Gunji et al.: "PHoM - a Polyhedral Homotopy Continuation Method"Research Report, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, December 2002. Revised January 2003. B-378.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. Kim et al.: "CMPSc : A Continuation Method for Polynomial Systems (C++ version)"Research Report, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, March 2002. Revised April 2002. B-378.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. Kim et al.: "Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods"Research Report, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, March 2003. B-378.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] A. Takeda et al.: "Enumeration of All solutions of a combinatorial Linear Inequality System Arising from the Polyhedral Homotopy Continuation Method"Journal of the Operations Research Society of Japan. 45, No.1. 64-82 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. Kim et al. , editors by Arjeh M Cohen, Xiao-Shan Gao and Nobuki Takakayama: "CMPSm : A Continuation Method for Polynomial Systems (MATLAB version) Mathematical Software"World Scientific. 285-306 (2002)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2004-04-14  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi