No Access

A Numerical Method to Solve Nonsymmetric Eigensystems Applied to Dynamics of Turbomachinery

Department of Mechanical Engineering, Instituto Tecnológico de Aeronáutica, Praça Marechal do Ar Eduardo Gomes, 50, Vila das Acácias, São José dos Campos, SP 12228-900, Brazil

E-mail Address: arfaria@ita.br

Corresponding author.

Search for more papers by this author

Omair Alhatim

King Abdulaziz City for Science and Technology (KACST), An Nakhil, King Abdulaziz City for Science and Technology, Riyadh 12371, Saudi Arabia

E-mail Address: oalhatim@kacst.edu.sa

Search for more papers by this author

, and

Homero Fonseca Santiago Maciel

Turbomachine Veículos e Motores LTDA, Rodovia Geraldo Scavone, 2300, UC 29 e 50 Cond. Califórnia, Jardim Califórnia, Jacareí, SP 12305-490, Brazil

E-mail Address: h.maciel@turbomachine.com.br

Search for more papers by this author

https://doi.org/10.1142/S0219876219500737Cited by:1 (Source: Crossref)

Abstract

In this paper, a canonical transformation is proposed to solve the eigenvalue problem related to the dynamics of rotor-bearing systems. In this problem, all matrices are real, but they may not be symmetric, which leads to the appearance of complex eigenvalues and eigenvectors. The bi-iteration method is selected to solve the original eigenproblem whereas the QR algorithm is adopted to solve the reduced or projected problem. A new canonical transformation of the global eigenproblem which reduces the quadratic eigenproblem to a linear eigenproblem, maintaining numerical stability since all that is required is that the stiffness matrix is well-conditioned, which is always true when it comes to applications in dynamic problems. The proposed technique is good for obtaining dominant eigenvalues and corresponding eigenvectors of real nonsymmetric matrices and it possesses the following properties: (i) the matrix is not transformed, therefore sparsity is maintained, (ii) partial eigensolutions can be obtained and (iii) use may be made of good eigenvectors predictions.

Keywords:

Remember to check out the Most Cited Articles!
Check out these titles in finite element methods!

References

Arnoldi, W. E. [1951] “ The principle of minimized iterations in the solution of matrix eigenvalue problems,” Q. Appl. Math. 9(1), 17–29. Crossref, Web of Science, Google Scholar
Brinkmeier, M. and Nackenhorst, U. [2008] “ An approach for large-scale gyroscopic eigenvalue problems with application to high-frequency response of rolling tires,” Comput. Mech. 41(4), 503–515. Crossref, Web of Science, Google Scholar
Chen, W. J. and Gunter, E. J. [2005] Introduction to Dynamics of Rotor-Bearing Systems (Trafford Publishing). Google Scholar
Christensen, M. A. [2001] “General complex eigen-problem solver based on Lanczos algorithm and inverse iteration,” Technical Report, Odense University. Google Scholar
Golub, G. H. and Van Loan, C. F. [1983] Matrix Computations (John Hopkins University Press). Google Scholar
Hyoung, M. K. and Craig Jr., R. R. [1988] “ Structural dynamic analysis using an unsymmetric block Lanczos algorithm,” Int. J. Numer. Methods Eng. 26(10), 2305–2318. Crossref, Web of Science, Google Scholar
Jennings, A. and Stewart, W. J. [1975] “ Simultaneous iteration for partial eigensolution of real matrices,” J. Inst. Math. Appl. 15, 351–361. Crossref, Google Scholar
Kim, S. K. and Chronopoulos, A. T. [1992] “ An efficient nonsymmetric Lanczos method on parallel vector computers,” J. Comput. Appl. Math. 42(3), 357–374. Crossref, Web of Science, Google Scholar
Komzsik, L. [2001] “ Implicit computational solution of generalized quadratic eigenvalue problems,” Finite Elem. Anal. Des. 37(10), 799–810. Crossref, Web of Science, Google Scholar
Lanczos, C. [1950] “ An iteration method for the solution of the eigenvalue problem of linear differential and integral operators,” J. Res. Natl. Bur. Stand. 45(4), 255–282. Crossref, Google Scholar
Lu, Y., Zhu, S. and Fernandez, F. A. [1994] “ The efficient solution of large sparse nonsymmetric and complex eigensystems by subspace iteration,” IEEE Trans. Magn. 30(5), 3582–3585. Crossref, Web of Science, Google Scholar
Press, W. H., Flannery, B. P., Teukolsky, S. A. and Vetterling, W. T. [1992] Numerical Recipes in C: The Art of Scientific Computing, 2nd edition (Cambridge University Press). Google Scholar
Rajakumar, C. and Rogers, C. R. [1991] “ The Lanczos algorithm applied to unsymmetric generalized eigenvalue problems,” Int. J. Numer. Methods Eng. 32(5), 1009–1026. Crossref, Web of Science, Google Scholar
Rajakumar, C. [1993] “ Lanczos algorithm for quadratic eigenvalue problem in engineering applications,” Comput. Methods Appl. Mech. Eng. 105(1), 1–22. Crossref, Web of Science, Google Scholar
Ravibabu, M. and Singh, A. [2018] “ A new variant of Arnoldi method for approximation of eigenpairs,” J. Comput. Appl. Math. 344, 424–437. Crossref, Web of Science, Google Scholar
Wang, X., Niu, Q. and Lu, L.-Z. [2013] “ A refined Arnoldi type method for large scale eigenvalue problems,” Japan J. Ind. Appl. Math. 30(1), 129–143. Crossref, Web of Science, Google Scholar
Wilkinson, J. H. [1965] The Algebraic Eigenvalue Problem (Clarendon Press, Oxford). Google Scholar
Zheng, T. S., Liu, W. M. and Cai, Z. B. [1989] “ A generalized inverse iteration method for solution of quadratic eigenvalue problems in structural dynamic analysis,” Comput. Struct. 33(5), 1139–1143. Crossref, Web of Science, Google Scholar