Abstract

http://ssrn.com/abstract=715301
 
 

References (13)



 


 



A Simplified Approach to Understanding the Kalman Filter Technique


Tom Arnold


University of Richmond - E. Claiborne Robins School of Business

Mark Bertus


Auburn University

Jonathan M. Godbey


Georgia State University - Department of Finance

December 21, 2007


Abstract:     
The Kalman Filter is a time series estimation algorithm that is applied extensively in the field of engineering and recently (relative to engineering) in the field of finance and economics. However, presentations of the technique are somewhat intimidating despite the relative ease of generating the algorithm. This paper presents the Kalman Filter in a simplified manner and produces an example of an application of the algorithm in Excel. This scaled down version of the Kalman filter can be introduced in the (advanced) undergraduate classroom as well as the graduate classroom.

Number of Pages in PDF File: 24

Keywords: Kalman Filter, time series, EM algorithm, Excel, Pedagogy

JEL Classification: C22, C32, G13

working papers series


Download This Paper

Date posted: May 7, 2005 ; Last revised: April 17, 2008

Suggested Citation

Arnold, Tom and Bertus, Mark and Godbey, Jonathan M., A Simplified Approach to Understanding the Kalman Filter Technique (December 21, 2007). Available at SSRN: http://ssrn.com/abstract=715301 or http://dx.doi.org/10.2139/ssrn.715301

Contact Information

Thomas M. Arnold (Contact Author)
University of Richmond - E. Claiborne Robins School of Business ( email )
1 Gateway Drive
Richmond, VA 23173
United States
804-287-6399 (Phone)
804-289-8878 (Fax)
Mark Bertus
Auburn University ( email )
415 W Magnolia
Lowder rm 303
Auburn, AL 36849
United States
Jonathan M. Godbey
Georgia State University - Department of Finance ( email )
University Plaza
Atlanta, GA 30303-3083
United States
Feedback to SSRN


Paper statistics
Abstract Views: 23,074
Downloads: 11,605
Download Rank: 146
References:  13

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo8 in 0.265 seconds