An official website of the United States government
Abstract We develop a stochastic Galerkin method for a coupled Navier-Stokes-cloud system that models dynamics of warm clouds. Our goal is to explicitly describe the evolution of uncertainties that arise due to unknown input data, such as model parameters and initial or boundary conditions. The developed stochastic Galerkin method combines the space-time approximation obtained by a suitable finite volume method with a spectral-type approximation based on the generalized polynomial chaos expansion in the stochastic space. The resulting numerical scheme yields a second-order accurate approximation in both space and time and exponential convergence in the stochastic space. Our numerical results demonstrate the reliability and robustness of the stochastic Galerkin method. We also use the proposed method to study the behavior of clouds in certain perturbed scenarios, for examples, the ones leading to changes in macroscopic cloud pattern as a shift from hexagonal to rectangular structures.
more »
« less
Convergence and optimality of an adaptive modified weak Galerkin finite element method
Abstract An adaptive modified weak Galerkin method (AmWG) for an elliptic problem is studied in this article, in addition to its convergence and optimality. The modified weak Galerkin bilinear form is simplified without the need of the skeletal variable, and the approximation space is chosen as the discontinuous polynomial space as in the discontinuous Galerkin method. Upon a reliable residual‐baseda posteriorierror estimator, an adaptive algorithm is proposed together with its convergence and quasi‐optimality proved for the lowest order case. The primary tool is to bridge the connection between the modified weak Galerkin method and the Crouzeix–Raviart nonconforming finite element. Unlike the traditional convergence analysis for methods with a discontinuous polynomial approximation space, the convergence of AmWG is penalty parameter free. Numerical results are presented to support the theoretical results.
more »
« less
- PAR ID:
- 10419734
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Numerical Methods for Partial Differential Equations
- Volume:
- 39
- Issue:
- 5
- ISSN:
- 0749-159X
- Page Range / eLocation ID:
- p. 3847-3873
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Trefftz methods are high-order Galerkin schemes in which all discrete functions are elementwise solution of the PDE to be approximated. They are viable only when the PDE is linear and its coefficients are piecewise-constant. We introduce a “quasi-Trefftz” discontinuous Galerkin (DG) method for the discretisation of the acoustic wave equation with piecewise-smooth material parameters: the discrete functions are elementwise approximate PDE solutions. We show that the new discretisation enjoys the same excellent approximation properties as the classical Trefftz one, and prove stability and high-order convergence of the DG scheme. We introduce polynomial basis functions for the new discrete spaces and describe a simple algorithm to compute them. The technique we propose is inspired by the generalised plane waves previously developed for time-harmonic problems with variable coefficients; it turns out that in the case of the time-domain wave equation under consideration the quasi-Trefftz approach allows for polynomial basis functions.more » « less
-
The analyses of interior penalty discontinuous Galerkin methods of any order k for solving elliptic and parabolic problems with Dirac line sources are presented. For the steady state case, we prove convergence of the method by deriving a priori error estimates in the L 2 norm and in weighted energy norms. In addition, we prove almost optimal local error estimates in the energy norm for any approximation order. Further, almost optimal local error estimates in the L 2 norm are obtained for the case of piecewise linear approximations whereas suboptimal error bounds in the L 2 norm are shown for any polynomial degree. For the time-dependent case, convergence of semi-discrete and of backward Euler fully discrete scheme is established by proving error estimates in L 2 in time and in space. Numerical results for the elliptic problem are added to support the theoretical results.more » « less
-
In this paper, we study ultra-weak discontinuous Galerkin methods with generalized numerical fluxes for multi-dimensional high order partial differential equations on both unstructured simplex and Cartesian meshes. The equations we consider as examples are the nonlinear convection-diffusion equation and the biharmonic equation. Optimal error estimates are obtained for both equations under certain conditions, and the key step is to carefully design global projections to eliminate numerical errors on the cell interface terms of ultra-weak schemes on general dimensions. The well-posedness and approximation capability of these global projections are obtained for arbitrary order polynomial space based on a wide class of generalized numerical fluxes on regular meshes. These projections can serve as general analytical tools to be naturally applied to a wide class of high order equations. Numerical experiments are conducted to demonstrate these theoretical results.more » « less
-
Abstract The inverse problem for radiative transfer is important in many applications, such as optical tomography and remote sensing. Major challenges include large memory requirements and computational expense, which arise from high-dimensionality and the need for iterations in solving the inverse problem. Here, to alleviate these issues, we propose adaptive-mesh inversion: a goal-orientedhp-adaptive mesh refinement method for solving inverse radiative transfer problems. One novel aspect here is that the two optimizations (one for inversion, and one for mesh adaptivity) are treated simultaneously and blended together. By exploiting the connection between duality-based mesh adaptivity and adjoint-based inversion techniques, we propose a goal-oriented error estimator, which is cheap to compute, and can efficiently guide the mesh-refinement to numerically solve the inverse problem. We use discontinuous Galerkin spectral element methods to discretize the forward and the adjoint problems. Then, based on the goal-oriented error estimator, we propose anhp-adaptive algorithm to refine the meshes. Numerical experiments are presented at the end and show convergence speed-up and reduced memory occupation by the goal-oriented mesh adaptive method.more » « less
