We explore the ability of the greedy algorithm to serve as an effective tool for the construction of reduced-order models for the solution of fully saturated groundwater flow in the presence of randomly distributed transmissivities. The use of a reduced model is particularly appealing in the context of numerical Monte Carlo (MC) simulations that are typically performed, e.g., within environmental risk assessment protocols. In this context, model order reduction techniques enable one to construct a surrogate model to reduce the computational burden associated with the solution of the partial differential equation governing the evolution of the system. These techniques approximate the model solution with a linear combination of spatially distributed basis functions calculated from a small set of full model simulations. The number and the spatial behavior of these basis functions determine the computational efficiency of the reduced model and the accuracy of the approximated solution. The greedy algorithm provides a deterministic procedure to select the basis functions and build the reduced-order model. Starting from a single basis function, the algorithm enriches the set of basis functions until the largest error between the full and the reduced model solutions is lower than a predefined tolerance. The comparison between the standard MC and the reduced-order approach is performed through a two-dimensional steady-state groundwater flow scenario in the presence of a uniform (in the mean) hydraulic head gradient. The natural logarithm of the aquifer transmissivity is modeled as a second-order stationary Gaussian random field. The accuracy of the reduced basis model is assessed as a function of the correlation scale and variance of the log-transmissivity. We explore the performance of the reduced model in terms of the number of iterations of the greedy algorithm and selected metrics quantifying the discrepancy between the sample distributions of hydraulic heads computed with the full and the reduced model. Our results show that the reduced model is accurate and is highly efficient in the presence of a small variance and/or a large correlation length of the log-transmissivity field. The flow scenarios associated with large variances and small correlation lengths require an increased number of basis functions to accurately describe the collection of the MC solutions, thus reducing significantly the computational advantages associated with the reduced model. © 2013 Springer Science+Business Media Dordrecht.

A reduced-order model for Monte Carlo simulations of stochastic groundwater flow

Pasetto D.
;
2014

Abstract

We explore the ability of the greedy algorithm to serve as an effective tool for the construction of reduced-order models for the solution of fully saturated groundwater flow in the presence of randomly distributed transmissivities. The use of a reduced model is particularly appealing in the context of numerical Monte Carlo (MC) simulations that are typically performed, e.g., within environmental risk assessment protocols. In this context, model order reduction techniques enable one to construct a surrogate model to reduce the computational burden associated with the solution of the partial differential equation governing the evolution of the system. These techniques approximate the model solution with a linear combination of spatially distributed basis functions calculated from a small set of full model simulations. The number and the spatial behavior of these basis functions determine the computational efficiency of the reduced model and the accuracy of the approximated solution. The greedy algorithm provides a deterministic procedure to select the basis functions and build the reduced-order model. Starting from a single basis function, the algorithm enriches the set of basis functions until the largest error between the full and the reduced model solutions is lower than a predefined tolerance. The comparison between the standard MC and the reduced-order approach is performed through a two-dimensional steady-state groundwater flow scenario in the presence of a uniform (in the mean) hydraulic head gradient. The natural logarithm of the aquifer transmissivity is modeled as a second-order stationary Gaussian random field. The accuracy of the reduced basis model is assessed as a function of the correlation scale and variance of the log-transmissivity. We explore the performance of the reduced model in terms of the number of iterations of the greedy algorithm and selected metrics quantifying the discrepancy between the sample distributions of hydraulic heads computed with the full and the reduced model. Our results show that the reduced model is accurate and is highly efficient in the presence of a small variance and/or a large correlation length of the log-transmissivity field. The flow scenarios associated with large variances and small correlation lengths require an increased number of basis functions to accurately describe the collection of the MC solutions, thus reducing significantly the computational advantages associated with the reduced model. © 2013 Springer Science+Business Media Dordrecht.
File in questo prodotto:
File Dimensione Formato  
article.pdf

accesso aperto

Descrizione: Articolo principale (bozza post-referaggio)
Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 2.12 MB
Formato Adobe PDF
2.12 MB Adobe PDF Visualizza/Apri

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10278/3722943
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 13
social impact