Searcharxiv⌕ Search

arXiv subjects

Kjetil Olsen Lye

Publications and source records attributed to Kjetil Olsen Lye.

5 recordsLinked to original sources

Benchmarking CO$_2$ Storage Simulations: Results from the 11th Society of Petroleum Engineers Comparative Solution Project

The 11th Society of Petroleum Engineers Comparative Solution Project (shortened SPE11 herein) benchmarked simulation tools for geological carbon dioxide (CO$_2$) storage. A total of 45 groups from leading research institutions and industry across the globe signed up to participate, with 18 ultimately contributing valid results that were included in the comparative study reported here. This paper summarizes the SPE11. A comprehensive introduction and qualitative discussion of the submitted data are provided, together with an overview of online resources for accessing the full depth of data. A global metric for analyzing the relative distance between submissions is proposed and used to conduct a quantitative analysis of the submissions. This analysis attempts to statistically resolve the key aspects influencing the variability between submissions. The study shows that the major qualitative variation between the submitted results is related to thermal effects, dissolution-driven convective mixing, and resolution of facies discontinuities. Moreover, a strong dependence on grid resolution is observed across all three versions of the SPE11. However, our quantitative analysis suggests that the observed variations are predominantly influenced by factors not documented in the technical responses provided by the participants. We therefore identify that unreported variations due to human choices within the process of setting up, conducting, and reporting on the simulations underlying each SPE11 submission are at least as impactful as the computational choices reported.

physics.geo-ph↗

Pseudo-Hamiltonian neural networks for learning partial differential equations

Pseudo-Hamiltonian neural networks (PHNN) were recently introduced for learning dynamical systems that can be modelled by ordinary differential equations. In this paper, we extend the method to partial differential equations. The resulting model is comprised of up to three neural networks, modelling terms representing conservation, dissipation and external forces, and discrete convolution operators that can either be learned or be given as input. We demonstrate numerically the superior performance of PHNN compared to a baseline model that models the full dynamics by a single neural network. Moreover, since the PHNN model consists of three parts with different physical interpretations, these can be studied separately to gain insight into the system, and the learned model is applicable also if external forces are removed or changed.

cs.LG↗

Constrained mixers for the quantum approximate optimization algorithm

The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most literature is limited to quadratic problems without constraints. However, many practically relevant optimization problems do have (hard) constraints that need to be fulfilled. In this article, we present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space given by these constraints; We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. We expose the underlying mathematical structure which reveals more of how mixers work and how one can minimize their cost in terms of number of CX gates, particularly when Trotterization is taken into account. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date. In view of practical implementations, we also describe algorithms for efficient decomposition into basis gates. Several examples of more general cases are presented and analyzed.

quant-ph↗

Convergence rates of monotone schemes for conservation laws for data with unbounded total variation

We prove convergence rates of monotone schemes for conservation laws for Hölder continuous initial data with unbounded total variation, provided that the Hölder exponent of the initial data is greater than $1/2$. For strictly $\mathrm{Lip}^+$ stable monotone schemes, we prove convergence for any positive Hölder exponent. Numerical experiments are presented which verify the theory.

math.NA↗

Multilevel Monte-Carlo for measure valued solutions

We propose a Multilevel Monte-Carlo (MLMC) method for computing entropy measure valued solutions of hyperbolic conservation laws. Sharp bounds for the narrow convergence of MLMC for the entropy measure valued solutions are proposed. An optimal work-vs-error bound for the MLMC method is derived assuming only an abstract decay criterion on the variance. Finally, we display numerical experiments of cases where MLMC is, and is not, efficient when compared to Monte-Carlo.

math.NA↗