By Topic

Convergence analysis of ladder algorithms for AR and ARMA models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Olcer, S. ; IBM Z??rich Research Laboratory, Switzerland

A class of exact fast algorithms originally introduced in the signal processing area is provided by the so-called recursive least squares ladder forms. The many nice numerical and structural properties of these algorithms have made them a very powerful alternative in a very large variety of applications. Yet the convergence properties of the algorithms have not received the necessary attention. This paper gives an asymptotic analysis of two particular ladder algorithms, designed for auto-regressive (AR) and auto-regressive-moving-average (ARMA) models. Convergence is studied based on the stability properties of an associated differential equation. The conditions obtained for the convergence of the algorithms parallel those known for prediction error methods and for a particular type of pseudo-linear regression.

Published in:

Decision and Control, 1984. The 23rd IEEE Conference on

Date of Conference:

12-14 Dec. 1984