1993 | OriginalPaper | Chapter
On Approximate Modeling of Linear Gaussian Processes
Authors : Andrea Gombani, Claudia Polini
Published in: New Directions in Time Series Analysis
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The problem we consider here is the elimination of the redundant complexity in the modeling of stationary time series by means of stochastic realization theory. The question is posed in terms of approximate modeling of a gaussian process. It is shown that a minimal representation of the process can be obtained with a very simple algorithm of polynomial complexity from a nonminimal one, and that this algorithm can be extended to give an approximate realization of fixed degree k We also show that different realizations yield different approximation errors, and discuss how to choose the representation which gives the best approximant.