Related papers: Dynamics of the symmetric eigenvalue problem with …

The Wigner-von Neumann method, which was previously used for perturbing continuous Schr\"{o}dinger operators, is here applied to their discrete counterparts. In particular, we consider perturbations of arbitrary $T$-periodic Jacobi…

We study properties and algorithms of a minimization problem of the maximum generalized eigenvalue of symmetric-matrix-valued affine functions, which is nonsmooth and quasiconvex, and has application to eigenfrequency optimization of truss…

In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…

We propose a general framework to study the stability of the subspace spanned by $P$ consecutive eigenvectors of a generic symmetric matrix ${\bf H}_0$, when a small perturbation is added. This problem is relevant in various contexts,…

We review the ideas of how random matrix theory has to be properly applied to quantum physics; particularly we focus on how the spectrum has to be properly prepared and the random matrix correctly identified before the random matrix and the…

In this paper, we study the eigenvalues of the matrices $T_n(a)+\gamma E_{n,1,1}$ where $T_n(a)$ is the Toeplitz matrix with generating symbol $a(t)=t-t^{-1}$, $E_{n,1,1}$ is the $n\times n$ matrix whose upper left component is $1$ and the…

Base on some simple facts of Hadamard product, characterizations of positive definite preserving linear transformations on real symmetric matrix spaces with an additional assumption "$\ra T(E_{ii})=1, i=1,2,..., n$" or "$T(A)>0\to A> 0$",…

Solving symmetric positive definite linear problems is a fundamental computational task in machine learning. The exact solution, famously, is cubicly expensive in the size of the matrix. To alleviate this problem, several linear-time…

We say that a function F(tau) obeys WDVV equations, if for a given invertible symmetric matrix eta^{alpha beta} and all tau \in T \subset R^n, the expressions c^{alpha}_{beta gamma}(tau) = eta^{alpha lambda} c_{lambda beta gamma}(tau) =…

In this paper, two accelerated divide-and-conquer algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost $O(N^2r)$ {flops} in the worst case, where $N$ is the dimension of the matrix and $r$ is a modest number…

In this paper, we propose an unconstrained framework for eigenvalue problems in both discrete and continuous settings. We begin our discussion to solve a generalized eigenvalue problem $A{\bf x} = \lambda B{\bf x}$ with two $N\times N$ real…

Let $T : \Omega \rightarrow \bbC^{n \times n}$ be a matrix-valued function that is analytic on some simply-connected domain $\Omega \subset \bbC$. A point $\lambda \in \Omega$ is an eigenvalue if the matrix $T(\lambda)$ is singular. In this…

Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD)…

We show that for a given set $\Lambda$ of $nk$ distinct real numbers $\lambda_1, \lambda_2, \ldots, \lambda_{nk}$ and $k$ graphs on $n$ nodes, $G_0, G_1,\ldots,G_{k-1}$, there are real symmetric $n\times n$ matrices $A_s$, $s=0,1,\ldots,…

A lower semi-definite self-adjoint linear operator in a Hilbert space is taken whose discrete spectrum is not empty and comprises at least several eigenvalues $\lambda_{min}=\lambda_1\leqslant\ldots\leqslant\lambda_m<\sigma_{ess}$. The…

We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…

Let $n$ be a positive integer and $m$ be a positive even integer. Let ${\mathcal A}$ be an $m^{th}$ order $n$-dimensional real weakly symmetric tensor and ${\mathcal B}$ be a real weakly symmetric positive definite tensor of the same size.…

An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric…

We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…

We develop a framework for proving rapid convergence of shifted QR algorithms which use Ritz values as shifts, in finite arithmetic. Our key contribution is a dichotomy result which addresses the known forward-instability issues surrounding…