Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 2014-07-14
著者
-
Kinji Kimura
Kyoto University
-
Hiroyuki Ishigami
Graduate school of Informatics, Kyoto University
-
Kinji Kimura
Graduate school of Informatics, Kyoto University
-
Yoshimasa Nakamura
Graduate school of Informatics, Kyoto University
-
Hiroyuki Ishigami
Graduate School Of Informatics Kyoto University
-
Takuto Akiyama
Graduate School of Informatics, Kyoto University
-
Masami Takata
Academic Group of Information and Computer Sciences, Nara Women's University
関連論文
- Algebraic Approaches to Underdetermined Experiments in Biology
- Resultant-factorization Technique for Obtaining Solutions to Ordinary Differential Equations
- An Improved Shift Strategy for the Modified Discrete Lotka-Volterra with Shift Algorithm
- Implementation and performance evaluation of new inverse iteration algorithm with Householder transformation in terms of the compact WY representation
- Performance Evaluation of Some Inverse Iteration Algorithms on PowerXCellTM 8i Processor
- Improved Computation of Bounds for Positive Roots of Polynomials
- Implementation of the Orthogonal QD Algorithm for Lower Tridiagonal Matrices
- On Implementation and Evaluation of Inverse Iteration Algorithm with Compact WY Orthogonalization
- Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds