Automatic history matching is based on minimizing an objective function that quantifies the mismatch between observed and simulated data. When using gradient-based methods for solving this optimization problem, a key point for the overall procedure is how the simulator delivers the necessary derivative information. In this paper, forward and adjoint methods for derivative calculation are discussed. Procedures for sensitivity matrix building, sensitivity matrix and transpose sensitivity matrix vector products are fully described. To show the usefulness of the derivative calculation algorithms, a new variant of the gradzone analysis, which tries to address the problem of selecting the most relevant parameters for a history matching, is proposed using the singular value decomposition of the sensitivity matrix. Application to a simple synthetic case shows that this procedure can reveal important information about the nature of the history-matching problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
F. Anterion, R. Eymard and B. Karcher, Use of parameter gradients for reservoir history matching, in: Proc. of the SPE Symposium on Reservoir Simulation, Houston, TX, USA, paper SPE 18433 (6–8 February 1989).
R. Bissel, Calculating optimal parameters for history matching, in: Proc. of the 4th European Conference on the Mathematics of Oil Recovery, Roros, Norway (7–10 June 1994).
A. Bjorck, Numerical Methods for Least Squares Problems (SIAM, Philadelphia, 1996).
B. Brun, O. Gosselin and J.W. Barker, Use of prior information in gradient-based history-matching, in: Proc. of the SPE Symposium on Reservoir Simulation, Houston, TX, USA, paper SPE 66353 (11–14 February 200).
Computer Modelling Group, IMEX 2004 User’s Guide (Calgary, Canada, 2004).
G. Gao, G. Li and A.C. Reynolds, A stochastic optimization algorithm for automatic history matching, in: Proc. of the SPE Annual Technical Conference and Exhibition, Houston, TX, USA, paper SPE 90065 (26–29 September 200).
G.H. Golub and C.F. Van Loan, Matrix Computations (John Hopkins University Press, Baltimore, 1989).
M. Hanke and P.C. Hansen, Regularization methods for large-scale problems, Surv. Math. Ind. 3 (1993) 253–315.
R. Li, A.C. Reynolds and D.S. Oliver, History matching of three-phase flow production data, in: Proc. of the SPE Symposium on Reservoir Simulation, Houston, TX, USA, paper SPE 66351 (11–14 February 2001).
R. Li, A.C. Reynolds and D.S. Oliver, Sensitivity coefficients for three-phase flow history matching, J. Can. Pet. Technol. 42(4) (2003) 70–77.
M. Mezghani, Caractérisation des Réservoirs Hétérogènes:Méthode des Sentinelles et Quantification des Incertitudes, Ph.D. diss., Institut Français du Pétrole, Paris, France (1999).
J. Nocedal and S.J. Wright, Numerical Optimization (Springer, New York, 1999).
D.P. O’Leary and J.A. Simmons, A bidiagonalization–regularization procedure for large scale discretizations of ill-posed problems, SIAM J. Sci. Statist. Comput. 2(4) (1981) 474–489.
J.R.P. Rodrigues, Calculating derivatives for history matching in reservoir simulators, in: Proc. of the SPE Symposium on Reservoir Simulation, The Woodlands, USA, paper SPE 93445 (2005).
C.R. Vogel and J.G. Wade, Iterative SVD-based methods for ill-posed problems, SIAM J. Sci. Comput. 15(3) (1994) 736–754.
F. Zhang and A.C. Reynolds, Optimization algorithms for automatic history matching of production data, in: Proc. of the 8th European Conference on the Mathematics of Oil Recovery (2002).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rodrigues, J.R.P. Calculating derivatives for automatic history matching. Comput Geosci 10, 119–136 (2006). https://doi.org/10.1007/s10596-005-9013-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10596-005-9013-3