Search arXiv⌕ Search

arXiv · 0708.1758

Vanishing moment method and moment solutions for second order fully nonlinear partial differential equations

Abstract

This paper concerns with numerical approximations of solutions of second order fully nonlinear partial differential equations (PDEs). A new notion of weak solutions, called moment solutions, is introduced for second order fully nonlinear PDEs. Unlike viscosity solutions, moment solutions are defined by a constructive method, called vanishing moment method, hence, they can be readily computed by existing numerical methods such as finite difference, finite element, spectral Galerkin, and discontinuous Galerkin methods with "guaranteed" convergence. The main idea of the proposed vanishing moment method is to approximate a second order fully nonlinear PDE by a higher order, in particular, a fourth order quasilinear PDE. We show by various numerical experiments the viability of the proposed vanishing moment method. All our numerical experiments show the convergence of the vanishing moment method, and they also show that moment solutions coincide with viscosity solutions whenever the latter exist.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaobing Feng, Michael Neilan. 2007-08-13. Vanishing moment method and moment solutions for second order fully nonlinear partial differential equations. https://arxiv.org/abs/0708.1758

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

KEEP EXPLORING

Related papers

Kernel-based collocation methods for Zakai equations

We analyze kernel-based interpolation methods for numerical solutions of Zakai equations in nonlinear filtering. The stability of the spatial discretization is quantified by row sums of the discrete differential operators. The resulting mean-square error estimate separates the one-step consistency error from its finite-time amplification and yields convergence when these two quantities balance. A short finite-resolution example illustrates the performance of a postprocessed interpolant.

math.NA↗

Lattice-based kernel approximation and serendipitous weights for parametric PDEs in very high dimensions

We describe a fast method for solving elliptic partial differential equations (PDEs) with uncertain coefficients using kernel interpolation at a lattice point set. By representing the input random field of the system using the model proposed by Kaarnioja, Kuo, and Sloan (SIAM J. Numer. Anal. 2020), in which a countable number of independent random variables enter the random field as periodic functions, it was shown by Kaarnioja, Kazashi, Kuo, Nobile, and Sloan (Numer. Math. 2022) that the lattice-based kernel interpolant can be constructed for the PDE solution as a function of the stochastic variables in a highly efficient manner using fast Fourier transform (FFT). In this work, we discuss the connection between our model and the popular "affine and uniform model" studied widely in the literature of uncertainty quantification for PDEs with uncertain coefficients. We also propose a new class of weights entering the construction of the kernel interpolant $-$ serendipitous weights $-$ which dramatically improve the computational performance of the kernel interpolant for PDE problems with uncertain coefficients, and allow us to tackle function approximation problems up to very high dimensionalities. Numerical experiments are presented to showcase the performance of the serendipitous weights.

math.NA↗

Enhanced randomized Douglas-Rachford method for linear systems: Improved probabilities and adaptive momentum

Randomized iterative methods have gained recent interest in machine learning and signal processing for solving large-scale linear systems. One such example is the randomized Douglas-Rachford (RDR) method, which updates the iterate by reflecting it through two randomly selected hyperplanes and taking a convex combination with the current point. In this work, we enhance RDR by introducing improved sampling strategies and an adaptive heavy-ball momentum scheme. Specifically, we incorporate without-replacement sampling and volume sampling into RDR and establish linear convergence in expectation for both schemes. For without-replacement sampling, we further establish a larger one-step descent than that of conventional RDR. For volume sampling, the convergence rate explicitly incorporates geometric information, and a tighter comparison with RDR is obtained under additional structural assumptions. Furthermore, we develop an adaptive momentum mechanism that determines the relaxation and momentum parameters directly from the iteration information without manual tuning. We establish linear convergence in expectation for the resulting method. Numerical experiments demonstrate the effectiveness of the proposed methods across a range of problem settings.

math.NA↗