• Bulletin of the Korean Mathematical Society
• /
• v.50 no.1
• /
• pp.321-341
• /
• 2013

In this paper, we discuss the a posteriori error estimates of the semidiscrete mixed finite element methods for quadratic optimal control problems governed by linear hyperbolic equations. The state and the co-state are discretized by the order $k$ Raviart-Thomas mixed finite element spaces and the control is approximated by piecewise polynomials of order $k(k{\geq}0)$. Using mixed elliptic reconstruction method, a posterior $L^{\infty}(L^2)$-error estimates for both the state and the control approximation are derived. Such estimates, which are apparently not available in the literature, are an important step towards developing reliable adaptive mixed finite element approximation schemes for the control problem.

• Journal of the Korean Mathematical Society
• /
• v.36 no.6
• /
• pp.1033-1046
• /
• 1999

This paper is devoted to the point wise error estimate up to boundary for the standard finite element solution of Poisson equation with Dirichlet boundary condition. Our new approach used the discrete maximum principle for the discrete harmonic solution. once the mesh in our domain satisfies the $\beta$-condition defined by us, the discrete harmonic solution with dirichlet boundary condition has the discrete maximum principle and the pointwise error should be bounded by L-errors newly obtained.

• Honam Mathematical Journal
• /
• v.29 no.2
• /
• pp.245-257
• /
• 2007

We showed in [2] that if $r\leq2$, then the average error between simple Trapezoidal rule and the composite Trapezoidal rule on two consecutive subintervals is proportional to $h^{2r+3}$ using zero mean Gaussian distribution under the assumption that we have subintervals (for simplicity equal length) partitioning and that each subinterval has the length. In this paper, if $r\geq3$, we show that zero mean Gaussian distribution of average error between simple Trapezoidal rule and the composite Trapezoidal rule on two consecutive subintervals is bounded by $Ch^8$.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.1
• /
• pp.11-21
• /
• 2007

Given a nonlinear function f : $\mathbb{R}{\rightarrow}\mathbb{R}$ that has a simple real zero ${\alpha}$, a new numerical method to be called k-fold pseudo- Halley's method is proposed and it's error analysis is under investigation to confirm the convergence behavior near ${\alpha}$. Under the assumption that f is sufficiently smooth in a small neighborhood of ${\alpha}$, the order of convergence is found to be at least k+3. In addition, the corresponding asymptotic error constant is explicitly expressed in terms of k, ${\alpha}$ and f as well as the derivatives of f. A zero-finding algorithm is written and has been successfully implemented for numerous examples with Mathematica.

• Honam Mathematical Journal
• /
• v.27 no.2
• /
• pp.317-332
• /
• 2005

In this paper we consider the hp-version to solve non-constant coefficients elliptic equations on a bounded, convex polygonal domain ${\Omega}$ in $R^2$. A family $G_p=\{I_m\}$ of numerical quadrature rules satisfying certain properties can be used for calculating the integrals. When the numerical quadrature rules $I_m{\in}G_p$ are used for computing the integrals in the stiffness matrix of the variational form we will give its variational form and derive an error estimate of ${\parallel}u-{\widetilde{u}}^h_p{\parallel}_{1,{\Omega}$.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.1
• /
• pp.49-56
• /
• 2006

A convergence behavior is under investigation near a simple real zero for the k-fold pseudo-Olver's method defined by extending the classical Olver's method. The order of convergence is shown to be at least k+3. The asymptotic error constant is explicitly given in terms of k and the corresponding simple zero. Various numerical examples with a proposed zero-finding algorithm are successfully confirmed with the use of symbolic and computational ability of Mathematica.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1409-1420
• /
• 2011

In this paper we present an operational method for solving linear Volterra-Fredholm integral equations (VFIE). The method is con- structed based on three matrices with simple structures which lead to a simple and high accurate algorithm. We also present an error estimation and demonstrate accuracy of the method by numerical examples.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.797-812
• /
• 1997

For analytic functions we give an expression for the kernel $K_n$ of the remainder terms for the Gauss-Radau and the Gauss-Lobatto rules with end points of multiplicity r and prove the convergence of the kernel we obtained. The error bound are obtained for the type $$\mid$R_n(f)$\mid$ \leq \frac{1}{\pi}l(\Gamma) max_{z \in \Gamma} $\mid$K_n(z)$\mid$ max_{z \in \Gamma} $\mid$f(z)$\mid$$, where $l(\Gamma)$ denotes the length of contour $\Gamma$.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1281-1290
• /
• 2007

We introduce three spectral regularization methods for solving a backward heat conduction problem (BHCP). For the three spectral regularization methods, we give the stability error estimates with optimal order under an a-priori and an a-posteriori regularization parameter choice rule. Numerical results show that our theoretical results are effective.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1725-1739
• /
• 2016

Abstract. Numerical solutions for the evolutionary space fractional order differential equations are considered. A predictor corrector method is applied in order to obtain numerical solutions for the equation without solving nonlinear systems iteratively at every time step. Theoretical error estimates are performed and computational results are given to show the theoretical results.