Greedy Kernel Methods for Approximating Breakthrough Curves for Reactive Flow from 3D Porous Geometry Data

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Herkert, Robin, Buchfink, Patrick, Wenzel, Tizian, Haasdonk, Bernard, Toktaliev, Pavel, Iliev, Oleg
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929364344504320
author Herkert, Robin
Buchfink, Patrick
Wenzel, Tizian
Haasdonk, Bernard
Toktaliev, Pavel
Iliev, Oleg
author_facet Herkert, Robin
Buchfink, Patrick
Wenzel, Tizian
Haasdonk, Bernard
Toktaliev, Pavel
Iliev, Oleg
contents We address the challenging application of 3D pore scale reactive flow under varying geometry parameters. The task is to predict time-dependent integral quantities, i.e., breakthrough curves, from the given geometries. As the 3D reactive flow simulation is highly complex and computationally expensive, we are interested in data-based surrogates that can give a rapid prediction of the target quantities of interest. This setting is an example of an application with scarce data, i.e., only having available few data samples, while the input and output dimensions are high. In this scarce data setting, standard machine learning methods are likely to ail. Therefore, we resort to greedy kernel approximation schemes that have shown to be efficient meshless approximation techniques for multivariate functions. We demonstrate that such methods can efficiently be used in the high-dimensional input/output case under scarce data. Especially, we show that the vectorial kernel orthogonal greedy approximation (VKOGA) procedure with a data-adapted two-layer kernel yields excellent predictors for learning from 3D geometry voxel data via both morphological descriptors or principal component analysis.
format Preprint
id arxiv_https___arxiv_org_abs_2405_19170
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Greedy Kernel Methods for Approximating Breakthrough Curves for Reactive Flow from 3D Porous Geometry Data
Herkert, Robin
Buchfink, Patrick
Wenzel, Tizian
Haasdonk, Bernard
Toktaliev, Pavel
Iliev, Oleg
Numerical Analysis
We address the challenging application of 3D pore scale reactive flow under varying geometry parameters. The task is to predict time-dependent integral quantities, i.e., breakthrough curves, from the given geometries. As the 3D reactive flow simulation is highly complex and computationally expensive, we are interested in data-based surrogates that can give a rapid prediction of the target quantities of interest. This setting is an example of an application with scarce data, i.e., only having available few data samples, while the input and output dimensions are high. In this scarce data setting, standard machine learning methods are likely to ail. Therefore, we resort to greedy kernel approximation schemes that have shown to be efficient meshless approximation techniques for multivariate functions. We demonstrate that such methods can efficiently be used in the high-dimensional input/output case under scarce data. Especially, we show that the vectorial kernel orthogonal greedy approximation (VKOGA) procedure with a data-adapted two-layer kernel yields excellent predictors for learning from 3D geometry voxel data via both morphological descriptors or principal component analysis.
title Greedy Kernel Methods for Approximating Breakthrough Curves for Reactive Flow from 3D Porous Geometry Data
topic Numerical Analysis
url https://arxiv.org/abs/2405.19170