Numerical solution of large nonsymmetric eigenvalue problems
From MaRDI portal
Publication:1330635
DOI10.1016/0010-4655(89)90149-5zbMath0798.65053OpenAlexW2056104165MaRDI QIDQ1330635
Publication date: 21 July 1994
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/19890017268
eigenvalueseigenvectorsKrylov subspace techniqueslarge sparse matricesArnoldi's methodpolynomial accelerationshift-and-invertpreconditioningsLanczos proceduredeflation proceduresSchur vectors
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (23)
Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices ⋮ An implicit filter for rational Krylov using core transformations ⋮ The instability of the steady flow past spheres and disks ⋮ A direct method for computation of simple bifurcations ⋮ Harmonic projection methods for large non-symmetric eigenvalue problems ⋮ Finding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblem ⋮ A method for the numerical computation of Hopf bifurcation ⋮ Stability of eccentric core–annular flow ⋮ Linear stability analysis in fluid-structure interaction with transpiration. II: Numerical analysis and applications. ⋮ On restarting the Arnoldi method for large nonsymmetric eigenvalue problems ⋮ Solution of the eigenvalue problems resulting from global non-parallel flow stability analysis ⋮ An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems ⋮ Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices ⋮ Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem ⋮ A modified second-order Arnoldi method for solving the quadratic eigenvalue problems ⋮ Convergence of Arnoldi's method for generalized eigenvalue problems ⋮ A key to choose subspace size in implicitly restarted Arnoldi method ⋮ Onset of global instability in the flow past a circular cylinder cascade ⋮ Feast Eigensolver for Non-Hermitian Problems ⋮ Dynamic characteristic analysis of a 3-D semi-submerged body as a fluid-structure interaction system ⋮ A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems ⋮ Using implicitly filtered RKS for generalised eigenvalue problems ⋮ Branch switching techniques for bifurcation in soil deformation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rational Krylov sequence methods for eigenvalue computation
- Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- Bifurcating time periodic solutions and their stability
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Iterative Solution of Linear Equations in ODE Codes
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- A Simultaneous Iteration Algorithm for Real Matrices
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
- Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
- A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem
- Finite element analysis of Supersonic panel flutter
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: Numerical solution of large nonsymmetric eigenvalue problems