SearcharxivSearch

arXiv · 2201.04827

Approximation of a degenerate semilinear PDEs with a nonlinear Neumann boundary condition

Abstract

We consider a system of semilinear partial differential equations (PDEs) with a nonlinearity depending on both the solution and its gradient. The Neumann boundary condition depends on the solution in a nonlinear manner. The uniform ellipticity is not required to the diffusion coefficient. We show that this problem admits a viscosity solution which can be approximated by a penalization. The Lipschitz condition is required to the coefficients of the diffusion part. The nonlinear part as well as the Neumann condition are Lipschitz. Moreover, the nonlinear part is assumed monotone in the solution variable. Note that the existence of a viscosity solution to this problem has been established in [13] then completed in [15]. In the present paper, We construct a sequence of penalized system of decoupled forward backward stochastic differential equations (FBSDEs) then we directly show its strong convergence. This allows us to deal with the case where the nonlinearity depends on both the solution and its gradient. Our work extends, in particular, the result of [4] and, in some sense, those of [1, 3]. In contrast to works [1, 3, 4], we do not pass by the weak compactness of the laws of the stochastic system associated to our problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Khaled Bahlali, Brahim Boufoussi, Soufiane Mouchtabih. 2022-01-13. Approximation of a degenerate semilinear PDEs with a nonlinear Neumann boundary condition. https://arxiv.org/abs/2201.04827

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR