{"title":"正态时间序列的平均幂分布","authors":"C. Helstrom","doi":"10.1137/0910029","DOIUrl":null,"url":null,"abstract":"The distribution of the sum of the squares of N correlated and normally distributed elements of a time series can be computed by numerical quadrature of a Laplace inversion integral involving the moment generating function (m.g.f.) of the sum. A method is presented for computing that m.g.f. for a stationary autoregressive moving-average (ARMA) process whose spectral density is a known rational function with $2n$ poles. It requires evaluating determinants of $2n \\times 2n$ and $(2n + 1) \\times (2n + 1)$ matrices, which may be much smaller than the $N \\times N$ covariance matrix of the time series. A second method is described that is based on the Kalman equations and applies to time series, possibly nonstationary, generated by a discrete-time linear system driven by normal random noise. A third method, utilizing the Levinson algorithm, applies when the time series is merely stationary.","PeriodicalId":200176,"journal":{"name":"Siam Journal on Scientific and Statistical Computing","volume":"29 35","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Distribution of the average power of a normal time series\",\"authors\":\"C. Helstrom\",\"doi\":\"10.1137/0910029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The distribution of the sum of the squares of N correlated and normally distributed elements of a time series can be computed by numerical quadrature of a Laplace inversion integral involving the moment generating function (m.g.f.) of the sum. A method is presented for computing that m.g.f. for a stationary autoregressive moving-average (ARMA) process whose spectral density is a known rational function with $2n$ poles. It requires evaluating determinants of $2n \\\\times 2n$ and $(2n + 1) \\\\times (2n + 1)$ matrices, which may be much smaller than the $N \\\\times N$ covariance matrix of the time series. A second method is described that is based on the Kalman equations and applies to time series, possibly nonstationary, generated by a discrete-time linear system driven by normal random noise. A third method, utilizing the Levinson algorithm, applies when the time series is merely stationary.\",\"PeriodicalId\":200176,\"journal\":{\"name\":\"Siam Journal on Scientific and Statistical Computing\",\"volume\":\"29 35\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Siam Journal on Scientific and Statistical Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0910029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siam Journal on Scientific and Statistical Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0910029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distribution of the average power of a normal time series
The distribution of the sum of the squares of N correlated and normally distributed elements of a time series can be computed by numerical quadrature of a Laplace inversion integral involving the moment generating function (m.g.f.) of the sum. A method is presented for computing that m.g.f. for a stationary autoregressive moving-average (ARMA) process whose spectral density is a known rational function with $2n$ poles. It requires evaluating determinants of $2n \times 2n$ and $(2n + 1) \times (2n + 1)$ matrices, which may be much smaller than the $N \times N$ covariance matrix of the time series. A second method is described that is based on the Kalman equations and applies to time series, possibly nonstationary, generated by a discrete-time linear system driven by normal random noise. A third method, utilizing the Levinson algorithm, applies when the time series is merely stationary.