Processing math: 100%

Cholette algorithm

Introduction

Given an initial time series zt,0t<n we have to find the corresponding xt that respects the (observed) aggregation constraints xT=tTxt and that follows the short-term movements of zt.

In the Cholette’s method, this is achieved by minimizing the following quadratic penalty function:

t(xtzt|zt|λρxt1zt1|zt1|λ)2

It is easy to see that the quadratic function of Cholette corresponds, from a formal point of view, to the sum of the square residuals generated by the auto-regressive process:

xtzt|zt|λ=δt|zt|λ=μt μt=ρμt1+ϵt

To simplify the notations, we will use hereafter |zt|λ=γt .

Starting from that observation, we can give the Cholette’s algorithm a state space representation.

State vector

We define the state vector as

αt=((γtμt)C_μt)

Initialization

α1=(00)

Not diffuse: rho<1

P=(00011ρ2)

Diffuse (Denton variant): ρ=1

B=(01)

P=(0001)

Dynamics

Tt={(000ρ),t+1modc=0(0γt0ρ),tmodc=0(1γt0ρ),otherwise

Vt=(0001),St=(01)

Measurement

Zt={(0γt),tmodc=0(1γt),tmodc0

ht=0

The “observations” are defined by Ztαt=(γtμt)C. They are available for the periods t such that t=qc1 and missing for the other periods. For the observed periods, they correspond to xTzT.

Once ˆμt have been estimated, we retrieve ˆxt by ˆxt=zt+γtˆμt