Comparison of numerical methods for simulating strongly nonlinear and heterogeneous reactive transport problems-the MoMaS benchmark case

TitleComparison of numerical methods for simulating strongly nonlinear and heterogeneous reactive transport problems-the MoMaS benchmark case
Publication TypeJournal Article
Year of Publication2010
AuthorsCarrayrou J, Hoffmann J, Knabner P, Kraeutle S, de Dieuleveult C, Erhel J, van der Lee J, Lagneau V., Mayer K.U, MacQuarrie KTB
JournalCOMPUTATIONAL GEOSCIENCES
Volume14
Pagination483-502
Date PublishedJUN
ISSN1420-0597
Abstract

Although multicomponent reactive transport modeling is gaining wider application in various geoscience fields, it continues to present significant mathematical and computational challenges. There is a need to solve and compare the solutions to complex benchmark problems, using a variety of codes, because such intercomparisons can reveal promising numerical solution approaches and increase confidence in the application of reactive transport codes. In this contribution, the results and performance of five current reactive transport codes are compared for the 1D and 2D subproblems of the so-called easy test case of the MoMaS benchmark (Carrayrou et al., Comput Geosci, 2009, this issue). This benchmark presents a simple fictitious reactive transport problem that highlights the main numerical difficulties encountered in real reactive transport problems. As a group, the codes include iterative and noniterative operator splitting and global implicit solution approaches. The 1D easy advective and 1D easy diffusive scenarios were solved using all codes, and, in general, there was a good agreement, with solution discrepancies limited to regions with rapid concentration changes. Computational demands were typically consistent with what was expected for the various solution approaches. The differences between solutions given by the three codes solving the 2D problem are more important. The very high computing effort required by the 2D problem illustrates the importance of parallel computations. The most important outcome of the benchmark exercise is that all codes are able to generate comparable results for problems of significant complexity and computational difficulty.

DOI10.1007/s10596-010-9178-2