where \(\mathbf {c} = (c(x_0),\dots ,c(x_{N-1}))^T\)  contains the discrete point values of \(c\) ; \(\mathbf {c}_{\text{cont}}\)  is a vector of the \(N+N_{\text{cont}}\)  discretely-periodic function values; \(I\) 
is the identity matrix; and \(A_\ell , A_r\)  contain the
corresponding \(N_\text{cont}\)  values that blend, to zero, the left and the right Gram basis vectors. The columns of \(Q_\ell \) , \(Q_r\)  (containing the \(d_\ell , d_r\) 
point values of each element of the corresponding Gram basis) differ only by column-ordering for \(d_\ell =d_r\)  (and hence \(A_\ell , A_r\)  by row). Further technical details on the blend-to-zero FC(Gram) algorithm have been provided previously [1]}, [2]}, [3]}.
