Related papers: Tridiagonal test matrices for eigenvalue computati…
There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random non-Hermitian periodic tridiagonal matrices and their bidiagonal limits. These eigenvalues cluster along a…
Random matrix theory, particularly using matrices akin to the Wishart ensemble, has proven successful in elucidating the thermodynamic characteristics of critical behavior in spin systems across varying interaction ranges. This paper…
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
In this paper, we introduce symmetric diagram matrices $A_{s+r,s}$ of size ${_{(s+r)}}C_s$ whose entries are $\{x_i\}_{min\{s,r\}}$. We compute the eigenvalues of symmetric diagram matrices using elementary row and column operations…
A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of…
Assembling stiffness matrices represents a significant cost in many finite element computations. We address the question of optimizing the evaluation of these matrices. By finding redundant computations, we are able to significantly reduce…
In this paper, we introduce the $k\times n$ (with $k\leq n$) truncated, supplemented Pascal matrix which has the property that any $k$ columns form a linearly independent set. This property is also present in Reed-Solomon codes; however,…
The sensitivity of eigenvalues of structured matrices under general or structured perturbations of the matrix entries has been thoroughly studied in the literature. Error bounds are available and the pseudospectrum can be computed to gain…
We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
If ${A}$ has no eigenvalues on the closed negative real axis, and $B$ is arbitrary square complex, the matrix-matrix exponentiation is defined as $A^B:=e^{\log({A}){B}}$. This function arises, for instance, in Von Newmann's…
We consider a family of discrete Jacobi operators on the one-dimensional integer lattice, with the diagonal and the off-diagonal entries given by two sequences generated by the Fibonacci substitution on two letters. We show that the…
We revisit the theory of Discrete Exterior Calculus (DEC) in 2D for general triangulations, relying only on Vector Calculus and Matrix Algebra. We present DEC numerical solutions of the Poisson equation and compare them against those found…
In this work, we study the spectral properties of matrix Hamiltonians generated by linearizing the nonlinear Schr\"odinger equation about soliton solutions. By a numerically assisted proof, we show that there are no embedded eigenvalues for…
The Householder reduction of a member of the anti-symmetric Gaussian unitary ensemble gives an anti-symmetric tridiagonal matrix with all independent elements. The random variables permit the introduction of a positive parameter $\beta$,…
We study the spectra and pseudospectra of finite and infinite tridiagonal random matrices, in the case where each of the diagonals varies over a separate compact set, say $U,V,W\subset\mathbb{C}$. Such matrices are sometimes termed…
We draw attention to the fact that a Hermitian matrix is always diagonalizable and has real discrete spectrum whereas the Hermitian Schr{\"o}dinger Hamiltonian: $H=p^2/2\mu+V(x)$, may not be so. For instance when $V(x)=x, x^3, -x^2$, $H$…
This work is to provide a comprehensive treatment of the relationship between the theory of the generalized (palindromic) eigenvalue problem and the theory of the Sylvester-type equations. Under a regularity assumption for a specific matrix…
Using the ideas of concatenation construction of codes over the $q$-ary alphabet, we modify the known generalized Sylvester-type construction of the Hadamard matrices. The new construction is based on two collections of the Hadamard…
In a recent paper a class of infinite Jacobi matrices with discrete character of spectra has been introduced. With each Jacobi matrix from this class an analytic function is associated, called the characteristic function, whose zero set…