An algorithm for the exact likelihood of a high-order autoregressive-moving average process

Abstract

SUMMARY The likelihood function for an autoregressive-moving average process is obtained using Kalman filtering and an algorithm of Morf, Sidhu & Kailath (1974). It is shown that this method is more efficient than others in the literature when the order of the moving average part is greater than five.