Related papers: A generalized eigenvalue algorithm for tridiagonal…
For each square matrix polynomial $P(\lambda)$ of odd degree, a block-symmetric block-tridiagonal pencil $\mathcal{T}_{P}(\lambda)$ was introduced by Antoniou and Vologiannidis in 2004, and a variation $\mathcal{R}_P(\lambda)$ was…
Hermitian linear matrix pencils are ubiquitous in control theory, operator systems, semidefinite optimization, and real algebraic geometry. This survey reviews the fundamental features of the matricial solution set of a linear matrix…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The…
Pole-swapping algorithms, generalizations of bulge-chasing algorithms, have been shown to be a viable alternative to the bulge-chasing QZ algorithm for solving the generalized eigenvalue problem for a matrix pencil A - {\lambda}B. It is…
Investigating the stability of nonlinear waves often leads to linear or nonlinear eigenvalue problems for differential operators on unbounded domains. In this paper we propose to detect and approximate the point spectra of such operators…
It is well known that, in the study of the dynamical properties of nonlinear reaction-diffusion systems, the sign of the principal eigenvalue of the linearized system plays an important role. However, for the nonlocal dispersal systems, due…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
This paper presents a definition for local linearizations of rational matrices and studies their properties. This definition allows us to introduce matrix pencils associated to a rational matrix that preserve its structure of zeros and…
The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be…
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…
The principal minors of a tridiagonal matrix satisfy two-term and three-term recurrences [1, 2]. Based on these facts, the current article presents a new efficient and reliable hybrid numerical algorithm for evaluating general n-th order…
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…
Broyden's method is a general method commonly used for nonlinear systems of equations, when very little information is available about the problem. We develop an approach based on Broyden's method for nonlinear eigenvalue problems. Our…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
In the current paper the authors linked two methods in order to evaluate general n-th order tridiagonal determinants. A breakdown free numerical algorithm is developed for computing the inverse of any nxn general nonsingular tridiagonal…
We propose a novel numerical algorithm for computing the electronic structure related eigenvalue problem of incommensurate systems. Unlike the conventional practice that approximates the system by a large commensurate supercell, our…
In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is…
Recently, contour integral-based methods have been actively studied for solving interior eigenvalue problems that find all eigenvalues located in a certain region and their corresponding eigenvectors. In this paper, we reconsider the…
Many eigenvalue problems arising in practice are often of the generalized form $A\x=\lambda B\x$. One particularly important case is symmetric, namely $A, B$ are Hermitian and $B$ is positive definite. The standard algorithm for solving…