An Improved Shift Strategy for the Modified Discrete Lotka-Volterra with Shift Algorithm

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a new mathematical shift strategy for the modified discrete Lotka-Volterra with shift (mdLVs) algorithm. The mdLVs algorithm computes the singular values of bidiagonal matrices. It is known that the convergence of the mdLVs algorithm is accelerated when the shift is close to and less than the square of the smallest singular value of the input matrix. In the original mdLVs algorithm, the Johnson bound is adopted. Our improved mdLVs algorithm combines the Gerschgorin-type bound, the Kato-Temple bound, the Laguerre shift, and the generalized Newton shift. For different combinations, we discuss the computational time and number of iterations.

• 2011-07-11

著者

• Kinji Kimura

  Kyoto University

• Yoshimasa Nakamura

  Kyoto University

• Masami Takata

  Nara Women's University

• Takumi Yamashita

  Kyoto University

• Akira Ajisaka

  Kyoto 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

もっと見る 閉じる

スポンサーリンク