Related papers: Dynamics of the symmetric eigenvalue problem with …
The discrete Toda lattice preserves the eigenvalues of tridiagonal matrices, and convergence of dependent variables to the eigenvalues can be proved under appropriate conditions. We show that the ultradiscrete Toda lattice preserves…
It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…
The Gershgorin Circle Theorem is a well-known and efficient method for bounding the eigenvalues of a matrix in terms of its entries. If $A$ is a symmetric matrix, by writing $A = B + x{\bf 1}$, where ${\bf 1}$ is the matrix with unit…
We study the eigenvalue spectrum of different lattice Dirac operators (staggered, fixed point, overlap) and discuss their dependence on the topological sectors. Although the model is 2D (the Schwinger model with massless fermions) our…
A quasi-Toeplitz (QT) matrix is a semi-infinite matrix of the form $A=T(a)+E$ where $T(a)$ is the Toeplitz matrix with entries $(T(a))_{i,j}=a_{j-i}$, for $a_{j-i}\in\mathbb C$, $i,j\ge 1$, while $E$ is a matrix representing a compact…
We consider a generalization of the full symmetric Toda hierarchy where the matrix $\tilde {L}$ of the Lax pair is given by $\tilde {L}=LS$, with a full symmetric matrix $L$ and a nondegenerate diagonal matrix $S$. The key feature of the…
We revisit a classical problem in numerical linear algebra: given an $k$-dimensional subspace $\mathcal{Q}$ that approximates the leading eigenspace of an $n\times n$ positive semi-definite matrix $A$, the goal is to extract high-accuracy…
Symmetric tridiagonal matrices appear ubiquitously in mathematical physics, serving as the matrix representation of discrete random Schr\"odinger operators. In this work we investigate the top eigenvalue of these matrices in the large…
In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary…
Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
We investigate how to solve smooth matrix optimization problems with general linear inequality constraints on the eigenvalues of a symmetric matrix. We present solution methods to obtain exact global minima for linear objective functions,…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
Any representation of data involves arbitrary investigator choices. Because those choices are external to the data-generating process, each choice leads to an exact symmetry, corresponding to the group of transformations that takes one…
The central importance of large scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine…
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…