Related papers: On the application of Laguerre's method to the pol…
An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials $L^{(\alpha)}_n(z)$ are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic…
This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…
We propose a new type of multilevel method for solving eigenvalue problems based on Newton iteration. With the proposed iteration method, solving eigenvalue problem on the finest finite element space is replaced by solving a small scale…
Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue…
We study random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric positive-definite matrix operator, we explore the performance of algorithms for computing its…
The purpose of this work is to study spectral methods to approximate the eigenvalues of nonlocal integral operators. Indeed, even if the spatial domain is an interval, it is very challenging to obtain closed analytical expressions for the…
We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as…
In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
The finite element method(FEM) is applied to bound leading eigenvalues of Laplace operator over polygonal domain. Compared with classical numerical methods, most of which can only give concrete eigenvalue bounds over special domain of…
The eigenvalue problem for 3x3 octonionic Hermitian matrices contains some surprises, which we have reported elsewhere. In particular, the eigenvalues need not be real, there are 6 rather than 3 real eigenvalues, and the corresponding…
In this paper, we study first-order methods on a large variety of low-rank matrix optimization problems, whose solutions only live in a low dimensional eigenspace. Traditional first-order methods depend on the eigenvalue decomposition at…
In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…
We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is…
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large…
Using a variety of matrix techniques, the problem of locating the left eigenvalues of the quaternion companion matrices are investigated in this paper. In a recent paper, Dar et al. [6], proved that the zeros of a quaternionic polynomial…
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…
It is known that a $2\times 2$ quaternionic matrix has one, two or an infinite number of left eigenvalues, but the available algebraic proofs are difficult to generalize to higher orders. In this paper a different point of view is adopted…