Related papers: Generalized eigenvalue problems for meet and join …
In this work we deal with a scalar spectral mixed boundary value problem in a spacial junction of thin rods and a plate. Constructing asymptotics of the eigenvalues, we employ two equipollent asymptotic models posed on the skeleton of the…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…
The aim of this paper is to propose an efficient adaptive finite element method for eigenvalue problems based on the multilevel correction scheme and inverse power method. This method involves solving associated boundary value problems on…
In this paper, we consider an approximation method, and a novel general analysis, for second-order elliptic differential equations with heterogeneous multiscale coefficients. We obtain convergence of the Generalized Multi-scale Finite…
We consider two-point non-self-adjoint boundary eigenvalue problems for linear matrix differential operators. The coefficient matrices in the differential expressions and the matrix boundary conditions are assumed to depend analytically on…
In this short paper, a matrix perturbation bound on the eigenvalues found by principal component analysis is investigated, for the case in which the data matrix on which principal component analysis is performed is a convex combination of…
We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…
Finite element methods are effective for Helmholtz problems involving complex geometries and heterogeneous media. However, the resulting linear systems are often large, indefinite, and challenging for iterative solvers, particularly at high…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
In the context of integrable partial difference equations on quad-graphs, we introduce the notion of open boundary reductions as a new means to construct discrete integrable mappings and their invariants. This represents an alternative to…
We give formulae for first and second derivatives of generalized eigenvalues/eigenvectors of symmetric matrices and generalized singular values/singular vectors of rectangular matrices when the matrices are linear or nonlinear functions of…
Laplacian matrices are commonly employed in many real applications, encoding the underlying latent structural information such as graphs and manifolds. The use of the normalization terms naturally gives rise to random matrices with…
Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…
The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.
The general self-adjoint elliptic boundary value problems are considered in a domain $G\subset \Bbb R^{n+1}$ with finitely many cylindrical ends. The coefficients are stabilizing (as $x\to\infty$, $x\in G$) so slowly that we can only…
This work deals with approximate solution of generalized eigenvalue problem with coefficient matrix that is an affine function of d-parameters. The coefficient matrix is assumed to be symmetric positive definite and spectrally equivalent to…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…
In this paper, we derive new relative perturbation bounds for eigenvectors and eigenvalues for regular quadratic eigenvalue problems of the form $\lambda^2 M x + \lambda C x + K x = 0$, where $M$ and $K$ are nonsingular Hermitian matrices…