The {\em tensor power method} generalizes the matrix method to higher order arrays, or tensors. Like in case, fixed points of are eigenvectors tensor. While every real symmetric has an eigendecomposition, vectors generating a decomposition not always In this paper we show that whenever eigenvector is} generator tensor, then (if is sufficiently high) robust} , i.e., it attracting point method....

We analyze the eigenvectors of generalized Laplacian for two metric graphs occurring in practical applications. In accordance with random network theory, localization an eigenvector is rare and should be tuned to observe exactly localized eigenvectors. derive resonance conditions obtain various geometric configurations their combinations form more complicated resonant structures. These suggest ...

The Kohn-Sham equation in first-principles density functional theory (DFT) calculations is a nonlinear eigenvalue problem. Solving the nonlinear eigenproblem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshevfiltered subspace iteration (CheFSI) ...