摘要
已知两个实数列{λ_i}_1~n和{μ_i}_1^(n-1),满足条件λ_i<μ_i<λ_(i+1)(i=1,2,…,n-1),求一个n阶Jacobi矩阵J,使得J具有特征值{λ_i}_1~n,而J_(-k)具有特征值{μ_i}_1^(n-1),其中J_(-k)表示划去J的第k行和第k列后所得的矩阵,1<k<n.本文用较初等的方法证明了这一问题解的唯一性,并给出三种算法和两个计算实例。
In this paper, given the seguences with it is required to determine an nth order Jacobi matrix J for which J has as its eigenvalues and J_k has as its eigenvalues, where J_k denates the principal suhmatrix of J obtained by deleting the kth row and column from 7, l<k<n.The proof of the uniqueness of the solution is given. Three numerical methods for solving the problem are described and two numerical examples are given.
出处
《石油大学学报（自然科学版）》
CSCD
1990年第4期116-126,共11页
Journal of the University of Petroleum,China(Edition of Natural Science)
关键词
特征值
特征向量
矩阵
Eigenvalue
Eigenvector
Matrix
Algorithm
