A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
DOI10.1016/J.AMC.2007.01.043zbMATH Open1193.65040OpenAlexW1982790889MaRDI QIDQ990403FDOQ990403
Authors: H. Ghazvini, Jafar Saberi-Nadjafi, J. Biazar, Seyyed Hassan Taheri 
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.01.043
Recommendations
- A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- A new algorithm for computing eigenpairs of matrices
- A modification on minimum 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
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
eigenvalueeigenvectorrestarted Arnoldi methodnon-symmetric matrixelectromagnetism meta-heuristic method
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
- Principles of scatter search
- An electromagnetism-like mechanism for global optimization
- Numerical methods for large eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- On the convergence of a population-based global optimization algorithm
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- 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
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A Chebyshev-like semiiteration for inconsistent linear systems
Cited In (5)
- Solutions of time-dependent Emden-Fowler type equations by homotopy-perturbation method
- Homotopy perturbation method for modified Camassa-Holm and Degasperis-Procesi equations
- Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- A new algorithm for computing eigenpairs of matrices
- A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
Uses Software
This page was built for publication: A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990403)
