Related papers: Complex Eigenvalues for Binary Subdivision Schemes

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…

Explicit representations of the eigenvalues of the peridynamic operator have been recently derived in [5]. These representations are given in terms of generalized hypergeometric functions. Asymptotic analysis of the hypergeometric functions…

Quantifying the eigenvalue spectra of large random matrices allows one to understand the factors that contribute to the stability of dynamical systems with many interacting components. This work explores the effect that the interaction…

We describe a novel algorithm for solving general parametric (nonlinear) eigenvalue problems. Our method has two steps: first, high-accuracy solutions of non-parametric versions of the problem are gathered at some values of the parameters;…

The first step when solving an infinite-dimensional eigenvalue problem is often to discretize it. We show that one must be extremely careful when discretizing nonlinear eigenvalue problems. Using examples, we show that discretization can:…

A procedure for counting the number of eigenvalues of a matrix in a region surrounded by a closed curve is presented. It is based on the application of the residual theorem. The quadrature is performed by evaluating the principal argument…

Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

Contour integral methods for nonlinear eigenvalue problems seek to compute a subset of the spectrum in a bounded region of the complex plane. We briefly survey this class of algorithms, establishing a relationship to system realization…

These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…

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 gather several results on the eigenvalues of the spatial sign covariance matrix of an elliptical distribution. It is shown that the eigenvalues are a one-to-one function of the eigenvalues of the shape matrix and that they are closer…

Spectral dimensionality reduction methods enable linear separations of complex data with high-dimensional features in a reduced space. However, these methods do not always give the desired results due to irregularities or uncertainties of…

We investigate almost-degenerate perturbation theory of eigenvalue problems, using spectral projectors, also named density matrices. When several eigenvalues are close to each other, the coefficients of the perturbative series become…

We investigate the eigenvalue curves of 1-parameter hermitean and general complex or real matrix flows $A(t)$ in light of their geometry and the uniform decomposability of $A(t)$ for all parameters $t$. The often misquoted and misapplied…

We formulate a systematic elegant perturbative scheme for determining the eigenvalues of the Helmholtz equation (\bigtriangledown^{2} + k^{2}){\psi} = 0 in two dimensions when the normal derivative of {\psi} vanishes on an irregular closed…

We extend classical time-frequency limiting analysis, historically applied to one-dimensional finite signals, to the multidimensional discrete setting. This extension is relevant for images, videos, and other multidimensional signals, as it…

We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density…

Uniqueness of solution is proved for any ptychographic scheme with a random masks under a minimum overlap condition and local geometric convergence analysis is given for the alternating projection (AP) and Douglas-Rachford (DR) algorithms.…

Eigenvalue analysis is a well-established tool for stability analysis of dynamical systems. However, there are situations where eigenvalues miss some important features of physical models. For example, in models of incompressible fluid…