Successive Computation of Transformation Matrices for Arbitrary Polynomial Transformation

スポンサーリンク

概要

• 論文の詳細を見る

• In many engineering problems it is required to convert a polynomial into another polynomial through a transformation. Due to its wide range of applications, the polynomial transformation has received much attention and many techniques have been developed to compute the coefficients of a transformed polynomial from those of an original polynomial. In this letter a new result is presented concerning the transformation matrix for arbitrary polynomial transformation. A simple algorithm is obtained which enables one to successively compute transformation matrices of various order.

• （社）電子情報通信学会の論文
• 2009-04-01

著者

• CHOO Younseok

  Department of Electronic and Electrical Engineering, Hongik University

• Choo Younseok

  Department Of Electronic And Electrical Engineering Hongik University

• CHOI Gin

  Department of Electronic and Electrical Engineering, Hongik University

• Choi Gin

  Department Of Electronic And Electrical Engineering Hongik University

関連論文

• Simple Proof of Jury Test for Complex Polynomials
• Successive Computation of Transformation Matrices for Arbitrary Polynomial Transformation
• Simple Proof of Jury Test for Complex Polynomials
• Schur Stability of Convex Combinations of Complex Polynomials(Systems and Control)
• On the Property of a Discrete Impulse Response Gramian with Application to Model Reduction(Systems and Control)
• A Simplified Jury's Table for Complex Polynomials
• Computing Transformation Matrix for Bilinear S-Z Transformation(Systems and Control)
• Further Results on Jury Test for Complex Polynomials
• On the Monotonic Condition for Schur Stability of Real Polynomials
• Computing Transformation Matrix for 1-D to 2-D Polynomial Transformation

スポンサーリンク