Generic tool for numerical simulation of transformation-diffusion processes in complex volume geometric shapes: application to microbial decomposition of organic matter

• URL: http://arxiv.org/abs/2110.03130v1
• Date: Thu, 7 Oct 2021 01:01:48 GMT
• Title: Generic tool for numerical simulation of transformation-diffusion processes in complex volume geometric shapes: application to microbial decomposition of organic matter
• Authors: Olivier Monga, Fr\'ed\'eric Hecht, Serge Moto, Bruno Mbe, Patricia Garnier, Val\'erie Pot
• Abstract summary: This paper presents a generic framework for the numerical simulation of transformation-diffusion processes in complex volume geometric shapes. We generalized and improved the MOSAIC method significantly and thus yielding a much more generic and efficient numerical simulation scheme.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents a generic framework for the numerical simulation of transformation-diffusion processes in complex volume geometric shapes. This work follows a previous one devoted to the simulation of microbial degradation of organic matter in porous system at microscopic scale. We generalized and improved the MOSAIC method significantly and thus yielding a much more generic and efficient numerical simulation scheme. In particular, regarding the simulation of diffusion processes from the graph, in this study we proposed a completely explicit and semi-implicit numerical scheme that can significantly reduce the computational complexity. We validated our method by comparing the results to the one provided by classical Lattice Boltzmann Method (LBM) within the context of microbial decomposition simulation. For the same datasets, we obtained similar results in a significantly shorter computing time (i.e., 10-15 minutes) than the prior work (several hours). Besides the classical LBM method takes around 3 weeks computing time.

Related papers

• A Voxel-based Approach for Simulating Microbial Decomposition in Soil: Comparison with LBM and Improvement of Morphological Models [0.0]
  This study presents a new computational approach for simulating the microbial decomposition of organic matter. The method employs a valuated graph of connected voxels to simulate transformation and diffusion processes. The resulting model can be adapted to simulate any diffusion-transformation processes in porous media.
  arXiv  Detail & Related papers  (2024-06-06T15:35:25Z)
• Mitigating distribution shift in machine learning-augmented hybrid simulation [15.37429773698171]
  We study the problem of distribution shift generally arising in machine-learning augmented hybrid simulation. We propose a simple methodology based on tangent-space regularized estimator to control the distribution shift. In all cases, we observe marked improvements in simulation accuracy under the proposed method.
  arXiv  Detail & Related papers  (2024-01-17T15:05:39Z)
• Application of machine learning technique for a fast forecast of aggregation kinetics in space-inhomogeneous systems [0.0]
  We show how to reduce the amount of direct computations with the use of modern machine learning (ML) techniques. We demonstrate that the ML predictions for the space distribution of aggregates and their size distribution requires drastically less computation time and agrees fairly well with the results of direct numerical simulations.
  arXiv  Detail & Related papers  (2023-12-07T19:50:40Z)
• A Novel Perspective Process Simulation Framework Based on Automatic Differentiation [0.0]
  We use state-of-the-art automatic differentiation frameworks for thermodynamic calculations to obtain precise derivatives without altering the logic of the algorithm. This contrasts with traditional numerical differentiation algorithms and significantly improves the convergence and computational efficiency of process simulations.
  arXiv  Detail & Related papers  (2023-11-18T17:37:33Z)
• An Efficient Algorithm for Clustered Multi-Task Compressive Sensing [60.70532293880842]
  Clustered multi-task compressive sensing is a hierarchical model that solves multiple compressive sensing tasks. The existing inference algorithm for this model is computationally expensive and does not scale well in high dimensions. We propose a new algorithm that substantially accelerates model inference by avoiding the need to explicitly compute these covariance matrices.
  arXiv  Detail & Related papers  (2023-09-30T15:57:14Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• A deep learning driven pseudospectral PCE based FFT homogenization algorithm for complex microstructures [68.8204255655161]
  It is shown that the proposed method is able to predict central moments of interest while being magnitudes faster to evaluate than traditional approaches. It is shown, that the proposed method is able to predict central moments of interest while being magnitudes faster to evaluate than traditional approaches.
  arXiv  Detail & Related papers  (2021-10-26T07:02:14Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Entropy Minimizing Matrix Factorization [102.26446204624885]
  Nonnegative Matrix Factorization (NMF) is a widely-used data analysis technique, and has yielded impressive results in many real-world tasks. In this study, an Entropy Minimizing Matrix Factorization framework (EMMF) is developed to tackle the above problem. Considering that the outliers are usually much less than the normal samples, a new entropy loss function is established for matrix factorization.
  arXiv  Detail & Related papers  (2021-03-24T21:08:43Z)
• A Comparative Study of Machine Learning Models for Predicting the State of Reactive Mixing [0.0]
  Accurate predictions of reactive mixing are critical for many Earth and environmental science problems. A high-fidelity, finite-element-based numerical model is built to solve the fast, irreversible bimolecular reaction-diffusion scenarios. A total of 2,315 simulations are performed using different sets of model input parameters.
  arXiv  Detail & Related papers  (2020-02-24T22:50:19Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.