On Computation of Approximate Eigenvalues and Eigenvectors
スポンサーリンク
概要
- 論文の詳細を見る
In Ref. [5], the author defines "approximate eigenvalues"and"approximate eigenvectors," which are, in short, Taylor series expansions of eigenvalues and eigenvectors of a polynomial matrix. In this paper, an efficient algorithm to compute the approximate eigenvalues and eigenvectors is presented. The algorithm performs the computations with an arbitrary degree of convergence.
- 一般社団法人電子情報通信学会の論文
- 2002-03-01
著者
関連論文
- The Optimal H_∞ Norm of a Parametric System Achievable by an Output Feedback Controller
- On the Check of Accuracy of the Coefficients of Formal Power Series
- The Optimal H_∞ Norm of a Parametric System Achievable Using a Static Feedback Controller(Systems and Control)
- Extension of the Algorithm to Compute H_∞ Norm of a Parametric System
- Efficient Computation of the Characteristic Polynomial of a Polynomial Matrix
- On Efficient Computations of Approximate Roots
- Accurate Computation of a High Degree Coefficient of a Power Series Root(Algorithms and Data Structures)
- On Computation of Approximate Eigenvalues and Eigenvectors
- On Computation of a Power Series Root with Arbitrary Degree of Convergence
- Computation of the Peak of Time Response in the Form of Formal Power Series(Systems and Control)