اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNew Fourth Order Postprocessing Techniques for Plate Buckling Eigenvalues by Morley Element
173
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we propose and analyze the extrapolation methods and asymptotically exact a posterior error estimates for eigenvalues of the Morley element. We establish an asymptotic expansion of eigenvalues, and prove an optimal result for this expansion and the corresponding extrapolation method. We also design an asymptotically exact a posterior error estimate and propose new approximate eigenvalues with higher accuracy by utilizing this a posteriori error estimate. Finally, several numerical experiments are considered to confirm the theoretical results and compare the performance of the proposed methods.
قيم البحث
اقرأ أيضاً
A Morley-Wang-Xu (MWX) element method with a simply modified right hand side is proposed for a fourth order elliptic singular perturbation problem, in which the discrete bilinear form is standard as usual nonconforming finite element methods. The sha
rp error analysis is given for this MWX element method. And the Nitsches technique is applied to the MXW element method to achieve the optimal convergence rate in the case of the boundary layers. An important feature of the MWX element method is solver-friendly. Based on a discrete Stokes complex in two dimensions, the MWX element method is decoupled into one Lagrange element method of Poisson equation, two Morley element methods of Poisson equation and one nonconforming $P_1$-$P_0$ element method of Brinkman problem, which implies efficient and robust solvers for the MWX element method. Some numerical examples are provided to verify the theoretical results.
Two asymptotically exact a posteriori error estimates are proposed for eigenvalues by the nonconforming Crouzeix--Raviart and enriched Crouzeix-- Raviart elements. The main challenge in the design of such error estimators comes from the nonconformity
of the finite element spaces used. Such nonconformity causes two difficulties, the first one is the construction of high accuracy gradient recovery algorithms, the second one is a computable high accuracy approximation of a consistency error term. The first difficulty was solved for both nonconforming elements in a previous paper. Two methods are proposed to solve the second difficulty in the present paper. In particular, this allows the use of high accuracy gradient recovery techniques. Further, a post-processing algorithm is designed by utilizing asymptotically exact a posteriori error estimators to construct the weights of a combination of two approximate eigenvalues. This algorithm requires to solve only one eigenvalue problem and admits high accuracy eigenvalue approximations both theoretically and numerically.
We present first-order perturbation analysis of a simple eigenvalue and the corresponding right and left eigenvectors of a general square matrix, not assumed to be Hermitian or normal. The eigenvalue result is well known to a broad scientific communi
ty. The treatment of eigenvectors is more complicated, with a perturbation theory that is not so well known outside a community of specialists. We give two different proofs of the main eigenvector perturbation theorem. The first, a block-diagonalization technique inspired by the numerical linear algebra research community and based on the implicit function theorem, has apparently not appeared in the literature in this form. The second, based on complex function theory and on eigenprojectors, as is standard in analytic perturbation theory, is a simplified version of well-known results in the literature. The second derivation uses a convenient normalization of the right and left eigenvectors defined in terms of the associated eigenprojector, but although this dates back to the 1950s, it is rarely discussed in the literature. We then show how the eigenvector perturbation theory is easily extended to handle other normalizations that are often used in practice. We also explain how to verify the perturbation results computationally. We conclude with some remarks about difficulties introduced by multiple eigenvalues and give references to work on perturbation of invariant subspaces corresponding to multiple or clustered eigenvalues. Throughout the paper we give extensive bibliographic commentary and references for further reading.
We develop and analyze a class of maximum bound preserving schemes for approximately solving Allen--Cahn equations. We apply a $k$th-order single-step scheme in time (where the nonlinear term is linearized by multi-step extrapolation), and a lumped m
ass finite element method in space with piecewise $r$th-order polynomials and Gauss--Lobatto quadrature. At each time level, a cut-off post-processing is proposed to eliminate extra values violating the maximum bound principle at the finite element nodal points. As a result, the numerical solution satisfies the maximum bound principle (at all nodal points), and the optimal error bound $O(tau^k+h^{r+1})$ is theoretically proved for a certain class of schemes. These time stepping schemes under consideration includes algebraically stable collocation-type methods, which could be arbitrarily high-order in both space and time. Moreover, combining the cut-off strategy with the scalar auxiliary value (SAV) technique, we develop a class of energy-stable and maximum bound preserving schemes, which is arbitrarily high-order in time. Numerical results are provided to illustrate the accuracy of the proposed method.
We present unconditionally energy stable Runge-Kutta (RK) discontinuous Galerkin (DG) schemes for solving a class of fourth order gradient flows. Our algorithm is geared toward arbitrarily high order approximations in both space and time, while energ
y dissipation remains preserved without imposing any restriction on time steps and meshes. We achieve this in two steps. First, taking advantage of the penalty free DG method introduced by Liu and Yin [J Sci. Comput. 77:467--501, 2018] for spatial discretization, we reformulate an extended linearized ODE system by the energy quadratization (EQ) approach. Second, we apply an s-stage algebraically stable RK method for temporal discretization. The resulting fully discrete DG schemes are linear and unconditionally energy stable. In addition, we introduce a prediction-correction procedure to improve both the accuracy and stability of the scheme. We illustrate the effectiveness of the proposed schemes by numerical tests with benchmark problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
