Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,104,062 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
42 relations
Algorithm
Arnoldi iteration
Bisection method
Centrality
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
The theory of variational hybrid quantum-classical algorithms
J. McClean
,
J. Romero
,
R. Babbush
,
Alán Aspuru-Guzik
2015
Corpus ID: 92988541
Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy…
Expand
Highly Cited
2013
Highly Cited
2013
Dynamic Mode Decomposition
Uri Shaham
2013
Corpus ID: 173175464
DMD is a dimensionality reduction technique for time series, with which we can also analyze the dynamic behavior of the time…
Expand
Highly Cited
2012
Highly Cited
2012
A linear eigenvalue algorithm for the nonlinear eigenvalue problem
E. Jarlebring
,
W. Michiels
,
K. Meerbergen
Numerische Mathematik
2012
Corpus ID: 5597820
The Arnoldi method for standard eigenvalue problems possesses several attractive properties making it robust, reliable and…
Expand
Highly Cited
2009
Highly Cited
2009
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
U. Kang
,
Charalampos E. Tsourakakis
,
C. Faloutsos
Ninth IEEE International Conference on Data…
2009
Corpus ID: 6598415
In this paper, we describe PEGASUS, an open source Peta Graph Mining library which performs typical graph mining tasks such as…
Expand
Highly Cited
2007
Highly Cited
2007
The matrix eigenvalue problem - GR and Krylov subspace methods
David S. Watkins
2007
Corpus ID: 6105086
This book presents the first in-depth, complete, and unified theoretical discussion of the two most important classes of…
Expand
Highly Cited
2004
Highly Cited
2004
Spatiospectral Concentration on a Sphere
F. Simons
,
F. Dahlen
,
M. Wieczorek
SIAM Review
2004
Corpus ID: 27519592
We pose and solve the analogue of Slepian's time-frequency concentration problem on the surface of the unit sphere to determine…
Expand
Highly Cited
1994
Highly Cited
1994
A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
R. Grimes
,
J. G. Lewis
,
H. Simon
1994
Corpus ID: 18234733
An "industrial strength" algorithm for solving sparse symmetric generalized eigenproblems is described. The algorithm has its…
Expand
Highly Cited
1988
Highly Cited
1988
Mode localization and eigenvalue loci veering phenomena in disordered structures
C. Pierre
1988
Corpus ID: 59421498
Highly Cited
1980
Highly Cited
1980
The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems
T. Ericsson
,
Axel Ruhe
1980
Corpus ID: 1200292
A new algorithm is developed which computes a specified number of eigenvalues in any part of the spectrum of a generalized…
Expand
Highly Cited
1951
Highly Cited
1951
The principle of minimized iterations in the solution of the matrix eigenvalue problem
W. Arnoldi
1951
Corpus ID: 115852469
An interpretation of Dr. Cornelius Lanczos' iteration method, which he has named "minimized iterations", is discussed in this…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE