http://swrc.ontoware.org/ontology#TechnicalReport
Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds
en
Graduate School of Informatics, Kyoto University
Graduate School of Informatics, Kyoto University
Graduate School of Informatics, Kyoto University
Academic Group of Information and Computer Sciences, Nara Women's University
Graduate School of Informatics, Kyoto University
Kinji Kimura
Takuto Akiyama
Hiroyuki Ishigami
Masami Takata
Yoshimasa Nakamura
The continued fraction method for isolating the positive roots of a univariate polynomial equation is based on Vincent's theorem, which computes all of the real roots of polynomial equations. In this paper, we propose two new lower bounds which accelerate the fraction method. The two proposed bounds are derived from a theorem stated by Akritas et al., and use different pairing strategies for the coefficients of the target polynomial equations from the bounds proposed by Akritas et al. Numerical experiments show that the proposed lower bounds are more effective than existing bounds for some special polynomial equations and random polynomial equations, and are competitive with them for other special polynomial equations.
The continued fraction method for isolating the positive roots of a univariate polynomial equation is based on Vincent's theorem, which computes all of the real roots of polynomial equations. In this paper, we propose two new lower bounds which accelerate the fraction method. The two proposed bounds are derived from a theorem stated by Akritas et al., and use different pairing strategies for the coefficients of the target polynomial equations from the bounds proposed by Akritas et al. Numerical experiments show that the proposed lower bounds are more effective than existing bounds for some special polynomial equations and random polynomial equations, and are competitive with them for other special polynomial equations.
AN10505667
研究報告数理モデル化と問題解決（MPS）
2014-MPS-99
6
1-4
2014-07-14