摘要
研究以下反问题:给定两组实数(?),满足如下分隔条件:(?),要求构造一个n阶Jacobi矩阵J_n,使得(?)是J_n的特征值,(?)是J_(2,n)的特征值,本文利用Jacobi矩阵的性质,导出了求解上述问题的一个算法.
The following inverse problem is discussed through two given sets of distinct realnumbers and satisfying the condition of .It is requiured to constructanXn Jacobi matrix Jn, so that are the eigenvalues of Jn; and ,the eigenvaluesof the matrix J2,n obtained from the first row and the first column of Jn. Based on the proper-ties of Jacobi matrices, a numerical method for solving the problem is derived.
出处
《南京航空航天大学学报》
EI
CAS
CSCD
1996年第6期766-771,共6页
Journal of Nanjing University of Aeronautics & Astronautics
关键词
矩阵
逆问题
特征值
雅各比矩阵
matrix
inverse problem
Jacobi matrices
eigenvalue
