Abstract
In this paper we report two advances in the classical subspace iteration method for eigenvalue problems arising in finite element analysis. One extends the computable error bound proposed by Matthies to the case with nonzero shift and the other is an aggressive shift for the subspace iteration. Numerical tests show that the propose method can effectively improve the performance of the subspace iteration method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bathe KJ, Wilson EL. Large eigenvalue problems in dynamic analysis. J Engng Mech Div ASCE, 1972; 98: 1471–1485.
Bathe KJ, Ramaswamy S. An accelerated subspace iteration method. Comput Meth Appl Mech Engrg, 1980; 23:313–331.
Bathe KJ. Finite Element Procedure. Prentice-Hall, 1996.
Yamamoto Y, Ohtsubo H. Subspace iteration accelerated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices. Int J Numer Meth Engrg, 1976; 10: 935–944.
Akl FA, Dilger WH, Irons BM. Over-relaxation and subspace iteration. Int J Numer Meth Engrg, 1979; 14: 629–630.
Akl FA, Dilger WH, Irons BM. Acceleration of subspace iteration. Int J Numer Meth Engrg, 1982; 18: 583–589.
Bertolini AF, Lam YC. Accelerated reduction of subspace upper bound by multiple inverse iteration. Comput Systems Engrg, 1995; 6: 67–72
Rajendran S, Liew KM. A variant of the subspace iteration algorithm for generalized eigenproblems. Int J Numer Meth Engrg, 2003; 57: 2027–2042.
Lee JH, Kim HT. Hybrid method for natural frequency extraction: Performance improvement using Newton-Raphson method. Journal of Electromagnetic Waves and Applications, 2005; 19: 1043–1055.
Wilson EL, Itoh T. An eigensolution strategy for large systems. Comput. Struct., 1983; 16: 259–265.
Hughes TJR. The Finite Element Method — Linear Static and Dynamics Finite Element Analysis. Prentice-Hall, 1987.
Nguyen DT, Bunting CF, Moeller MJ, Runesha H, Qin J. Subspace and Lanczos sparse eigen-solvers for finite element structural and electromagnetic applications. Advances in Engineering Software, 2000; 31: 599–606.
Gong YC, Zhou HW, Yuan MW, Chen P. Comparison of Subspace Iteration, Iterative Ritz Vector Method and Iterative Lanczos Method. Journal of Vibration Engineering, 2005; 18: 227–232 (in Chinese).
Matthies H. Computable error bounds for the generalized symmetric eigenproblem. Communications in Applied Numerical Methods, 1985; 1: 33–38.
Chen P, Zheng D, Sun SL, Yuan MW. High performance sparse static solver in finite element analyses with loop-unrolling. Advances in Engineering Software, 2003; 34: 203–215.
Chen P, Sun SL. A New high performance sparse static solver in finite element analyses. Acta Mechanica Solida Sinica, 2005; 18: 248–255.
Yuan MW et al. SAP84 — A General Program on Microcomputer (Version 6.1). Peking University, Beijing, China, 2003 (in Chinese).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Tsinghua University Press & Springer
About this paper
Cite this paper
Chen, P., Zhao, Q.C., Peng, W.B., Chen, Y.Q., Yuan, M.W. (2007). Advances in Classical Subspace Iteration Method for Eigenvalue Problem. In: Computational Mechanics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75999-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-75999-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75998-0
Online ISBN: 978-3-540-75999-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)