اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNumerical analysis of the LDG method for large deformations of prestrained plates
67
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A local discontinuous Galerkin (LDG) method for approximating large deformations of prestrained plates is introduced and tested on several insightful numerical examples in our previous computational work. This paper presents a numerical analysis of this LDG method, focusing on the free boundary case. The problem consists of minimizing a fourth order bending energy subject to a nonlinear and nonconvex metric constraint. The energy is discretized using LDG and a discrete gradient flow is used for computing discrete minimizers. We first show $Gamma$-convergence of the discrete energy to the continuous one. Then we prove that the discrete gradient flow decreases the energy at each step and computes discrete minimizers with control of the metric constraint defect. We also present a numerical scheme for initialization of the gradient flow, and discuss the conditional stability of it.
قيم البحث
اقرأ أيضاً
This paper provides an a~priori error analysis of a localized orthogonal decomposition method (LOD) for the numerical stochastic homogenization of a model random diffusion problem. If the uniformly elliptic and bounded random coefficient field of the
model problem is stationary and satisfies a quantitative decorrelation assumption in form of the spectral gap inequality, then the expected $L^2$ error of the method can be estimated, up to logarithmic factors, by $H+(varepsilon/H)^{d/2}$; $varepsilon$ being the small correlation length of the random coefficient and $H$ the width of the coarse finite element mesh that determines the spatial resolution. The proof bridges recent results of numerical homogenization and quantitative stochastic homogenization.
We consider the numerical analysis of the inchworm Monte Carlo method, which is proposed recently to tackle the numerical sign problem for open quantum systems. We focus on the growth of the numerical error with respect to the simulation time, for wh
ich the inchworm Monte Carlo method shows a flatter curve than the direct application of Monte Carlo method to the classical Dyson series. To better understand the underlying mechanism of the inchworm Monte Carlo method, we distinguish two types of exponential error growth, which are known as the numerical sign problem and the error amplification. The former is due to the fast growth of variance in the stochastic method, which can be observed from the Dyson series, and the latter comes from the evolution of the numerical solution. Our analysis demonstrates that the technique of partial resummation can be considered as a tool to balance these two types of error, and the inchwormMonte Carlo method is a successful case where the numerical sign problem is effectively suppressed by such means. We first demonstrate our idea in the context of ordinary differential equations, and then provide complete analysis for the inchworm Monte Carlo method. Several numerical experiments are carried out to verify our theoretical results.
A novel semi-Lagrangian method is introduced to solve numerically the Euler equation for ideal incompressible flow in arbitrary space dimension. It exploits the time-analyticity of fluid particle trajectories and requires, in principle, only limited
spatial smoothness of the initial data. Efficient generation of high-order time-Taylor coefficients is made possible by a recurrence relation that follows from the Cauchy invariants formulation of the Euler equation (Zheligovsky & Frisch, J. Fluid Mech. 2014, 749, 404-430). Truncated time-Taylor series of very high order allow the use of time steps vastly exceeding the Courant-Friedrichs-Lewy limit, without compromising the accuracy of the solution. Tests performed on the two-dimensional Euler equation indicate that the Cauchy-Lagrangian method is more - and occasionally much more - efficient and less prone to instability than Eulerian Runge-Kutta methods, and less prone to rapid growth of rounding errors than the high-order Eulerian time-Taylor algorithm. We also develop tools of analysis adapted to the Cauchy-Lagrangian method, such as the monitoring of the radius of convergence of the time-Taylor series. Certain other fluid equations can be handled similarly.
Global spectral analysis (GSA) is used as a tool to test the accuracy of numerical methods with the help of canonical problems of convection and convection-diffusion equation which admit exact solutions. Similarly, events in turbulent flows computed
by direct numerical simulation (DNS) are often calibrated with theoretical results of homogeneous isotropic turbulence due to Kolmogorov, as given in Turbulence -U. Frisch, Cambridge Univ. Press, UK (1995). However, numerical methods for the simulation of this problem are not calibrated, as by using GSA of convection and/or convection-diffusion equation. This is with the exception in A critical assessment of simulations for transitional and turbulence flows-Sengupta, T.K., In Proc. of IUTAM Symp. on Advances in Computation, Modeling and Control of Transitional and Turbulent Flows, pp 491-532, World Sci. Publ. Co. Pte. Ltd., Singapore (2016), where such a calibration has been advocated with the help of convection equation. For turbulent flows, an extreme event is characterized by the presence of length scales smaller than the Kolmogorov length scale, a heuristic limit for the largest wavenumber present without being converted to heat. With growing computer power, recently many simulations have been reported using a pseudo-spectral method, with spatial discretization performed in Fourier spectral space and a two-stage, Runge-Kutta (RK2) method for time discretization. But no analyses are reported to ensure high accuracy of such simulations. Here, an analysis is reported for few multi-stage Runge-Kutta methods in the Fourier spectral framework for convection and convection-diffusion equations. We identify the major source of error for the RK2-Fourier spectral method using GSA and also show how to avoid this error and specify numerical parameters for achieving highest accuracy possible to capture extreme events in turbulent flows.
Block coordinate descent (BCD) methods approach optimization problems by performing gradient steps along alternating subgroups of coordinates. This is in contrast to full gradient descent, where a gradient step updates all coordinates simultaneously.
BCD has been demonstrated to accelerate the gradient method in many practical large-scale applications. Despite its success no convergence analysis for inverse problems is known so far. In this paper, we investigate the BCD method for solving linear inverse problems. As main theoretical result, we show that for operators having a particular tensor product form, the BCD method combined with an appropriate stopping criterion yields a convergent regularization method. To illustrate the theory, we perform numerical experiments comparing the BCD and the full gradient descent method for a system of integral equations. We also present numerical tests for a non-linear inverse problem not covered by our theory, namely one-step inversion in multi-spectral X-ray tomography.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
