Improved Computation of Bounds for Positive Roots of Polynomials
スポンサーリンク
概要
- 論文の詳細を見る
A new lower bound for computing positive roots of polynomial equations is proposed. We discuss a two-stage algorithm for computing positive roots of polynomial equations. We employ the new bound to accelerate the continued fraction method based on Vincent's theorem. Finally, we conduct experiments to evaluate the effectiveness of the proposed lower bound.
- 2013-07-15
著者
-
Kinji Kimura
Kyoto University
-
Masami Takata
Nara Women's University
-
Kinji Kimura
Graduate school of Informatics, Kyoto University
-
Yoshimasa Nakamura
Graduate school of Informatics, Kyoto University
-
Masami Takata
Academic Group of Information and Computer Sciences, Nara Women's University
-
Takuto Akiyama
Graduate School of Informatics, Kyoto University
-
Sho Araki
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
- AR based Spatial Reasoning Capacity Training for Students
- Real Time Spatiotemporal Biological Stress Level Checking
- 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