Skip to search formSkip to main contentSkip to account menu

Eigenvalue algorithm

Known as: Eigensolver, Matrix eigenvalue problem, Symbolic computation of matrix eigenvalues 
In numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix, or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Obtaining highly accurate predictions on properties of light atomic nuclei using the Configuration Interaction (CI)approach… 
2008
2008
The novel idea of the subwavelength waveguide transmission presented in this work relies on the insertion of electric and… 
2006
2006
This paper presents the advances in electromagnetic (EM) field computation that have been enabled by the US DOE SciDAC… 
1999
1999
Abstract.In this paper we present a proof of convergence for a preconditioned subspace method which shows the dependency of the… 
1997
1997
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge… 
1986
1986
The characteristic impedance of finlines with up to three slots is calculated by a rigorous hybrid-mode analysis which includes… 
1986
1986
We give an tmproved versíon of Sameh's parallel norttrreducing eigenvalue algorithm. The use of so-called Euclidean parameters of… 
1973
1973
This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also…