Related papers: Eigenvalue placement for regular matrix pencils wi…
In the current work, we study the eigenvalue distribution results of a class of non-normal matrix-sequences which may be viewed as a low rank perturbation, depending on a parameter $\beta>1$, of the basic Toeplitz matrix-sequence…
We consider the eigenvalues of a fixed, non-normal matrix subject to a small additive perturbation. In particular, we consider the case when the fixed matrix is a banded Toeplitz matrix, where the bandwidth is allowed to grow slowly with…
The goal of this article is to study how much the eigenvalues of large Hermitian random matrices deviate from certain deterministic locations -- or in other words, to investigate optimal rigidity estimates for the eigenvalues. We do this in…
In this article, we establish a limiting distribution for eigenvalues of a class of auto-covariance matrices. The same distribution has been found in the literature for a regularized version of these auto-covariance matrices. The original…
We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with…
We consider a class of linear eigenvalue problems depending on a small parameter epsilon in which the series expansion for the eigenvalue in powers of epsilon is divergent. We develop a new technique to determine the precise nature of this…
The main objective of this talk is to develop a matrix pencil approach for the study of an initial value problem of a class of singular linear matrix differential equations whose coefficients are constant matrices. By using matrix pencil…
A matrix is well separated if all its Gershgorin circles are away from the unit circle and they are separated from each other. In this article, the region of relative errors in the eigenvalues is obtained as a quadratic oval for non…
We generalize $\epsilon$-pseudospectra and the associated computational algorithms to the generalized eigenvalue problem. Rank one perturbations are used to determine the $\epsilon$-pseudospectra.
This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…
In this article we address the length of perverse sheaves arising as direct images of rank one local systems on complements of hyperplane arrangements. In the case of a cone over an essential line arrangement with at most triple points, we…
In this paper, we study the perturbation of the extreme singular values of a matrix in the particular case where it is obtained after appending an arbitrary column vector. Such results have many applications in bifurcation theory, signal…
The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…
We study Jordan types of linear forms for graded Artinian Gorenstein algebras having arbitrary codimension. We introduce rank matrices of linear forms for such algebras that represent the ranks of multiplication maps in various degrees. We…
The propagation of primary discontinuities in initial value problems for linear delay differential-algebraic equations (DDAEs) is discussed. Based on the (quasi-) Weierstra{\ss} form for regular matrix pencil, a complete characterization of…
We characterise regions in the complex plane that contain all non-embedded eigenvalues of a perturbed periodic Dirac operator on the real line with real-valued periodic potential and a generally non-symmetric matrix-valued perturbation V .…
We present a procedure to extract the generalised eigenvectors of a non-diagonalisable matrix by considering a diagonalisable perturbation of it and computing the non-diagonalisable limit of its eigenvectors. As an example of this process,…
Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…
We continue the classification of the Jordan chains of the eclectic three state spin chain that we started in our previous article. Following the same steps, we construct the generalised eigenvectors of this spin chain by computing the…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…