arXiv subjects

Olena Burkovska

Publications and source records attributed to Olena Burkovska.

12 recordsLinked to original sources

arXiv2026

Uncertainty Quantification for Quantum Computing

This review is designed to introduce mathematicians and computational scientists to quantum computing (QC) through the lens of uncertainty quantification (UQ) by presenting a mathematically rigorous and accessible narrative for understanding how noise and intrinsic randomness shape quantum computational outcomes in the language of mathematics. By grounding quantum computation in statistical inference, we highlight how mathematical tools such as probabilistic modeling, stochastic analysis, Bayesian inference, and sensitivity analysis, can directly address error propagation and reliability challenges in today's quantum devices. We also connect these methods to key scientific priorities in the field, including scalable uncertainty-aware algorithms and characterization of correlated errors. The purpose is to narrow the conceptual divide between applied mathematics, scientific computing and quantum information sciences, demonstrating how mathematically rooted UQ methodologies can guide validation, error mitigation, and principled algorithm design for emerging quantum technologies, in order to address challenges and opportunities present in modern-day quantum high performance and fault-tolerant quantum computing paradigms.

quant-ph↗

arXiv2024

An End-to-End Deep Learning Method for Solving Nonlocal Allen-Cahn and Cahn-Hilliard Phase-Field Models

We propose an efficient end-to-end deep learning method for solving nonlocal Allen-Cahn (AC) and Cahn-Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, structure-preserving properties, predictive capabilities, and cost reductions of the proposed method.

cs.LG↗

arXiv2024

An efficient proximal-based approach for solving nonlocal Allen-Cahn equations

In this work, we present an efficient approach for the spatial and temporal discretization of the nonlocal Allen-Cahn equation, which incorporates various double-well potentials and an integrable kernel, with a particular focus on a non-smooth obstacle potential. While nonlocal models offer enhanced flexibility for complex phenomena, they often lead to increased computational costs and there is a need to design efficient spatial and temporal discretization schemes, especially in the non-smooth setting. To address this, we propose first- and second-order energy-stable time-stepping schemes combined with the Fourier collocation approach for spatial discretization. We provide energy stability estimates for the developed time-stepping schemes. A key aspect to our approach involves a representation of a solution via proximal operators. This together with the spatial and temporal discretizations enables direct evaluation of the solution that can bypass the solution of nonlinear, non-smooth, and nonlocal system. This method significantly improves computational efficiency, especially in the case of non-smooth obstacle potentials, and facilitates rapid solution evaluations in both two and three dimensions. We provide several numerical experiments for isothermal and non-isothermal nonlocal Allen-Cahn systems to illustrate the effectiveness of our approach.

math.NA↗

arXiv2023

Multifidelity Methods for Uncertainty Quantification of a Nonlocal Model for Phase Changes in Materials

This study is devoted to the construction of a multifidelity Monte Carlo (MFMC) method for the uncertainty quantification of a nonlocal, non-mass-conserving Cahn-Hilliard model for phase transitions with an obstacle potential. We are interested in the estimation of the expected value of an output of interest (OoI) that depends on the solution of the nonlocal Cahn-Hilliard model. As opposed to its local counterpart, the nonlocal model captures sharp interfaces without the need for significant mesh refinement. However, the computational cost of the nonlocal Cahn-Hilliard model is higher than that of its local counterpart with similar mesh refinement, inhibiting its use for outer-loop applications such as uncertainty quantification. The MFMC method augments the desired high-fidelity, high-cost OoI with a set of lower-fidelity, lower-cost OoIs to alleviate the computational burden associated with nonlocality. Most of the computational budget is allocated to sampling the cheap surrogate models to achieve speedup, whereas the high-fidelity model is sparsely sampled to maintain accuracy. For the non-mass-conserving nonlocal Cahn-Hilliard model, the use of the MFMC method results in, for a given computational budget, about one-order-of-magnitude reduction in the mean-squared error of the expected value of the OoI relative to that of the Monte Carlo method.

cs.CE↗

arXiv2023

Non-isothermal nonlocal phase-field models with a double-obstacle potential

Phase-field models are a popular choice in computational physics to describe complex dynamics of substances with multiple phases and are widely used in various applications. We present nonlocal non-isothermal phase-field models of Cahn-Hilliard and Allen-Cahn types involving a nonsmooth double-well obstacle potential. Mathematically, in a weak form, the model translates to a system of variational inequalities coupled to a temperature evolution equation. We demonstrate that under certain conditions and with a careful choice of the nonlocal operator one can obtain a model that allows for sharp interfaces in the solution that evolve in time, which is a desirable property in many applications. This can be contrasted to the diffuse-interface local models that can not resolve sharp interfaces. We present the well-posedness analysis of the models, discuss an appropriate numerical discretization scheme, and supplement our findings with several numerical experiments.

math.AP↗

arXiv2021

On a nonlocal Cahn-Hilliard model permitting sharp interfaces

A nonlocal Cahn-Hilliard model with a nonsmooth potential of double-well obstacle type that promotes sharp interfaces in the solution is presented. To capture long-range interactions between particles, a nonlocal Ginzburg-Landau energy functional is defined which recovers the classical (local) model for vanishing nonlocal interactions. In contrast to the local Cahn-Hilliard problem that always leads to diffuse interfaces, the proposed nonlocal model can lead to a strict separation into pure phases of the substance. Here, the lack of smoothness of the potential is essential to guarantee the aforementioned sharp-interface property. Mathematically, this introduces additional inequality constraints that, in a weak form, lead to a coupled system of variational inequalities which at each time instance can be restated as a constrained optimization problem. We prove the well-posedness and regularity of the semi-discrete and continuous in time weak solutions, and derive the conditions under which pure phases are admitted. Moreover, we develop discretizations of the problem based on finite elements and implicit-explicit time stepping methods that can be realized efficiently. Finally, we illustrate our theoretical findings through several numerical experiments in one and two spatial dimensions that highlight the differences in features of local and nonlocal solutions and also the sharp interface properties of the nonlocal model.

math.AP↗

arXiv2020

An optimization-based approach to parameter learning for fractional type nonlocal models

Nonlocal operators of fractional type are a popular modeling choice for applications that do not adhere to classical diffusive behavior; however, one major challenge in nonlocal simulations is the selection of model parameters. In this work we propose an optimization-based approach to parameter identification for fractional models with an optional truncation radius. We formulate the inference problem as an optimal control problem where the objective is to minimize the discrepancy between observed data and an approximate solution of the model, and the control variables are the fractional order and the truncation length. For the numerical solution of the minimization problem we propose a gradient-based approach, where we enhance the numerical performance by an approximation of the bilinear form of the state equation and its derivative with respect to the fractional order. Several numerical tests in one and two dimensions illustrate the theoretical results and show the robustness and applicability of our method.

math.OC↗

arXiv2019

Affine approximation of parametrized kernels and model order reduction for nonlocal and fractional Laplace models

We consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $δ> 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. In order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $δ$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

math.NA↗

arXiv2018

Regularity and approximation analyses of nonlocal variational equality and inequality problems

We consider linear and obstacle problems driven by a nonlocal integral operator, for which nonlocal interactions are restricted to a ball of finite radius. These type of operators are used to model anomalous diffusion and, for a special choice of the integral kernels, reduce to the fractional Laplace operator on a bounded domain. By means of a nonlocal vector calculus we recast the problems in a weak form, leading to corresponding nonlocal variational equality and inequality problems. We prove optimal regularity results for both problems, including a higher regularity of the solution and the Lagrange multiplier. Based on the regularity results, we analyze the convergence of finite element approximations for a linear problem and illustrate the theoretical findings by numerical results.

math.NA↗

arXiv2016

Model reduction for calibration of American options

American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational inequality is obtained. We use the Heston stochastic volatility model to describe the price of a single stock option. In order to speed up the calibration process, we apply two model reduction strategies. Firstly, a reduced basis method (RBM) is used to define a suitable low-dimensional basis for the numerical approximation of the parameter-dependent partial differential equation ($\mu$PDE) model. By doing so the computational complexity for solving the $\mu$PDE is drastically reduced, and applications of standard minimization algorithms for the calibration are significantly faster than working with a high-dimensional finite element basis. Secondly, so-called de-Americanization strategies are applied. Here, the main idea is to reformulate the calibration problem for American options as a problem for European options and to exploit closed-form solutions. Both reduction techniques are systematically compared and tested for both synthetic and market data sets.

math.NA↗

arXiv2016

Calibration to American Options: Numerical Investigation of the de-Americanization

American options are the reference instruments for the model calibration of a large and important class of single stocks. For this task, a fast and accurate pricing algorithm is indispensable. The literature mainly discusses pricing methods for American options that are based on Monte Carlo, tree and partial differential equation methods. We present an alternative approach that has become popular under the name de-Americanization in the financial industry. The method is easy to implement and enjoys fast run-times. Since it is based on ad hoc simplifications, however, theoretical results guaranteeing reliability are not available. To quantify the resulting methodological risk, we empirically test the performance of the de-Americanization method for calibration. We classify the scenarios in which de-Americanization performs very well. However, we also identify the cases where de-Americanization oversimplifies and can result in large errors.

q-fin.CP↗

arXiv2014

Reduced basis methods for pricing options with the Black-Scholes and Heston model

In this paper, we present a reduced basis method for pricing European and American options based on the Black-Scholes and Heston model. To tackle each model numerically, we formulate the problem in terms of a time dependent variational equality or inequality. We apply a suitable reduced basis approach for both types of options. The characteristic ingredients used in the method are a combined POD-Greedy and Angle-Greedy procedure for the construction of the primal and dual reduced spaces. Analytically, we prove the reproduction property of the reduced scheme and derive a posteriori error estimators. Numerical examples are provided, illustrating the approximation quality and convergence of our approach for the different option pricing models. Also, we investigate the reliability and effectivity of the error estimators.

math.NA↗