Parallelization algorithms for modeling ARM processes. (2000)

• Record Type: Journal Article
• Authors: Melamed, Benjamin; Singh, Santokh
• Is Part Of: Journal of applied mathematics and stochastic analysis. Volume 13:Number 4(2000)
• Page Start: 393
• Page End: 410
• Publication Date: 2000
• Subjects: ARM processes -- autocorrelation function -- circulant matrices -- parallel computation -- partitioning -- GSLO algorithm -- optimization -- similarity classes; Mathematical models -- Periodicals; Computer simulation -- Periodicals; Computer science -- Mathematics -- Periodicals; Computer science -- Mathematics; Computer simulation; Mathematical models; Applied Mathematics; Periodicals; Electronic journals; 519.22
• DOI: 10.1155/S1048953300000332
• Languages: English
• ISSNs: 1048-9533

Abstract

Abstract : AutoRegressive Modular (ARM) processes are a new class of nonlinear stochastic processes, which can accurately model a large class of stochastic processes, by capturing the empirical distribution and autocorrelation function simultaneously. Given an empirical sample path, the ARM modeling procedure consists of two steps: a global search for locating the minima of a nonlinear objective function over a large parametric space, and a local optimization of optimal or near optimal models found in the first step. In particular, since the first task calls for the evaluation of the objective function at each vector of the search space, the global search is a time consuming procedure. To speed up the computations, parallelization of the global search can be effectively used by partitioning the search space among multiple processors, since the requisite communication overhead is negligible. This paper describes two space-partitioning methods, called Interleaving and Segmentation, respectively. The speedups resulting from these methods are compared for their performance in modeling real-life data.