刚性ode的矢量化并行粒子滤波SMC参数估计

Andrea Arnold, D. Calvetti, E. Somersalo
{"title":"刚性ode的矢量化并行粒子滤波SMC参数估计","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":"{\"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}","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

摘要

粒子滤波(PF)序贯蒙特卡罗(SMC)方法对于时变系统的参数估计非常有吸引力,在这些系统中,数据不是一次全部可用,或者时间常数的范围足够大,以至于在状态的数值时间传播中产生问题。进化大量粒子的需要使得基于pf的方法在计算上具有挑战性,主要瓶颈是每个粒子的时间传播和大量粒子。虽然通常提倡并行化以加快计算时间,但在单个处理器上对算法进行矢量化可能会导致某些问题的更快速度。在本文中,我们提出了Arnold等人(2013)提出的PF-SMC类算法的公式,该算法特别适用于并行或矢量化计算环境,并通过MATLAB中的几个计算示例说明了性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vectorized and Parallel Particle Filter SMC Parameter Estimation for Stiff ODEs
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信