• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.145-155
• /
• 1997

We present a couple of tools that can be used in the solution of nonsymmetric eigenvalue problems. The first one allows us to convert power iterates into Arnoldi's results so that a few eigenpairs are easily obtainable. The other converts Arnoldi's results into power iterates to simulate the power method and improve the result. Suggestions for application are also given.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.734-736
• /
• 1996

This paper presents a method of calculating a selective number of eigenvalues in power systems, which are rightmost, or are largest modulus. The modified Arnoldi method in conjunction with implicit shift OR-algorithm is used to calculate the rightmost eigenvalues. Algorithm requires neither a prior knowledge of the specified shifts nor the calculation of inverse matrix. The key advantage of the algorithm is its ability to converge to the wanted eigenvalues at once. The method is compared with the modified Arnoldi method combined with S-matrix transformation, where the eigenvalues having the largest modulus are to be determined. The two methods are applied to the reduced Kansai system. Convergence characteristics and performances are compared. Results show that both methods are robust and has good convergence properties. However, the implicit shift OR method is seen to be faster than the S-matrix method under the same condition.