Some algorithms for the conditional mean vector and covariance matrix

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We consider here the problem of computing the mean vector and covariance matrix for a conditional normal distribution, considering especially a sequence of problems where the conditioning variables are changing. The sweep operator provides one simple general approach that is easy to implement and update. A second, more goal-oriented general method avoids explicit computation of the vector and matrix, while enabling easy evaluation of the conditional density for likelihood computation or easy generation from the conditional distribution. The covariance structure that arises from the special case of an ARMA(p, q) time series can be exploited for substantial improvements in computational efficiency.

Cite

CITATION STYLE

APA

Monahan, J. F. (2006). Some algorithms for the conditional mean vector and covariance matrix. Journal of Statistical Software, 16(8), 1–9. https://doi.org/10.18637/jss.v016.i08

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free