Related papers: Perturbation of eigenvalues of matrix pencils and …

We investigate the effects of advection on the principal eigenvalues of linear time-periodic parabolic operators with zero Neumann boundary conditions. Various asymptotic behaviors of the principal eigenvalues, when advection coefficient…

In this paper, we provide a rigorous derivation of asymptotic formula for the largest eigenvalues using the convergence estimation of the eigenvalues of a sequence of self-adjoint compact operators of perturbations resulting from the…

We present a randomized, inverse-free algorithm for producing an approximate diagonalization of any $n \times n$ matrix pencil $(A,B)$. The bulk of the algorithm rests on a randomized divide-and-conquer eigensolver for the generalized…

This work is concerned with the estimation of multidimensional regression and the asymptotic behaviour of the test involved in selecting models. The main problem with such models is that we need to know the covariance matrix of the noise to…

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…

We study the existence of principal eigenvalues and principal eigenfunctions for weighted eigenvalue problems of the form: \begin{equation*} - \mbox{div} ( L (x) |\nabla u|^{p-2} \nabla u ) = \lambda K(x) |u|^{p-2} u \hspace{.1cm} \mbox {…

In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as…

This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…

We study principal component analysis (PCA) for mean zero i.i.d. Gaussian observations $X_1,\dots, X_n$ in a separable Hilbert space $\mathbb{H}$ with unknown covariance operator $\Sigma.$ The complexity of the problem is characterized by…

We obtain the generic complete eigenstructures of complex Hermitian $n\times n$ matrix pencils with rank at most $r$ (with $r\leq n$). To do this, we prove that the set of such pencils is the union of a finite number of bundle closures,…

We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…

We study E-eigenvalues of a symmetric tensor $f$ of degree $d$ on a finite-dimensional Euclidean vector space $V$, and their relation with the E-characteristic polynomial of $f$. We show that the leading coefficient of the E-characteristic…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…

In the present paper, we deal with a fourth-order boundary value problem problem with eigenparameter dependent boundary conditions and transmission conditions at a interior point. A self-adjoint linear operator A is defined in a suitable…

Let $A$ be a fixed complex matrix and let $u,v$ be two vectors. The eigenvalues of matrices $A+\tau uv^\top $ $(\tau\in\mathbb{R})$ form a system of intersecting curves. The dependence of the intersections on the vectors $u,v$ is studied.

Asymptotics of the eigenvalues can always be derived for self-adjoint boundary value problems. However, they can also be derived for boundary value problems that fail to be self-adjoint provided that they are Birkhoff regular. A regular…

Consider a monic linear pencil $L(x) = I - A_1x_1 - \cdots - A_gx_g$ whose coefficients $A_j$ are $d \times d$ matrices. It is naturally evaluated at $g$-tuples of matrices $X$ using the Kronecker tensor product, which gives rise to its…

It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of…

We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…