{"title":"Vectorized and Parallel Particle Filter SMC Parameter Estimation for Stiff ODEs","authors":"Andrea Arnold, D. Calvetti, E. Somersalo","doi":"10.3934/proc.2015.0075","DOIUrl":null,"url":null,"abstract":"Particle filter (PF) sequential Monte Carlo (SMC) methods are very attractive for the estimation of parameters of time dependent systems where the data is either not all available at once, or the range of time constants is wide enough to create problems in the numerical time propagation of the states. The need to evolve a large number of particles makes PF-based methods computationally challenging, the main bottlenecks being the time propagation of each particle and the large number of particles. While parallelization is typically advocated to speed up the computing time, vectorization of the algorithm on a single processor may result in even larger speedups for certain problems. In this paper we present a formulation of the PF-SMC class of algorithms proposed in Arnold et al. (2013), which is particularly amenable to a parallel or vectorized computing environment, and we illustrate the performance with a few computed examples in MATLAB.","PeriodicalId":8446,"journal":{"name":"arXiv: Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/proc.2015.0075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Particle filter (PF) sequential Monte Carlo (SMC) methods are very attractive for the estimation of parameters of time dependent systems where the data is either not all available at once, or the range of time constants is wide enough to create problems in the numerical time propagation of the states. The need to evolve a large number of particles makes PF-based methods computationally challenging, the main bottlenecks being the time propagation of each particle and the large number of particles. While parallelization is typically advocated to speed up the computing time, vectorization of the algorithm on a single processor may result in even larger speedups for certain problems. In this paper we present a formulation of the PF-SMC class of algorithms proposed in Arnold et al. (2013), which is particularly amenable to a parallel or vectorized computing environment, and we illustrate the performance with a few computed examples in MATLAB.