ACM Home Page
Please provide us with feedback. Feedback
Efficient maximum likelihood estimation of linear models with APL
Full text PdfPdf (837 KB)
Source International Conference on APL archive
Proceedings of the international conference on APL table of contents
Toronto, Ontario, Canada
Pages: 190 - 199  
Year of Publication: 1993
ISBN:0-89791-612-3
Also published in ...
Author
Sponsor
SIGAPL: ACM Special Interest Group on APL Programming Language
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 22,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/166197.166221
What is a DOI?

ABSTRACT

Maximum likelihood estimators used in statistics and econometrics have desirable properties, however, due to the complexity of their solution maximum likelihood techniques are not widely used. This paper examines an APL implementation of one of the most efficient algorithms used to estimate the parameters of the univariate ARMA process. The straight-forward use of APL is found to be unacceptable and so a systematic search for optimizations is made. This search results in an approximate solution for the ML estimator, the use of □NA and FORTRAN, and special matrix techniques to increase the efficiency of the algorithm. The matrix techniques used are implementations of sparse, banded, and block diagonal data structures. Additional matrix techniques involve incremental updating of matrices. The effect of these optimizations is to bring the computational cost from an O(N*3) problem to an O(N*1) problem. This translates into a significant reduction in computer requirements. For example, to estimate a three parameter ARMA model with 5000 observations, memory requirements fall from approximately 95 megabytes to 300 kilobytes. Computer time falls from about 6.4 years to under 1 minute.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Koreislaa, Sergio and Pukkila, Tarmo, Fast Linear Estimation Methods for Vector Autoregressive Moving-Average Models, Journal of Time Series Analysis,(1989),10,325-340.
 
3
Koreisha, Sergio and lhakkfla, Tarmo, A Generalized Least- Squares Approach for Estimation of Autoregressive Moving- Average Models, J. Time Ser. Ana/.,(1990),l 1,139-152.
 
4
Reirtsel, G.C., Basu, S., and Yap, S.F., Maximum Likelihood Estimators in the Multivariate Autoregressive Moving Average Model from a Generalized Least Squares Viewpoint, J. Time Set. Ana/.,(1992),13, 133-146.
 
5
Ansley, Craig F., An algorithm for the exact likelihood of a mixed autoregressive-moving average process, Biometrica (1979),66,1 pp. 59-65.
 
6
Grenander, U., MATHEMATICAL EXPERIMENTS ON THE COMPUTER, Academic Press (1982).



Peer to Peer - Readers of this Article have also read: