• Journal of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.545-565
• /
• 2014

In this paper we derive a priori $L^{\infty}(L^2)$ error estimates for expanded mixed finite element formulations of semilinear Sobolev equations. This formulation expands the standard mixed formulation in the sense that three variables, the scalar unknown, the gradient and the flux are explicitly treated. Based on this method we construct finite element semidiscrete approximations and fully discrete approximations of the semilinear Sobolev equations. We prove the existence of semidiscrete approximations of u, $-{\nabla}u$ and $-{\nabla}u-{\nabla}u_t$ and obtain the optimal order error estimates in the $L^{\infty}(L^2)$ norm. And also we construct the fully discrete approximations and analyze the optimal convergence of the approximations in ${\ell}^{\infty}(L^2)$ norm. Finally we also provide the computational results.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.61-82
• /
• 2000

In this paper two so-called regularized Green's functions are introduced to derive the optimal maximum norm error estimates for the unknown function and the adjoint vector-valued function for mixed finite element methods of Laplacian operator. One contribution of the paper is a demonstration of how the boundedness of $L^1$-norm estimate for the second Green's function ${\lambda}_2$ and the optimal maximum norm error estimate for the adjoint vector-valued function are proved. These results are seemed to be to be new in the literature of the mixed finite element methods.

• Journal of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.313-326
• /
• 2018

The paper studies some new ${\mathbb{C}}^n$-generalizations of Bergman type operators introduced by Shields and Williams depending on a normal pair of weight functions. We find the values of parameter ${\beta}$ for which these operators are bounded on mixed norm spaces L(p, q, ${\beta}$) over the unit ball in ${\mathbb{C}}^n$. Moreover, these operators are bounded projections as well, and the images of L(p, q, ${\beta}$) under the projections are found.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.205-215
• /
• 2021

In [1], Beznosova proved that the bound on the norm of the dyadic paraproduct with b ∈ BMO in the weighted Lebesgue space L2(w) depends linearly on the Ad2 characteristic of the weight w and extrapolated the result to the Lp(w) case. In this paper, we provide the weighted norm estimates of the dyadic paraproduct πb with b ∈ VMO and reduce the dependence of the Ad2 characteristic to 1/2 by using the property that for b ∈ VMO its mean oscillations are vanishing in certain cases. Using this result we also reduce the quadratic bound for the commutators of the Calderón-Zygmund operator [b, T] to 3/2.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.5
• /
• pp.335-340
• /
• 2014

In this paper, we propose a new sign subband adaptive filter to improve the convergence rate of the conventional sign subband adaptive filter which has been proposed to deal with colored input signal under the environment with impulsive noise. The existing sign subband adaptive filter does not increase the convergence speed by increasing the number of subband because each subband input signal is normalized by $l_2-norm$ of all of the subband input signals. We devised a new sign subband adaptive filter that normalizes each subband input signal with $l_2-norm$ of each subband input signal and increases the convergence rate by increasing the number of subband. We carried out a performance comparison of the proposed algorithm with the existing sign subband adaptive filter using a system identification model. It is shown that the proposed algorithm has faster convergence rate than the existing sign subband adaptive filter.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.6
• /
• pp.420-426
• /
• 2014

In this paper, we propose a new affine projection sign algorithm (APSA) to improve the convergence speed of the conventional APSA which has been proposed to enable the affine projection algorithm (APA) to operate robustly in impulsive noise environment. The conventional APSA has two advantages; it operates robustly against impulsive noise and does not need calculation for the inverse matrix. The proposed algorithm also has the conventional algorithm's advantages and furthermore, better convergence speed than the conventional algorithm. In the conventional algorithm, each input signal is normalized by $l_2$-norm of all input signals, but the proposed algorithm uses input signals normalized by their corresponding $l_2$-norm. We carried out a performance comparison of the proposed algorithm with the conventional algorithm using a system identification model. It is shown that the proposed algorithm has the faster convergence speed than the conventional algorithm.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.412-415
• /
• 1995

Previously obtained results of L$_{2}$-gain and H$_{\infty}$ control via state feedback of nonlinear systems are extended to a class of nonlinear system with uncertainties. The required information about the uncertainties is that the uncertainties are bounded in Euclidian norm by known functions of the system state. The conditions are characterized in terms of the corresponding Hamilton-Jacobi equations or inequalities (HJEI). An algorithm for finding an approximate local solution of Hamilton-Jacobi equation is given. This results and algorithm are illustrated on a numerical example..

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2002.11a
• /
• pp.71-76
• /
• 2002

보간법은 기본적으로 원래의 영상을 연속적인 함수 모형으로 나타내고 이 함수로부터 다시 샘플링을 하여 원하는 영상을 얻는 방식으로 접근한다. 본 논문에서는 다른 연속 함수모델보다 진동이 적고 필터 계수가 적은 B-spline 함수를 사용한다. 된 논문의 최적 보간 방법은 원래의 신호와 얻고자 하는 신호를 각각 spline함수로 나타내고, 이 둘의 차이가 가장 작은 것을 선택하는 것이다. 그러기 위해서는 여러 개의 spline계수 중에서 원래 신호와의 L$_2$-norm이 가장 작은 것을 선택해야 한다 이러한 최적 보간법을 일반화하기 위해서 spline 함수로 표현된 신호를 다시 샘플링 하여 신호를 얻고, 그 신호를 공간에 따라 변화하는 spline함수의 합으로 나타낸다. 그리고 이렇게 나타낸 함수들 중에서 원래의 함수와 가장 가까운 것을 선택하도록 함으로써 일반화될 수 있다. 이러한 최적화 된 비정규점 리사이징 알고리즘은 다른 알고리즘에 비해서 더 적은 오차를 나타냄을 확인할 수 있다.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.447-454
• /
• 1999

We study a general law of large numbers for array of mu-tually T related fuzzy numbers where T is an Archimedean t-norm and generalize earlier results of Fuller(1992), Triesch(1993) and Hong (1996).