We consider a class of structured covariance completion problems which aim to complete partially known sample statistics in a way that is consistent with the underlying linear dynamics. The statistics of stochastic inputs are unknown and sought to explain the given correlations. Such inverse problems admit many solutions for the forcing correlations, but can be interpreted as an optimal low-rank approximation problem for identifying forcing models of low complexity. On the other hand, the quality of completion can be improved by utilizing information regarding the magnitude of unknown entries. We generalize theoretical results regarding the r* norm approximation and demonstrate the performance of this heuristic in completing partially available statistics using stochastically-driven linear models.