A new algorithm for computing eigenpairs of matrices
DOI10.1016/j.mcm.2011.01.043zbMath1225.65044OpenAlexW1973802116MaRDI QIDQ646056
Ali Jamalian, Hossein Aminikhah
Publication date: 11 November 2011
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.01.043
eigenvalueeigenvectorparticle swarm optimization\texttt{MATLAB}restarted Arnoldi method\texttt{PSO-RA}nonsymmetric matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Approximation methods and heuristics in mathematical programming (90C59) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The application of homotopy perturbation method for MHD flows of UCM fluids above porous stretching sheets
- Effects of partial slip on the peristaltic flow of a MHD Newtonian fluid in an asymmetric channel
- A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Analytical solutions to the pulsed Klein-Gordon equation using modified variational iteration method (MVIM) and Boubaker polynomials expansion scheme (BPES)
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A Chebyshev-like semiiteration for inconsistent linear systems
- A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
This page was built for publication: A new algorithm for computing eigenpairs of matrices