摘要: An efficient procedure for computing autocovariance sequences of multiple autoregressive moving-average processes is proposed. While the computational complexity existing algorithms proportional to p/sup 3/, where p denotes degree polynomial, proposed has a O(p/sup 2/). The resulting scheme leads substantial savings, especially when dealing with polynomials high and therefore facilitates estimation exact maximum-likelihood methods. >