Related papers: The inverse eigenvalue problem for symmetric anti-…
This paper concerns some inverse eigenvalue problems of the quadratic $\star$-(anti)-palindromic system $Q(\lambda)=\lambda^2 A_1^{\star}+\lambda A_0 + \epsilon A_1$, where $\epsilon=\pm 1$, $A_1, A_0 \in \mathbb{C}^{n\times n}$,…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
Consider a symmetric matrix $A(v)\in\RR^{n\times n}$ depending on a vector $v\in\RR^n$ and satisfying the property $A(\alpha v)=A(v)$ for any $\alpha\in\RR\backslash{0}$. We will here study the problem of finding $(\lambda,v)\in\RR\times…
The inverse eigenvalue problem of a graph $G$ aims to find all possible spectra for matrices whose $(i,j)$-entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. In this work, the inverse eigenvalue problem is completely…
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…
The spectral properties of two special classes of Jacobi operators are studied. For the first class represented by the $2M$-dimensional real Jacobi matrices whose entries are symmetric with respect to the secondary diagonal, a new…
Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…
In this paper we investigate direct and inverse problems for time-fractional pseudo-parabolic equations associated with the Jacobi operator. The existence and uniqueness of the solutions are proved. Also, the stability result of the inverse…
We present an improved form of the algorithm for constructing Jacobi rotations. This is simultaneously a more accurate code for finding the eigenvalues and eigenvectors of a real symmetric 2x2 matrix.
A square complex matrix $A$ is called (skew) $J$-Hamiltonian if $AJ$ is (skew) hermitian where $J$ is a real normal matrix such that $J^2=-I$, where $I$ is the identity matrix. In this paper, we solve the Procrustes problem to find normal…
We consider the inverse dynamic problem for a dynamical system with discrete time associated with a semi-infinite complex Jacobi matrix. We propose two approaches of recovering coefficients from dynamic response operator and answer a…
We solve the inverse problem for Jacobi operators on the half lattice with finitely supported perturbations, in particular, in terms of resonances. Our proof is based on the results for the inverse eigenvalue problem for specific finite…
In this work, the real nonnegative inverse eigenvalue problem is solved for a particular class of permutative matrix. The necessary and sufficient condition there is also shown to be sufficient for the symmetric nonnegative inverse…
We consider the inverse dynamical problem for the dynamical system with discrete time associated with the semi-infinite Jacobi matrix. We solve the inverse problem for such a system and answer a question on the characterization of the…
We consider the class of bounded symmetric Jacobi matrices $J$ with positive off-diagonal elements and complex diagonal elements. With each matrix $J$ from this class, we associate the spectral data, which consists of a pair $(\nu,\psi)$.…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…