Computing the leading eigenvector of a symmetric real matrix is a fundamental primitive of numerical linear algebra with numerous applications. We consider a natural online extension of the leading eigenvector problem: a sequence of matrices is presented and the goal is to predict for each matrix a unit vector, with the overall goal of competing with the leading eigenvector of the cumulative ma...

Abstract As an extension of Sylvester’s matrix, a tridiagonal matrix is investigated by determining both left and right eigenvectors. Orthogonality relations between eigenvectors are derived. Two determinants the matrices constructed evaluated in closed form.

In spectral clustering, one defines a similarity matrix for a collection of data points, transforms the matrix to get the Laplacian matrix, finds the eigenvectors of the Laplacian matrix, and obtains a partition of the data using the leading eigenvectors. The last step is sometimes referred to as rounding, where one needs to decide how many leading eigenvectors to use, to determine the number o...

When attempting to develop wavelet transforms for graphs and networks, some researchers have used graph Laplacian eigenvalues and eigenvectors in place of the frequencies and complex exponentials in the Fourier theory for regular lattices in the Euclidean domains. This viewpoint, however, has a fundamental flaw: on a general graph, the Laplacian eigenvalues cannot be interpreted as the frequenc...

We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). Traditionally, all the CG iteration vectors could be saved and recombined through the eigenvectors of the tridiagonal projection matrix, which is equivalent theoretically to unrestarted Lanczos. Our algorithm capit...

Spectral decorrelation (transformations) methods have long been used in remote sensing. Transformation of the image data onto eigenvectors that comprise physically meaningful spectral properties (signal) can be used to reduce the dimensionality of hyperspectral images as the number of spectrally distinct signal sources composing a given hyperspectral scene is generally much less than the number...

For the one-dimensional XXX model under the periodic boundary conditions, we discuss two types of eigenvectors, regular eigenvectors which have finite-valued rapidities satisfying the Bethe ansatz equations, and non-regular eigenvectors which are descendants of some regular eigenvectors under the action of the SU(2) spin-lowering operator. It was pointed out by many authors that the non-regular...

For the one-dimensional XXX model under the periodic boundary conditions, we discuss two types of eigenvectors, regular eigenvectors which have finite-valued rapidities satisfying the Bethe ansatz equations, and non-regular eigenvectors which are descendants of some regular eigenvectors under the action of the SU(2) spin-lowering operator. It was pointed out by many authors that the non-regular...

In this article, nondegeneracy of singular vector tuples, Z-eigenvectors and eigenvectors tensors is studied, which have found many applications in diverse areas. The main results are: (i) each (Z-)eigenvector/singular tuple a generic tensor nondegenerate, (ii) nonzero Z-eigenvector/singular an orthogonally decomposable nondegenerate.