Related papers: Two eigenvectors for the price of one

We study a non-linear eigenvalue problem for vector-valued eigenfunctions and give a succinct uniqueness proof for minimizers of the associated Rayleigh quotient.

We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $\alpha$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by…

We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…

The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…

We present a finite difference method to compute the principal eigenvalue and the corresponding eigenfunction for a large class of second order elliptic operators including notably linear operators in nondivergence form and fully nonlinear…

In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its…

In this paper, we analyze the large n-limit for random matrix with external source with three distinct eigenvalues. And we confine ourselves in the Hermite case and the three distinct eigenvalues are $-a,0,a$. For the case $a^2>3$, we…

Let $S_n$ and $A_{n}$ denote the symmetric and alternating group on the set $\{1,.., n\},$ respectively. In this paper we are interested in the second largest eigenvalue $\lambda_{2}(\Gamma)$ of the Cayley graph $\Gamma=Cay(G,H)$ over…

We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate…

Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…

A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…

We study the eigenvalue problem for some special class of anti-triangular matrices. Though the eigenvalue problem is quite classical, as far as we know, almost nothing is known about properties of eigenvalues for anti-triangular matrices.…

In this paper, a new approach is presented to determine common eigenvalues of two matrices. It is based on Gerschgorin theorem and Bisection method. The proposed approach is simple and can be useful in image processing and noise estimation.

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

An algebraic analysis of the Hamiltonian formulation of the model two-dimensional gravity is performed. The crucial fact is an exact coincidence of the Poisson brackets algebra of the secondary constraints of this Hamiltonian formulation…

We introduce a unified method for study of 2-dimensional invariant subspaces of matrices and their corresponding super-eigenvalues. As a novel application to non-commutative algebra, we present a connection between the eigenvalues of…

We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…

We introduce the triangulant of two matrices, and relate it to the existence of orthogonal eigenvectors. We also use it for a new characterization of mutually unbiased bases. Generalizing the notion, we introduce higher order triangulants…

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

For an nxn matrix A over a Lie nilpotent ring R of index k, we prove that an invariant "power" Cayley-Hamilton identity of degree (n^2)2^{k-2} holds. The right coefficients are not uniquely determined by A, and the cosets lambda_i+D, with D…