Parallel filter algorithms for data assimilation in oceanography [Elektronische Ressource] / von Lars Nerger
197 pages
English

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

Parallel filter algorithms for data assimilation in oceanography [Elektronische Ressource] / von Lars Nerger

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus
197 pages
English
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus

Informations

Publié par
Publié le 01 janvier 2004
Nombre de lectures 22
Langue English
Poids de l'ouvrage 5 Mo

Extrait

Parallel Filter Algorithms
for Data Assimilation in Oceanography
von Lars Nerger
Dissertation
zur Erlangung des Grades
eines Doktors der Naturwissenschaften
| Dr. rer. nat. |
Angefertig am
Alfred-Wegener-Institut
f˜ur Polar und Meeresforschung
Bremerhaven
Vorgelegt im Fachbereich 3 (Mathematik & Informatik)
der Universit˜ at Bremen
im Dezember 2003Datum des Promotionskolloquiums: 12. Februar 2004
Gutachter: Prof. Dr. Wolfgang Hiller (Universit˜ at Bremen und
Alfred-Wegener-Institut Bremerhaven)
Dr. Jens Schr˜ oter (Alfred-Wven)Abstract
A consistent systematic comparison of fllter algorithms based on the Kalman fllter and
intended for data assimilation with high-dimensional nonlinear numerical models is
presented. Considered are the Ensemble Kalman Filter (EnKF), the Singular Evolutive
Extended Kalman (SEEK) fllter, and the Singular Evolutive Interpolated (SEIK) fllter.
Within the two parts of this thesis, the fllter algorithms are compared with a focus on
their mathematical properties as Error Subspace Kalman Filters (ESKF). Further, the
fllters are studied as parallel algorithms. This study includes the development of an
e–cient framework for flltering.
In the flrst part, the fllter algorithms are motivated in the context of statistical esti-
mation. The unifled interpretation of the algorithms as Error Subspace Kalman Filters
provides the basis for the consistent comparison of the fllter algorithms. The e–cient
implementation of the algorithms is discussed and their computational complexity is
compared. Numerical data assimilation experiments with a test model based on the
shallow water equations show how choices of the assimilation scheme and particular
state ensembles for the initialization of the fllters lead to signiflcant variations of the
data assimilation performance. The relation of the data assimilation performance to
difierent qualities of the predicted error subspaces is demonstrated by a statistical ex-
amination of the predicted state covariance matrices. The comparison of the fllters
shows that problems of the analysis equations are apparent in the EnKF algorithm
due to the Monte Carlo sampling of ensembles. In addition, the SEIK fllter appears
to be a numerically very e–cient algorithm with high potential for use with nonlinear
models.
The application of the EnKF, SEEK, and SEIK algorithms on parallel computers
is studied in the second part. The parallelization possibilities of the difierent phases
of the fllter algorithms are examined. In addition, a framework for parallel flltering
is developed which allows to combine fllter algorithms with existing numerical models
requiring only minimal changes to the source code of the model. The framework has
beenusedtocombinetheparallelfllteralgorithmswiththe3-dimensionalflniteelement
ocean model FEOM. Numerical data assimilation experiments are utilized to assess the
parallel e–ciency of the flltering framework and the parallel fllters. The experiments
yield an excellent parallel e–ciency for the flltering framework. Furthermore, the
framework and the fllter algorithms are well suited for application to realistic large-
scale data assimilation problems.
iContents
Introduction 1
I Error Subspace Kalman Filters 5
1 Data Assimilation 7
1.1 Overview................................... 7
1.2 The Adjoint Method ............................ 8
1.3 Sequential Data Assimilation........................ 11
2 Filter Algorithms 13
2.1 Introduction................................. 13
2.2 Statistical Estimation 14
2.3 The Extended Kalman Filter 15
2.4 Error subspace Filters....................... 18
2.4.1 SEEK { The Singular Evolutive Extended Kalman Filter .... 19
2.4.2 EnKF { The Ensemble Kalman Filter............... 22
2.4.3 SEIK { The Singular Evolutive Interpolated Kalman Filter . . . 26
2.5 Nonlinear Measurement Operators..................... 29
2.5.1 Situation of the Extended Kalman Filter ............. 29
2.5.2 Direct Application of Nonlinear Measurement Operators .... 29
2.5.3 State Augmentation ........................ 30
2.6 Summary .................................. 32
3 Comparison and Implementation of Filter Algorithms 33
3.1 Introduction................................. 33
3.2 Comparison of SEEK, EnKF, and SEIK ................. 33
3.2.1 Representation of Initial Error Subspaces............. 33
3.2.2 Prediction of Error Subspaces ................... 36
3.2.3 Treatment of Model Errors..................... 36
3.2.4 The Analysis Phase......................... 37
3.2.5 Resampling ............................. 38
3.3 Implementation ............................... 38
iiiiv Contents
3.3.1 Main Structure of the Filter Algorithm .............. 38
3.3.2 The Analysis Phase......................... 41
3.3.3 The Resampling Phase ....................... 48
3.3.4 Optimizations for E–ciency .................... 48
3.4 Computational Complexity of the Algorithms .............. 49
3.5 Summary .................................. 53
4 Filtering Performance 55
4.1 Introduction................................. 55
4.2 Experimental Conflgurations........................ 56
4.3 Comparison of Filtering Performances................... 59
4.4 Statistical Examination of Filtering Performance............. 65
4.4.1 Deflnition of Analysis Quantities ................. 65
4.4.2 The In uence of Ensemble Size .................. 67
4.4.3 Sampling Difierences between EnKF and SEIK ......... 69
4.4.4 Experiments with Idealized Setup 70
4.5 Summary .................................. 71
5 Summary 73
II Parallel Filter Algorithms 75
6 Overview and Motivation 77
7 Parallelization of the Filter Algorithms 81
7.1 Introduction................................. 81
7.2 Parallelization over the Modes....................... 82
7.2.1 Distributed Operations 83
7.2.2 SEEK ................................ 85
7.2.3 EnKF 88
7.2.4 SEIK 90
7.2.5 Communication and Memory Requirements ........... 92
7.3 Filtering with Domain Decomposition................... 94
7.3.1 Distributed Operations....................... 95
7.3.2 SEEK ................................ 95
7.3.3 EnKF 98
7.3.4 SEIK................................. 100
7.3.5 Communication and Memory Requirements ........... 100
7.4 Localized Filter Analyses.......................... 103
7.5 Summary .................................. 108Contents v
8 A Framework for Parallel Filtering 111
8.1 Introduction................................. 111
8.2 General Considerations........................... 112
8.3 Framework for Joint Process Sets for Model and Filter ......... 116
8.3.1 The Application Program Interface ................ 116
8.3.2 Process Conflgurations for the Filtering Framework ....... 119
8.3.3 The Functionality of the Framework Routines .......... 121
8.4 Framework for Model and Filter on Disjoint Process Sets ........ 124
8.4.1 The Application Program Interface 125
8.4.2 Process Conflgurations for the Filtering Framework ....... 127
8.4.3 Execution Structure of the Framework .............. 129
8.5 Transition between the State Vector and Model Fields.......... 133
8.6 Summary and Conclusions ......................... 135
9 Filtering Performance and Parallel E–ciency 139
9.1 Introduction................................. 139
9.2 The Finite Element Ocean Model FEOM................. 139
9.3 Experimental Conflgurations........................ 141
9.4 Filtering Performance............................ 144
9.4.1 Reduction of Estimation Errors .................. 144
9.4.2 Estimation of 3-dimensional Fields ................ 146
9.5 Parallel E–ciency of Filter Algorithms 148
9.5.1 of the Framework .................... 151
9.5.2 Speedup of the Filter Part for Mode-decomposition ....... 154
9.5.3 Speedup of the Filter Part for Domain-decomposition ...... 158
9.6 Summary .................................. 162
10 Summary and Conclusion 165
A Parallel Computing 169
A.1 Introduction................................. 169
A.2 Fundamental Concepts ........................... 169
A.3 Performance of Parallel Algorithms .................... 171
A.4 The Message Passing Interface (MPI)................... 172
B Documentation of Framework Routines 175
References 181
Acknowledgments 189vi ContentsIntroduction
Simulating the ocean general circulation provides the possibility to improve the un-
derstanding of climate relevant phenomena in the ocean. Absolute currents can be
simulated which determine, for example, oceanic heat transports. Furthermore, the
stability and variability of oceanic ows can be examined.
The numerical models used for simulating the ocean are based on physical flrst prin-
ciples formulated by partial difierential equations. Due to the discretization, models
of high dimension arise. In addition, several difierent flelds have to be modeled like,
temperature, salinity, velocities, and the sea surface elevation. These large-scale ocean
models are computationally demanding and hence require the use of parallel computers
to cope with the huge memory and computing requirements. Despite their complexity,
the models comprise several errors. Due to the flnite resolution of the discretization,
there are unresolved processes. These remain either unmodeled or are considered in
parameterized form. Some processes are n

  • Univers Univers
  • Ebooks Ebooks
  • Livres audio Livres audio
  • Presse Presse
  • Podcasts Podcasts
  • BD BD
  • Documents Documents