Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Efficient numerical method for the discrete-time symmetric matrix polynomial equation

Efficient numerical method for the discrete-time symmetric matrix polynomial equation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Control Theory and Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

A numerical procedure is proposed to solve a matrix polynomial equation frequently encountered in discrete-time control and signal processing. The algorithm is based on a simple rewriting of the original equation in terms of a reduced Sylvester matrix. In contrast to previously published methods, it does not make use of elementary polynomial operations. Moreover, and most notably, it is numerically reliable. Basic examples borrowed from control and signal processing literature are aimed at illustrating the simplicity and efficiency of this new numerical method.

Inspec keywords: signal processing; discrete time systems; polynomial matrices; numerical stability

Other keywords: reduced Sylvester matrix; signal processing; discrete-time control; discrete-time symmetric matrix polynomial equation; numerical method

Subjects: Signal processing theory; Linear algebra (numerical analysis); Linear algebra (numerical analysis); Discrete control systems; Signal processing and detection

References

    1. 1)
      • V. Kučera . Analysis and design of discrete linear control systems. Prentice Hall Int. Ser. Syst. Control Eng.
    2. 2)
      • D. Henrion , M. Šebek . Symmetric matrix polynomial equation: interpolation results. Automatica
    3. 3)
      • J. Ježek , V. Kučera . Efficient algorithm for matrix spectral factorization. Automatica , 6 , 663 - 669
    4. 4)
      • J. Ježek . Symmetric matrix polynomial equations. Kybernetika , 1 , 19 - 30
    5. 5)
      • P. Lancaster , M. Tismenetsky . (1985) The theory of matrices with applications.
    6. 6)
      • G.H. Golub , C.F. Van Loan . (1989) Matrix computations.
    7. 7)
      • P.J. Antsaklis , Z. Gao . Polynomial and rational matrix interpolation: theory andcontrol applications. Int. J. Control , 2 , 349 - 404
    8. 8)
      • T. Kailath . (1980) Linear systems.
    9. 9)
      • T. Söderström , J. Ježek , V. Kučera . An efficient and versatile algorithm for computingthe covariance function of an ARMA process. IEEE Trans. Signal Process. , 6 , 1591 - 1600
    10. 10)
      • Kwakernaak, H., Šebek, M.: `The polynomial toolbox for MATLAB, Version 1.5', 1997, Available as freeware on the Internet at http://www.math.utwente.nl/polbox/.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cta_19982232
Loading

Related content

content/journals/10.1049/ip-cta_19982232
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address