The paper deals with eigenvalue estimates for block incomplete factorization methods for symmetric matrices. First, some previous results on upper bounds for the maximum eigenvalue of preconditioned matrices are generalized to each eigenvalue. Second, upper bounds for the maximum eigenvalue of the preconditioned matrix are further estimated, which presents a substantial improvement of earlier r...

We present an iterative method to compute the Maxwell’s transmission eigenvalue problem which has importance in non-destructive testing of anisotropic materials. The transmission eigenvalue problem is first written as a quad-curl eigenvalue problem. Then we show that the real transmission eigenvalues are the roots of a non-linear function whose value is the generalized eigenvalue of a related s...

Consider the linear general eigenvalue problem Ay = λBy , where A and B are both invertible and Hermitian N × N matrices. In this paper we construct a set of meromorphic functions, the Krein eigenvalues, whose zeros correspond to the real eigenvalues of the general eigenvalue problem. The Krein eigenvalues are generated by the Krein matrix, which is constructed through projections on the positi...

The mixing time of an ergodic, reversible Markov chain can be bounded in terms of the eigenvalues of the chain: specifically, the second-largest eigenvalue and the smallest eigenvalue. It has become standard to focus only on the secondlargest eigenvalue, by making the Markov chain “lazy”. (A lazy chain does nothing at each step with probability at least 1 2 , and has only nonnegative eigenvalue...

The cross-correlation matrix between equities comprises multiple interactions between traders with varying strategies and time horizons. In this paper, we use the Maximum Overlap Discrete Wavelet Transform (MODWT) to calculate correlation matrices over different time scales and then explore the eigenvalue spectrum over sliding time windows. The dynamics of the eigenvalue spectrum at different s...

The residual inverse iteration is a simple method for solving eigenvalue problems that are nonlinear in the eigenvalue parameter. In this paper, we establish a new expression and a simple bound for the asymptotic convergence factor of this iteration in the special case that the nonlinear eigenvalue problem is Hermitian and admits a so called Rayleigh functional. These results are then applied t...

In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-uniform hypergraph. We show that the real parts of all the eigenvalues of the Laplacian are in the interval [0, 2], and the real part is zero (respectively two) if and only if the eigenvalue is zero (respectively two). All the H+-eigenvalues of the Laplacian and all the smallest H+-eigenvalues of its sub-t...

a spanning tree of graph g is a spanning subgraph of g that is a tree. in this paper, we focusour attention on (n,m) graphs, where m = n, n + 1, n + 2 and n + 3. we also determine somecoefficients of the laplacian characteristic polynomial of fullerene graphs.

In this paper, the first and second order approximations of Taylor expansion are used for calculating the change of each natural frequency by modifying an arbitrary parameter of a system with a known amount and based on this approximation, the inverse eigenvalue problem is transformed to a solvable algebraic equation. The finite element formulation, based on the classical laminated plate theory...