Abstract
The paper treats the problem of constructing canonical ladder realizations for vector autoregressive (AR) processes specified by their characteristic matrix polynomials. The difficulty of this problem is rooted in the fact that the backward matrix polynomial corresponding to a given vector AR process is a nontrivial function of the forward matrix polynomial. The construction calls for solving a discrete Lyapunov equation in block-controller form. Two efficient procedures for solving this equation are presented, both requiring a number of operations that is proportional to at most the square of the model order. Applications of the new procedures to stability, tests, simulation of AR processes, and model reduction are described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.