An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems
Publication:1195466
DOI10.1016/0021-9991(92)90315-PzbMath0759.65070MaRDI QIDQ1195466
Publication date: 8 November 1992
Published in: Journal of Computational Physics (Search for Journal in Brave)
algorithmseigenvaluefinite elementeigenvectorsOrr-Sommerfeld equationeigenpairsArnoldi iterationsubspace iterationchemical reactor equationunsymmetric Lanczos procedure
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Estimates of eigenvalues in context of PDEs (35P15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Related Items (9)
Cites Work
- An algorithm for the computation of Hopf bifurcation points in comparison with other methods
- Complex shift and invert strategies for real matrices
- An efficient method for computing leading eigenvalues and eigenvectors of large asymmetric matrices
- A generalized nonsymmetric Lanczos procedure
- Numerical solution of large nonsymmetric eigenvalue problems
- A finite-element study of the onset of vortex shedding in flow past variously shaped bodies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems