On Puiseux Expansion of Approximate Eigenvalues and Eigenvectors
スポンサーリンク
概要
- 論文の詳細を見る
In[1], approximate eigenvalues and eigenvectors are defined and algorithms to compute them are described. However, the algorithm require a certain condition:the eigenvalues of M modulo S are all distinct, where M is a given matrix with polynomial entries and S is a maximal ideal generated by the indeterminate in M. In this paper, we deal with the construction of approximate eigenvalues and eigevectors when the condition is not satisfied. In this case, powers of approximate eigenvalues and eigenvectors become, in general, fractions. In other words, approximate eigenvalues and eigenvectors are expressed in the form of Puiseux series. We focus on a matrix with univariate polynomial entries and give complete algorithms to compute the approximate eigenvalues and eigenvectors of the matrix.
- 社団法人電子情報通信学会の論文
- 1998-06-25
著者
関連論文
- The CHACM Method for Computing the Characteristic Polynomial of a Polynomial Matrix
- On Puiseux Expansion of Approximate Eigenvalues and Eigenvectors