Show simple item record

dc.contributor.authorNino-Ruiz, Elias D.en
dc.contributor.authorSandu, Adrianen
dc.contributor.authorDeng, Xinweien
dc.date.accessioned2017-03-06T18:31:53Zen
dc.date.available2017-03-06T18:31:53Zen
dc.date.issued2016-06-03en
dc.identifier.urihttp://hdl.handle.net/10919/75261en
dc.description.abstractThis paper discusses an efficient parallel implementation of the ensemble Kalman filter based on the modified Cholesky decomposition. The proposed implementation starts with decomposing the domain into sub-domains. In each sub-domain a sparse estimation of the inverse background error covariance matrix is computed via a modified Cholesky decomposition; the estimates are computed concurrently on separate processors. The sparsity of this estimator is dictated by the conditional independence of model components for some radius of influence. Then, the assimilation step is carried out in parallel without the need of inter-processor communication. Once the local analysis states are computed, the analysis sub-domains are mapped back onto the global domain to obtain the analysis ensemble. Computational experiments are performed using the Atmospheric General Circulation Model (SPEEDY) with the T-63 resolution on the Blueridge cluster at Virginia Tech. The number of processors used in the experiments ranges from 96 to 2,048. The proposed implementation outperforms in terms of accuracy the well-known local ensemble transform Kalman filter (LETKF) for all the model variables. The computational time of the proposed implementation is similar to that of the parallel LETKF method (where no covariance estimation is performed). Finally, for the largest number of processors, the proposed parallel implementation is 400 times faster than the serial version of the proposed method.en
dc.relation.urihttp://arxiv.org/abs/1606.00807v1en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectcs.NAen
dc.subject62L20en
dc.subject62M05en
dc.subject62M20en
dc.subject62P35en
dc.titleA Parallel Implementation of the Ensemble Kalman Filter Based on Modified Cholesky Decompositionen
dc.typeArticle - Refereeden
dc.contributor.departmentComputer Scienceen
dc.description.notesarXiv admin note: text overlap with arXiv:1605.08875en
dc.identifier.orcidDeng, X [0000-0002-1560-2405]en
pubs.organisational-group/Virginia Techen
pubs.organisational-group/Virginia Tech/All T&R Facultyen
pubs.organisational-group/Virginia Tech/Engineeringen
pubs.organisational-group/Virginia Tech/Engineering/COE T&R Facultyen
pubs.organisational-group/Virginia Tech/Engineering/Computer Scienceen
pubs.organisational-group/Virginia Tech/Scienceen
pubs.organisational-group/Virginia Tech/Science/COS T&R Facultyen
pubs.organisational-group/Virginia Tech/Science/Statisticsen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record