A new algorithm for computing eigenpairs of matrices
From MaRDI portal
Recommendations
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
- 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
- An algorithm for computing eigenvalues and eigenvectors of real and symmetric matrix
- A hybrid glowworm swarm optimization algorithm for solving matrix eigenvalues
Cites work
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Chebyshev-like semiiteration for inconsistent linear systems
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
- A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A new 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)
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Effects of partial slip on the peristaltic flow of a MHD Newtonian fluid in an asymmetric channel
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Numerical methods for large eigenvalue problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- The application of homotopy perturbation method for MHD flows of UCM fluids above porous stretching sheets
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
Cited in
(8)- Generalisation of a quadrilateral duality theorem
- A fast eigenvalue algorithm for Pascal matrices
- A New Algorithm for Computing the Rank of a Matrix
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
- A Simple and Efficient Algorithm for Eigenvalues Computation
- scientific article; zbMATH DE number 3148736 (Why is no real title available?)
- A hybrid glowworm swarm optimization algorithm for solving matrix eigenvalues
- Robust exponential concurrent learning adaptive control for systems preceded by dead-zone input nonlinearity
This page was built for publication: A new algorithm for computing eigenpairs of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646056)