2000 character limit reached
Likelihood Gradient Evaluation Using Square-Root Covariance Filters
Published 21 May 2016 in cs.SY and math.OC | (1605.06654v1)
Abstract: Using the array form of numerically stable square-root implementation methods for Kalman filtering formulas, we construct a new square-root algorithm for the log-likelihood gradient (score) evaluation. This avoids the use of the conventional Kalman filter with its inherent numerical instabilities and improves the robustness of computations against roundoff errors. The new algorithm is developed in terms of covariance quantities and based on the "condensed form" of the array square-root filter.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.