Related papers: Constructing Laplacian matrices with Soules vector…

A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let $\mathcal{S}^{n,k}$ be the convex cone of $n\times n$…

In this paper, we consider the problem of reconstructing an $n \times n$ cell matrix $D(\vec{x})$ constructed from a vector $\vec{x} = (x_{1}, x_{2},\dots, x_{n})$ of positive real numbers, from a given set of spectral data. In addition, we…

We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an…

The inverse eigenvalue problem for real symmetric matrices of the form 0 0 0 . 0 0 * 0 0 0 . 0 * * 0 0 0 . * * 0 . . . . . . . 0 0 * . 0 0 0 0 * * . 0 0 0 * * 0 . 0 0 0 is solved. The solution is shown to be unique. The problem is also…

In this paper we study para-Hermitian rational matrices and the associated structured rational eigenvalue problem (REP). Para-Hermitian rational matrices are square rational matrices that are Hermitian for all $z$ on the unit circle that…

In this paper, we propose a unified approach for solving structure-preserving eigenvalue embedding problem (SEEP) for quadratic regular matrix polynomials with symmetry structures. First, we determine perturbations of a quadratic 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…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note…

Semidefinite programming is a fundamental problem class in convex optimization, but despite recent advances in solvers, solving large-scale semidefinite programs remains challenging. Generally the matrix functions involved are spectral or…

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…

We show that for a given set $\Lambda$ of $nk$ distinct real numbers $\lambda_1, \lambda_2, \ldots, \lambda_{nk}$ and $k$ graphs on $n$ nodes, $G_0, G_1,\ldots,G_{k-1}$, there are real symmetric $n\times n$ matrices $A_s$, $s=0,1,\ldots,…

The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.

As was detailed by Loewy and London in [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90], the cone of polynomials that preserve the nonnegativity of matrices may play an important role in the solution to the nonnegative inverse…

This paper is a continuation of our previous work \cite{St} where we have studied the Stokes phenomenon for a particular family of equation \eqref{initial} with \eqref{form-0}-\eqref{npe} from a perturbative point of view. Here we focus on…

In this paper, we answer the various forms of nonnegative inverse eigenvalue problems with prescribed diagonal entries for order three: real or complex general matrices, symmetric stochastic matrices, and real or complex doubly stochastic…

We diagonalize the double-row transfer matrix of the SU(N) vertex model for certain classes of non-diagonal boundary conditions. We derive explicit expressions for the corresponding eigenvectors and eigenvalues by means of the algebraic…

We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.

Optimally hybrid numerical solvers were constructed for massively parallel generalized eigenvalue problem (GEP).The strong scaling benchmark was carried out on the K computer and other supercomputers for electronic structure calculation…