关于周期对称三对角矩阵的广义特征值反问题

在给定部分特征值、部分特征向量及附加条件下提出了一类反问题,并给出了此问题解存在性的证明及求解的算法.     

The inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices

In this paper we construct the symmetric quasi anti-bidiagonal matrix that its eigenvalues are given, and show that the problem is also equivalent to the inverse eigenvalue problem for a certain symmetric tridiagonal matrix which has the same eigenvalues. Not only elements of the tridiagonal matrix come from quasi anti-bidiagonal matrix, but also the places of elements exchange based on some conditions.     

The inverse eigenvalue problem of generalized reflexive matrices and its approximation

This paper studies inverse eigenvalue problems of generalized reflexive matrices and their optimal approximations. Necessary and sufficient conditions for the solvability of the problems are derived, the solutions and their optimal approximations are provided.     

A stability analysis of the jacobi matrix inverse eigenvalue problem

In this paper, we give a perturbation bound for the solution of the Jacobi matrix inverse eigenvalue problem.China State Major Key Project for Basic Researches.     

The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles

In 1979, Ferguson characterized the periodic Jacobi matrices with given eigenvalues and showed how to use the Lanzcos Algorithm to construct each such matrix. This article provides general characterizations and constructions for the complex analogue of periodic Jacobi matrices. As a consequence of the main procedure, we prove that the multiplicity of an eigenvalue of a periodic Jacobi matrix is at most 2.     

On a recursive inverse eigenvalue problem

Let s ₁, ..., s _n be arbitrary complex scalars. It is required to construct an n × n normal matrix A such that s _i is an eigenvalue of the leading principal submatrix A _i , i = 1, 2, ..., n. It is shown that, along with the obvious diagonal solution diag(s ₁, ..., s _n ), this problem always admits a much more interesting nondiagonal solution A. As a rule, this solution is a dense matrix; with the diagonal solution, it shares the property that each submatrix A _i is itself a normal matrix, which implies interesting connections between the spectra of the neighboring submatrices A _i and A _{i + 1}.     

An inverse eigenvalue problem and a matrix approximation problem for symmetric skew-hamiltonian matrices

Based on the theory of inverse eigenvalue problem, a correction of an approximate model is discussed, which can be formulated as NX=XΛ, where X and Λ are given identified modal and eigenvalues matrices, respectively. The solvability conditions for a symmetric skew-Hamiltonian matrix N are established and an explicit expression of the solutions is derived. For any estimated matrix C of the analytical model, the best approximation matrix to minimize the Frobenius norm of C − N is provided and some numerical results are presented. A perturbation analysis of the solution is also performed, which has scarcely appeared in existing literatures. Supported by the National Natural Science Foundation of China(10571012, 10771022), the Beijing Natural Science Foundation (1062005) and the Beijing Educational Committee Foundation (KM200411232006, KM200611232010).     

Constructive methods for spectra with three nonzero elements in the nonnegative inverse eigenvalue problem

We present and compare three constructive methods for realizing nonreal spectra with three nonzero elements in the nonnegative inverse eigenvalue problem. We also provide some necessary conditions for realizability and numerical examples. In particular, we utilize the companion matrix.     

Linear parameterized inverse eigenvalue problem of bisymmetric matrices

In this paper, we consider the linear parameterized inverse eigenvalue problem of bisymmetric matrices which is described as follows:     

A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata

In this paper we consider an inverse problem for a damped vibration system from the noisy measured eigendata, where the mass, damping, and stiffness matrices are all symmetric positive‐definite matrices with the mass matrix being diagonal and the damping and stiffness matrices being tridiagonal. To take into consideration the noise in the data, the problem is formulated as a convex optimization problem involving quadratic constraints on the unknown mass, damping, and stiffness parameters. Then we propose a smoothing Newton‐type algorithm for the optimization problem, which improves a pre‐existing estimate of a solution to the inverse problem. We show that the proposed method converges both globally and quadratically. Numerical examples are also given to demonstrate the efficiency of our method. Copyright © 2008 John Wiley & Sons, Ltd.     

子空间上的对称正定及对称半正定阵的左右特征值反问题

文[1][2][3]中讨论AX＝B的对称阵逆特征值问题，文[4][5][6]中讨论了半正定阵的逆特征值问题。本文讨论了空间了子空间上的对称正定及对称半正定阵的左右特征值反问题，给出了解存在的充分条件及解的表达式。     

Reconstruction for a class of the inverse transmission eigenvalue problem

The authors present a constructive algorithm for the numerical solution to a class of the inverse transmission eigenvalue problem. The numerical experiments are provided to demonstrate the efficiency of our algorithms by a numerical example.     

A Riemannian variant of the Fletcher–Reeves conjugate gradient method for stochastic inverse eigenvalue problems with partial eigendata

In this paper, we focus on the stochastic inverse eigenvalue problem with partial eigendata of constructing a stochastic matrix from the prescribed partial eigendata. A Riemannian variant of the Fletcher–Reeves conjugate gradient method is proposed for solving a general unconstrained minimization problem on a Riemannian manifold, and the corresponding global convergence is established under some assumptions. Then, we reformulate the inverse problem as a nonlinear least squares problem over a matrix oblique manifold, and the application of the proposed geometric method to the nonlinear least squares problem is investigated. The proposed geometric method is also applied to the case of prescribed entries and the case of column stochastic matrix. Finally, some numerical tests are reported to illustrate that the proposed geometric method is effective for solving the inverse problem.     

实对称带状矩阵逆特征值问题

研究了一类实对称带状矩阵逆特征值问题：给定三个互异实数λ,μ和v及三个非零实向量x,y和z,分别构造实对称五对角矩阵T和实对称九对角矩阵A,使其都具有特征对(λ,x),(μ,y)和(v,z)．给出了此类问题的两种提法,研究了问题的可解性以及存在惟一解的充分必要条件,最后给出了数值算法和数值例子．     

On inverse eigenvalue problems for block Toeplitz matrices with Toeplitz blocks

We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplitz matrices with symmetric Toeplitz blocks. It is based upon an algorithm which has been used before by others to solve the inverse eigenvalue problem for general real symmetric matrices and also for Toeplitz matrices. First we expose the structure of the eigenvectors of the so-called generalized centrosymmetric matrices. Then we explore the properties of the eigenvectors to derive an efficient algorithm that is able to deliver a matrix with the required structure and spectrum. We have implemented our ideas in a Matlab code. Numerical results produced with this code are included.     

Construction of nonnegative matrices and the inverse eigenvalue problem

This article presents a technique for combining two matrices, an n?×?n matrix M and an m?×?m matrix B, with known spectra to create an (n?+?m???p)?×?(n?+?m???p) matrix N whose spectrum consists of the spectrum of the matrix M and m???p eigenvalues of the matrix B. Conditions are given when the matrix N obtained in this construction is nonnegative. Finally, these observations are used to obtain several results on how to construct a realizable list of n?+?1 complex numbers (λ₁,λ₂,λ₃,σ) from a given realizable list of n complex numbers (c ₁,c ₂,σ), where c ₁ is the Perron eigenvalue, c ₂ is a real number and σ is a list of n???2 complex numbers.