• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.393-406
• /
• 2020

We analyze a posteriori error estimator for the conforming P2 finite element on triangular meshes which is based on the solution of local Neumann problems. This error estimator extends the one for the conforming P1 finite element proposed in [4]. We prove that it is asymptotically exact for the Poisson equation when the underlying triangulations are mildly structured and the solution is smooth enough.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.4
• /
• pp.245-271
• /
• 2023

In this paper we discuss some recovery of H(div)-conforming flux approximations from the equilibrated fluxes of Ainsworth and Oden for quadratic finite element methods of second-order elliptic problems. Combined with the hypercircle method of Prager and Synge, these flux approximations lead to a posteriori error estimators which provide guaranteed upper bounds on the numerical error. Furthermore, we prove some superconvergence results for the flux approximations and asymptotic exactness for the error estimator under proper conditions on the triangulation and the exact solution. The results extend those of the previous paper for linear finite element methods.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.113-126
• /
• 2005

The Cahn-Hilliard equation is modeled to describe the dynamics of phase separation in glass and polymer systems. A priori error estimates for the Cahn-Hilliard equation have been studied by the authors. In order to control accuracy of approximate solutions, a posteriori error estimation of the Cahn-Hilliard equation is obtained by discontinuous Galerkin method.

• Journal of applied mathematics & informatics
• /
• v.32 no.5_6
• /
• pp.707-719
• /
• 2014

In this paper, we investigate a variational discretization approximation of elliptic optimal control problems with control constraints. The state and the co-state are approximated by piecewise linear functions, while the control is not directly discretized. By using some proper intermediate variables, we derive a second-order convergence in $L^2$-norm and superconvergence between the numerical solution and elliptic projection of the exact solution in $H^1$-norm or the gradient of the exact solution and recovery gradient in $L^2$-norm. Then we construct a posteriori error estimates by using the superconvergence results and do some numerical experiments to confirm our theoretical results.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.529-550
• /
• 2011

In this work, a numerical solution of the incompressible Navier-Stokes equations is proposed. The method suggested is based on an algorithm of discretization by mixed finite elements with a posteriori error estimation of the computed solutions. In order to evaluate the performance of the method, the numerical results are compared with some previously published works or with others coming from commercial code like Adina system.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1331-1345
• /
• 2010

This paper describes a numerical solution of Navier-Stokes equations. It includes algorithms for discretization by finite element methods and a posteriori error estimation of the computed solutions. In order to evaluate the performance of the method, the numerical results are compared with some previously published works or with others coming from commercial code like ADINA system.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.87-90
• /
• 1988

This paper reports a simple posteriori error estimate method for adaptive finite element mesh generation using quadratic shape function especially for the magnetic field problems. The elements of quadratic shape function have more precise solution than those of linear shape function. Therefore, the difference of two solutions gives error quantity. The method uses the magnetic flux density error as a basis for refinement. This estimator is tested on two dimensional problem which has singular points. The estimated error is always under estimated but in same order as exact error, and this method is much simpler and more convenient than other methods. The result shows that the adaptive mesh gives even better rate of convergence in global error than the uniform mesh.

• Structural Engineering and Mechanics
• /
• v.83 no.2
• /
• pp.273-282
• /
• 2022

In this paper, we propose a new concept for error estimation in finite element solutions, which we call mode-based error estimation. The proposed error estimation predicts a posteriori error calculated by the difference between the direct finite element (FE) approximation and the recovered FE approximation. The mode-based FE formulation for the recently developed self-updated finite element is employed to calculate the recovered solution. The formulation is constructed by searching for optimal bending directions for each element, and deep learning is adopted to help find the optimal bending directions. Through various numerical examples using four-node quadrilateral finite elements, we demonstrate the improved predictive capability of the proposed error estimator compared with other competitive methods.

• Transactions of Materials Processing
• /
• v.13 no.4
• /
• pp.334-341
• /
• 2004

In this study, a remeshing algorithm adapted to the mesh density map using the Delaunay mesh generation method is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on because of discrete property of the finite elements and distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical error will be highly increased. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally refined mesh at the region where the error is concentrated such as at the die corner. In this paper, the point insertion algorithm is used and the mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. An optimized smoothing technique is adopted to have smooth distribution of the mesh and improve the mesh element quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.958-964
• /
• 2007

In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.