• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.597-621
• /
• 2016

We present regularity conditions for suitable weak solutions of the Navier-Stokes equations with slip boundary data near the curved boundary. To be more precise, we prove that suitable weak solutions become regular in a neighborhood boundary points, provided the scaled mixed norm $L^{p,q}_{x,t}$ with 3/p + 2/q = 2, $1{\leq}q$ < ${\infty}$ is sufficiently small in the neighborhood.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.297-310
• /
• 2018

In this paper, a nonlinear high-order difference scheme is proposed to solve the Extended-Fisher-Kolmogorov equation. The existence, uniqueness of difference solution and priori estimates are obtained. Furthermore, the convergence of the difference scheme is proved by utilizing the energy method to be of fourth-order in space and second-order in time in the discrete $L^{\infty}-norm$. Some numerical examples are given in order to validate the theoretical results.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1221-1234
• /
• 2009

In this paper, we construct fully discrete discontinuous Galerkin approximations to the solution of linear Sobolev equations. We apply a symmetric interior penalty method which has an interior penalty term to compensate the continuity on the edges of interelements. The optimal convergence of the fully discrete discontinuous Galerkin approximations in ${\ell}^{\infty}(L^2)$ norm is proved.

• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.49-59
• /
• 2008

In this paper, we prove the sharp estimates for multilinear commutator related to Littlewood-Paley operator. By using the sharp estimates, we obtained the weighted $L^p$-norm inequality for the multilinear commutator for 1 < p < $\infty$.

• Journal of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.467-475
• /
• 1994

In 1983 Harmand and Lima [5] proved that if X is a Banach space for which K(X), the space of compact linear operators on X, is an M-ideal in L(X), the space of bounded linear operators on X, then it has the metric compact approximation property. A strong converse of the above result holds if X is a closed subspace of either $\elll_p(1 < p < \infty) or c_0 [2,15]$. In 1979 J. Johnson [7] actually proved that if X is a Banach space with the metric compact approximation property, then the annihilator K(X)^\bot$ of K(X) in $L(X)^*$ is the kernel of a norm-one projection in $L(X)^*$, which is the case if K(X) is an M-ideal in L(X).

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.2
• /
• pp.331-345
• /
• 2021

Let p(z)be a polynomial of degree n. Then Bernstein's inequality [12,18] is $${\max\limits_{{\mid}z{\mid}=1}}\;{\mid}p^{\prime}(z){\mid}\;{\leq}\;n\;{\max_{{\mid}z{\mid}=1}{\mid}(z){\mid}}$$. For q > 0, we denote $${\parallel}p{\parallel}_q=\{{\frac{1}{2{\pi}}}{\normalsize\displaystyle\smashmargin{2}{\int\nolimits_{0}}^{2{\pi}}}\;{\mid}p(e^{i{\theta}}){\mid}^qd{\theta}\}^{\frac{1}{q}}$$, and a well-known fact from analysis [17] gives $${{\lim_{q{\rightarrow}{{\infty}}}}\{{\frac{1}{2{\pi}}}{\normalsize\displaystyle\smashmargin{2}{\int\nolimits_{0}}^{2{\pi}}}\;{\mid}p(e^{i{\theta}}){\mid}^qd{\theta}\}^{\frac{1}{q}}={\max\limits_{{\mid}z{\mid}=1}}\;{\mid}p(z){\mid}$$. Above Bernstein's inequality was extended by Zygmund [19] into L^q norm by proving ║p'║_q ≤ n║p║_q, q ≥ 1. Let p(z) = a₀ + ∑ⁿ_𝜈=𝜇 a_𝜈z^𝜈, 1 ≤ 𝜇 ≤ n, be a polynomial of degree n having no zero in |z| < k, k ≥ 1. Then for 0 < r ≤ R ≤ k, Aziz and Zargar [4] proved $${\max\limits_{{\mid}z{\mid}=R}}\;{\mid}p^{\prime}(z){\mid}\;{\leq}\;{\frac{nR^{{\mu}-1}(R^{\mu}+k^{\mu})^{{\frac{n}{\mu}}-1}}{(r^{\mu}+k^{\mu})^{\frac{n}{\mu}}}\;{\max\limits_{{\mid}z{\mid}=r}}\;{\mid}p(z){\mid}}$$. In this paper, we obtain the L^q version of the above inequality for q > 0. Further, we extend a result of Aziz and Shah [3] into L^q analogue for q > 0. Our results not only extend some known polynomial inequalities, but also reduce to some interesting results as particular cases.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.103-107
• /
• 2009

This paper presents how to minimize the second-order cone programming problem occurring in the 3D reconstruction of multiple views. The $L_{\infty}$-norm minimization is done by a series of the minimization of the maximum infeasibility. Since the problem has many inequality constraints, we have to adopt methods of the interior point algorithm, in which the inequalities are sequentially approximated by log-barrier functions. An initial feasible solution is found easily by the construction of the problem. Actual computing is done by an iterative Newton-style update. When we apply the interior point method to the problem of reconstructing the structure and motion, every Newton update requires to solve a very large system of linear equations. We show that the sparse bundle-adjustment technique can be utilized in the same way during the Newton update, and therefore we obtain a very efficient computation.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.325-334
• /
• 2006

For $f{\in}L^2(B,d{\nu})$, ${\parallel}f{\parallel}_{BMO}=\widetilde{{\mid}f{\mid}^2}(z)-{\mid}{\tilde{f}}(z){\mid}^2$. For f continuous on B, ${\parallel}f{\parallel}_{BO}=sup\{w(f)(z):z{\in}B\}$ where $w(f)(z)=sup\{{\mid}f(z)-f(w){\mid}:{\beta}(z,w){\leq}1\}$. In this paper, we will show that if $f{\in}BMO$, then ${\parallel}f{\parallel}_{BO}{\leq}M{\parallel}f{\parallel}_{BMO}$. We will also show that if $f{\in}BO$, then ${\parallel}f{\parallel}_{BMO}{\leq}M{\parallel}f{\parallel}_{BO}^2$. A homomorphic function $f:B{\rightarrow}{\mathbb{C}}$ is called a Bloch function ($f{\in}{\mathcal{B}}$) if ${\parallel}f{\parallel}_{\mathcal{B}}=sup_{z{\in}B}\;Qf(z)$<${\infty}$. In this paper, we will show that if $f{\in}{\mathcal{B}}$, then ${\parallel}f{\parallel}_{BO}{\leq}{\parallel}f{\parallel}_{\mathcal{B}}$. We will also show that if $f{\in}BMO$ and f is holomorphic, then ${\parallel}f{\parallel}_{\mathcal{B}}^2{\leq}M{\parallel}f{\parallel}_{BMO}$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.650-655
• /
• 2013

For the DC-free encoding of source data, the Guided Scrambling (GS) technique is widely used as multi-mode coding in the optical data storage system. For DC-suppression GS coding in the holographic data storage system, the conservative array and balanced coding criteria are proposed. In this paper, equivalent integer programming models are developed to determine the optimal control bits for the minimum digital sum value (MDSV), conservative array, and balanced coding criteria. Using the proposed integer programming models, we compare the performance of GS encoding for the various combination of control bit/array sizes and scrambling polynomials.