相关论文: The inverse eigenvalue problem for symmetric anti-…

Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a matrix in $Z$ such that the product matrix…

The paper studies a general inverse eigenvalue problem which contains as special cases many well studied pole placement and matrix extension problems. It is shown that the studied problem corresponds on the geometric side to a central…

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…

In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and…

We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…

A $2n\times 2n$ real matrix $A$ is said to be a Hamiltonian matrix if $A^{T}J+JA=0$, where $J=\left( \begin{array}{cc} 0 & I_{n} \\ -I_{n} & 0\\ \end{array} \right)$. Hamiltonian matrices appear in many areas of applications, such as linear…

This paper analyzes the convergence of fixed-point iterations of the form u = f(u) and the properties of the inverse of the related pentadiagonal matrices, associated with the fourth-order nonlinear beam equation. This nonlinear problem is…

The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…

We consider the eigenvalues and eigenvectors of an axisymmetric matrix$A$ with some special structures. We propose S-Oja-Brockett equation $\frac{dX}{dt}=AXB-XBX^TSAX,$ where $X(t) \in {\mathbb R}^{n \times m}$ with $m \leq n$, $S$ is a…

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

For two real symmetric matrices, their eigenvalue configuration is therelative arrangement of their eigenvalues on the real line. We consider the following problem: given two parametric real symmetric matrices and an eigenvalue…

The nonlinear eigenvalue problem of a class of second order semi-transcendental differential equations is studied. A nonlinear eigenvalue is defined as the initial condition which gives rise a separatrix solution. A semi-transcendental…

Identifying the collection of scalars that represent a non-negative matrix's eigenvalues is known as the non-negative inverse eigenvalue problem (NIEP). Conditions for the existence of a non-negative matrix with a certain spectrum are…

Necessary and sufficient conditions are presented for a measure to be the spectral measure of a finite range or exponentially decaying perturbation of a periodic Jacobi operator. As a corollary we can fully solve the inverse resonance…

In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…

In this paper, the concept of generalized spectral function is introduced for finite-order tridiagonal symmetric matrices (Jacobi matrices) with complex entries. The structure of the generalized spectral function is described in terms of…

Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…

We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…

We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…

We study the bisymmetric nonnegative inverse eigenvalue problem (BNIEP). This problem is the problem of finding the necessary and sufficient conditions on a list of $n$ complex numbers to be a spectrum of an $n \times n$ bisymmetric…