2019
DOI: 10.3389/fams.2019.00047
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Implementation of an Iterative Ensemble Smoother for Data Assimilation and Reservoir History Matching

Abstract: Raanes et al. [1] revised the iterative ensemble smoother of Chen and Oliver [2, 3], denoted Ensemble Randomized Maximum Likelihood (EnRML), using the property that the EnRML solution is contained in the ensemble subspace. They analyzed EnRML and demonstrated how to implement the method without the use of expensive pseudo inversions of the low-rank state covariance matrix or the ensemble-anomaly matrix. The new algorithm produces the same result, realization by realization, as the original EnRML method. Howeve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 33 publications
(27 citation statements)
references
References 18 publications
0
27
0
Order By: Relevance
“…We can instead try techniques which better handle departures from linearity. For instance, the iterative ensemble Kalman smoother (e.g., Evensen et al, 2019) is a useful candidate to solve this problem.…”
Section: Summary and Future Workmentioning
confidence: 99%
“…We can instead try techniques which better handle departures from linearity. For instance, the iterative ensemble Kalman smoother (e.g., Evensen et al, 2019) is a useful candidate to solve this problem.…”
Section: Summary and Future Workmentioning
confidence: 99%
“…For computing the Ensemble Smoother (ES) or Iterative Ensemble Smoother (IES) solutions, see [3,9,10,12,24], where the two last papers present new subspace-EnRML algorithm used in this work (see Algorithm 1). The method computes for each ensemble member z j , the following iteration for iterate number i,…”
Section: Subspace Enrml Solutionmentioning
confidence: 99%
“…It is possible to approximately compute the inversion in line number 13 to a cost of O(mN 2 ) operations by using the ensemble subspace algorithm discussed in [7,8,12] (and see also the discussion in the following section).…”
Section: Subspace Enrml Solutionmentioning
confidence: 99%
See 2 more Smart Citations