arXiv subjects

Yanzhao Cao

Publications and source records attributed to Yanzhao Cao.

30 records · Page 2Linked to original sources

arXiv2022

A probabilistic scheme for semilinear nonlocal diffusion equations with volume constraints

This work presents a probabilistic scheme for solving semilinear nonlocal diffusion equations with volume constraints and integrable kernels. The nonlocal model of interest is defined by a time-dependent semilinear partial integro-differential equation (PIDE), in which the integro-differential operator consists of both local convection-diffusion and nonlocal diffusion operators. Our numerical scheme is based on the direct approximation of the nonlinear Feynman-Kac formula that establishes a link between nonlinear PIDEs and stochastic differential equations. The exploitation of the Feynman-Kac representation successfully avoids solving dense linear systems arising from nonlocality operators. Compared with existing stochastic approaches, our method can achieve first-order convergence after balancing the temporal and spatial discretization errors, which is a significant improvement of existing probabilistic/stochastic methods for nonlocal diffusion problems. Error analysis of our numerical scheme is established. The effectiveness of our approach is shown in two numerical examples. The first example considers a three-dimensional nonlocal diffusion equation to numerically verify the error analysis results. The second example presents a physics problem motivated by the study of heat transport in magnetically confined fusion plasmas.

math.NA↗

arXiv2022

Fast and accurate domain decomposition methods for reduced fracture models with nonconforming time grids

This paper is concerned with the numerical solution of compressible fluid flow in a fractured porous medium. The fracture represents a fast pathway (i.e., with high permeability) and is modeled as a hypersurface embedded in the porous medium. We aim to develop fast-convergent and accurate global-in-time domain decomposition (DD) methods for such a reduced fracture model, in which smaller time step sizes in the fracture can be coupled with larger time step sizes in the subdomains. Using the pressure continuity equation and the tangential PDEs in the fracture-interface as transmission conditions, three different DD formulations are derived; each method leads to a space-time interface problem which is solved iteratively and globally in time. Efficient preconditioners are designed to accelerate the convergence of the iterative methods while preserving the accuracy in time with nonconforming grids. Numerical results for two-dimensional problems with non-immersed and partially immersed fractures are presented to show the improved performance of the proposed methods.

math.NA↗

arXiv2021

Adaptive Gradient Descent for Optimal Control of Parabolic Equations with Random Parameters

In this paper we extend the adaptive gradient descent (AdaGrad) algorithm to the optimal distributed control of parabolic partial differential equations with uncertain parameters. This stochastic optimization method achieves an improved convergence rate through adaptive scaling of the gradient step size. We prove the convergence of the algorithm for this infinite dimensional problem under suitable regularity, convexity, and finite variance conditions, and relate these to verifiable properties of the underlying system parameters. Finally, we apply our algorithm to the optimal thermal regulation of lithium battery systems under uncertain loads.

math.OC↗

arXiv2021

A Backward SDE Method for Uncertainty Quantification in Deep Learning

We develop a probabilistic machine learning method, which formulates a class of stochastic neural networks by a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced under the stochastic maximum principle framework. Numerical experiments for applications of stochastic neural networks are carried out to validate the effectiveness of our methodology.

cs.LG↗

arXiv2021

Solving Backward Doubly Stochastic Differential Equations through Splitting Schemes

A splitting scheme for backward doubly stochastic differential equations is proposed. The main idea is to decompose a backward doubly stochastic differential equation into a backward stochastic differential equation and a stochastic differential equation. The backward stochastic differential equation and the stochastic differential equation are then approximated by first order finite difference schemes, which results in a first order scheme for the backward doubly stochastic differential equation. Numerical experiments are conducted to illustrate the convergence rate of the proposed scheme.

math.NA↗

arXiv2020

Well-posedness and Finite Element Approximations for Elliptic SPDEs with Gaussian Noises

The paper studies the well-posedness and optimal error estimates of spectral finite element approximations for the boundary value problems of semi-linear elliptic SPDEs driven by white or colored Gaussian noises. The noise term is approximated through the spectral projection of the covariance operator, which is not required to be commutative with the Laplacian operator. Through the convergence analysis of SPDEs with the noise terms replaced by the projected noises, the well-posedness of the SPDE is established under certain covariance operator-dependent conditions. These SPDEs with projected noises are then numerically approximated with the finite element method. A general error estimate framework is established for the finite element approximations. Based on this framework, optimal error estimates of finite element approximations for elliptic SPDEs driven by power-law noises are obtained. It is shown that with the proposed approach, convergence order of white noise driven SPDEs is improved by half for one-dimensional problems, and by an infinitesimal factor for higher-dimensional problems.

math.NA↗

arXiv2020

Analysis of the Stochastic Alternating Least Squares Method for the Decomposition of Random Tensors

Stochastic Alternating Least Squares (SALS) is a method that approximates the canonical decomposition of averages of sampled random tensors. Its simplicity and efficient memory usage make SALS an ideal tool for decomposing tensors in an online setting. We show, under mild regularization and readily verifiable assumptions on the boundedness of the data, that the SALS algorithm is globally convergent. Numerical experiments validate our theoretical findings and demonstrate the algorithm's performance and complexity.

math.NA↗

arXiv2017

Forward Backward Doubly Stochastic Differential Equations and the Optimal Filtering of Diffusion Processes

The connection between forward backward doubly stochastic differential equations and the optimal filtering problem is established without using the Zakai's equation. The solutions of forward backward doubly stochastic differential equations are expressed in terms of conditional law of a partially observed Markov diffusion process. It then follows that the adjoint time-inverse forward backward doubly stochastic differential equations governs the evolution of the unnormalized filtering density in the optimal filtering problem.

math.PR↗

arXiv2017

Approximating Stochastic Evolution Equations with Additive White and Rough Noises

In this paper, we analyze Galerkin approximations for stochastic evolution equations driven by an additive Gaussian noise which is temporally white and spatially fractional with Hurst index less than or equal to $1/2$. First we regularize the noise by the Wong-Zakai approximation and obtain its optimal order of convergence. Then we apply the Galerkin method to discretize the stochastic evolution equations with regularized noises. Optimal error estimates are obtained for the Galerkin approximations. In particular, our error estimates remove an infinitesimal factor which appears in the error estimates of various numerical methods for stochastic evolution equations in existing literatures.

math.NA↗

arXiv2017

Finite element approximations for second order stochastic differential equation driven by fractional Brownian motion

We consider finite element approximations for a one dimensional second order stochastic differential equation of boundary value type driven by a fractional Brownian motion with Hurst index $H\le 1/2$. We make use of a sequence of approximate solutions with the fractional noise replaced by its piecewise con- stant approximations to construct the finite element approximations for the equation. The error estimate of the approximations is derived through rigorous convergence analysis.

math.NA↗

arXiv2015

An Efficient Meshfreee Implicit Filter for Nonlinear Filtering Problems

In this paper, we propose a meshfree approximation method for the implicit filter developed in [2], which is a novel numerical algorithm for nonlinear filtering problems. The implicit filter approximates conditional distributions in the optimal filter over a deterministic state space grid and is developed from samples of the current state obtained by solving the state equation implicitly. The purpose of the meshfree approximation is to improve the efficiency of the implicit filter in moderately high-dimensional problems. The construction of the algorithm includes generation of random state space points and a meshfree interpolation method. Numerical experiments show the effectiveness and efficiency of our algorithm.

math.NA↗

arXiv2004

First-principles calculations for the adsorption of water molecules on the Cu(100) surface

First-principles density-functional theory and supercell models are employed to calculate the adsorption of water molecules on the Cu(100) surface. In agreement with the experimental observations, the calculations show that a H2O molecule prefers to bond at a one-fold on-top (T1) surface site with a tilted geometry. At low temperatures, rotational diffusion of the molecular axis of the water molecules around the surface normal is predicted to occur at much higher rates than lateral diffusion of the molecules. In addition, the calculated binding energy of an adsorbed water molecule on the surfaces is significantly smaller than the water sublimation energy, indicating a tendency for the formation of water clusters on the Cu(100) surface.

cond-mat.mtrl-sci↗