Related papers: Two eigenvectors for the price of one

We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…

This paper introduces a method for computing eigenvalues and eigenvectors of a generalized Hermitian, matrix eigenvalue problem. The work is focused on large scale eigenvalue problems, where the application of a direct inverse is out of…

In this note, the first-order Dickson polynomials are introduced through a particular case of the expression of the trace of the $n^{th}$ power of a matrix in terms of powers of the trace and determinant of the matrix itself. The technique…

We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an…

Asymptotically, we analytically derive the form of eigenvectors for two Fisher-Hartwig symbols besides those which were previously investigated in a $2016$ work due to Movassagh and Kadanoff, in which the authors characterized the…

Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…

A method is developed to determine the eigenvalues and eigenfunction of two-boson $2\times 2$ matrix Hamiltonians include a wide class of quantum optical models. The quantum Hamiltonians have been transformed in the form of the one variable…

One of the most used approaches in simulating materials is the tight-binding approximation. When using this method in a material simulation, it is necessary to compute the eigenvalues and eigenvectors of the Hamiltonian describing the…

Using large $N$ arguments, we propose a scheme for calculating the two-point eigenvector correlation function for non-normal random matrices in the large $N$ limit. The setting generalizes the quaternionic extension of free probability to…

The two-sided Rayleigh quotient iteration proposed by Ostrowski computes a pair of corresponding left-right eigenvectors of a matrix $C$. We propose a Grassmannian version of this iteration, i.e., its iterates are pairs of $p$-dimensional…

If $A$ is an $n\times n$ matrix whose $n$ eigenvalues are ordered in terms of decreasing modules, $|\lambda_1 | \geq |\lambda_2| \geq ... |\lambda_n|$, it is often of interest to estimate $\frac{|\lambda_2|}{|\lambda_1|}$. If $A$ is a row…

We exhibit a Cayley-Hamilton trace identity for $2\times2$ matrices with entries in a ring $R$ satisfying $[[x,y],[x,z]]=0$ and 1/2 \in R$.

Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…

In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…

The Cayley--Hamilton--Newton theorem for half-quantum matrices is proven.

We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…

We investigate eigenvalue attraction for open quantum systems, biophysical systems, and for Parity-Time symmetric materials. To determine whether an eigenvalue and its complex conjugate of a real matrix attract, we derive expressions for…

A method is suggested to obtain solutions of the various quantum optical Hamiltonians in the framework of the asymptotic iteration method. We extend the notion of asymptotic iteration method to solve the 2 \times 2 matrix Hamiltonians. On a…

We present an improved form of the algorithm for constructing Jacobi rotations. This is simultaneously a more accurate code for finding the eigenvalues and eigenvectors of a real symmetric 2x2 matrix.

We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…