We propose a state redistribution method for high order discontinuous Galerkin methods on curvilinear embedded boundary grids. State redistribution relaxes the overly restrictive CFL condition that results from arbitrarily small cut cells and explicit time stepping. Thus, the scheme can take time steps that are proportional to the size of cells in the background grid. The discontinuous Galerkin scheme is stabilized by postprocessing the numerical solution after each stage or step of an explicit time stepping method. This is done by temporarily merging the small cells into larger, possibly overlapping neighborhoods using a special weighted inner product. Then, the numerical solution on the neighborhoods is returned to the base grid in a conservative fashion. The advantage of this approach is that it uses only basic mesh information that is already available in many cut cell codes and does not require complex geometric manipulations. Finally, we present a number of test problems that demonstrate the encouraging potential of this technique for applications on curvilinear embedded geometries. Numerical experiments reveal that our scheme converges with order $p+1$ in $L_1$ and between $p$ and $p+1$ in $L_\infty$ for problems with smooth solutions. We also demonstrate that state redistribution is capable of capturing shocks.
This paper applies a discontinuous Galerkin finite element method to the Kelvin-Voigt viscoelastic fluid motion equations when the forcing function is in $L^\infty({\bf L}^2)$-space. Optimal a priori error estimates in $L^\infty({\bf L}^2)$-norm for the velocity and in $L^\infty(L^2)$-norm for the pressure approximations for the semi-discrete discontinuous Galerkin method are derived here. The main ingredients for establishing the error estimates are the standard elliptic duality argument and a modified version of the Sobolev-Stokes operator defined on appropriate broken Sobolev spaces. Further, under the smallness assumption on the data, it has been proved that these estimates are valid uniformly in time. Then, a first-order accurate backward Euler method is employed to discretize the semi-discrete discontinuous Galerkin Kelvin-Voigt formulation completely. The fully discrete optimal error estimates for the velocity and pressure are established. Finally, using the numerical experiments, theoretical results are verified. It is worth highlighting here that the error results in this article for the discontinuous Galerkin method applied to the Kelvin-Voigt model using finite element analysis are the first attempt in this direction.
In our previous work [SIAM J. Sci. Comput. 43(3) (2021) B784-B810], an accurate hyper-singular boundary integral equation method for dynamic poroelasticity in two dimensions has been developed. This work is devoted to studying the more complex and difficult three-dimensional problems with Neumann boundary condition and both the direct and indirect methods are adopted to construct combined boundary integral equations. The strongly-singular and hyper-singular integral operators are reformulated into compositions of weakly-singular integral operators and tangential-derivative operators, which allow us to prove the jump relations associated with the poroelastic layer potentials and boundary integral operators in a simple manner. Relying on both the investigated spectral properties of the strongly-singular operators, which indicate that the corresponding eigenvalues accumulate at three points whose values are only dependent on two Lam\'e constants, and the spectral properties of the Calder\'on relations of the poroelasticity, we propose low-GMRES-iteration regularized integral equations. Numerical examples are presented to demonstrate the accuracy and efficiency of the proposed methodology by means of a Chebyshev-based rectangular-polar solver.
A singularly perturbed parabolic problem of convection-diffusion type with a discontinuous initial condition is examined. A particular complimentary error function is identified which matches the discontinuity in the initial condition. The difference between this analytical function and the solution of the parabolic problem is approximated numerically. A co-ordinate transformation is used so that a layer-adapted mesh can be aligned to the interior layer present in the solution. Numerical analysis is presented for the associated numerical method, which establishes that the numerical method is a parameter-uniform numerical method. Numerical results are presented to illustrate the pointwise error bounds established in the paper.
In this paper, we propose Nesterov Accelerated Shuffling Gradient (NASG), a new algorithm for the convex finite-sum minimization problems. Our method integrates the traditional Nesterov's acceleration momentum with different shuffling sampling schemes. We show that our algorithm has an improved rate of $\mathcal{O}(1/T)$ using unified shuffling schemes, where $T$ is the number of epochs. This rate is better than that of any other shuffling gradient methods in convex regime. Our convergence analysis does not require an assumption on bounded domain or a bounded gradient condition. For randomized shuffling schemes, we improve the convergence bound further. When employing some initial condition, we show that our method converges faster near the small neighborhood of the solution. Numerical simulations demonstrate the efficiency of our algorithm.
This work analyzes a high order hybridizable discontinuous Galerkin (HDG) method for the linear elasticity problem in a domain not necessarily polyhedral. The domain is approximated by a polyhedral computational domain where the HDG solution can be computed. The introduction of the rotation as one of the unknowns allows us to use the gradient of the displacements to obtain an explicit representation of the boundary data in the computational domain. The boundary data is transferred from the true boundary to the computational boundary by line integrals, where the integrand depends on the Cauchy stress tensor and the rotation. Under closeness assumptions between the computational and true boundaries, the scheme is shown to be well-posed and optimal error estimates are provided even in the nearly incompressible. Numerical experiments in two-dimensions are presented.
In this paper, we characterize data-time tradeoffs of the proximal-gradient homotopy method used for solving linear inverse problems under sub-Gaussian measurements. Our results are sharp up to an absolute constant factor. We demonstrate that, in the absence of the strong convexity assumption, the proximal-gradient homotopy update can achieve a linear rate of convergence when the number of measurements is sufficiently large. Numerical simulations are provided to verify our theoretical results.
In this article, we have considered a nonlinear nonlocal time dependent fourth order equation demonstrating the deformation of a thin and narrow rectangular plate. We propose $C^1$ conforming virtual element method (VEM) of arbitrary order, $k\ge2$, to approximate the model problem numerically. We employ VEM to discretize the space variable and fully implicit scheme for temporal variable. Well-posedness of the fully discrete scheme is proved under certain conditions on the physical parameters, and we derive optimal order of convergence in both space and time variable. Finally, numerical experiments are presented to illustrate the behaviour of the proposed numerical scheme.
In this paper, we propose new geometrically unfitted space-time Finite Element methods for partial differential equations posed on moving domains of higher order accuracy in space and time. As a model problem, the convection-diffusion problem on a moving domain is studied. For geometrically higher order accuracy, we apply a parametric mapping on a background space-time tensor-product mesh. Concerning discretisation in time, we consider discontinuous Galerkin, as well as related continuous (Petrov-)Galerkin and Galerkin collocation methods. For stabilisation with respect to bad cut configurations and as an extension mechanism that is required for the latter two schemes, a ghost penalty stabilisation is employed. The article puts an emphasis on the techniques that allow to achieve a robust but higher order geometry handling for smooth domains. We investigate the computational properties of the respective methods in a series of numerical experiments. These include studies in different dimensions for different polynomial degrees in space and time, validating the higher order accuracy in both variables.
In this paper, we present a discontinuous Galerkin solver based on previous work by Markert et al. (2021) for magneto-hydrodynamics in form of a new fluid solver module integrated into the established and well-known multi-physics simulation code FLASH. Our goal is to enable future research on the capabilities and potential advantages of discontinuous Galerkin methods for complex multi-physics simulations in astrophysical settings. We give specific details and adjustments of our implementation within the FLASH framework and present extensive validations and test cases, specifically its interaction with several other physics modules such as (self-)gravity and radiative transfer. We conclude that the new DG solver module in FLASH is ready for use in astrophysics simulations and thus ready for assessments and investigations.
We present a continuous formulation of machine learning, as a problem in the calculus of variations and differential-integral equations, very much in the spirit of classical numerical analysis and statistical physics. We demonstrate that conventional machine learning models and algorithms, such as the random feature model, the shallow neural network model and the residual neural network model, can all be recovered as particular discretizations of different continuous formulations. We also present examples of new models, such as the flow-based random feature model, and new algorithms, such as the smoothed particle method and spectral method, that arise naturally from this continuous formulation. We discuss how the issues of generalization error and implicit regularization can be studied under this framework.