Index-> contents reference index search external Previous Next Home home-> resume publications pub_abstract white_paper packages software journals ssh_key fedora_package bikelist rock_climb picture mdot_bike_wish links pub_abstract-> newton_step tmb rkhs_bayes dismod_pde sskm l1_rks implicit_ad ckbs bayes_inverse mcmc_smooth semiblind neuron ConsumeO2 StochasticNonlinear SmoothVariance randompar markov sammii relative gps smoother prolate update nltrack network burg semi gamma match nsmooth error line_search smoother Headings-> Abstract

The iterated Kalman smoother as a Gauss-Newton method

Abstract
The Kalman smoother is known to be the maximum likelihood estimator when the measurement and transition functions are affine; i.e., a linear function plus a constant. A new proof of this result is presented that shows that the Kalman smoother decomposes a large least squares problem into a sequence of much smaller problems. The iterated Kalman smoother is then presented and shown to be a Gauss-Newton method for maximizing the likelihood function in the nonaffine case. The method takes advantage of the decomposition obtained with the Kalman smoother.  citation
Input File: smoother.omh