• Kyungpook Mathematical Journal
• /
• v.60 no.3
• /
• pp.485-505
• /
• 2020

We present a complete description of all the extreme points of the unit ball of 𝓛_s(²𝑙³_∞) which leads to a complete formula for ║f║ for every f ∈ 𝓛_s(²𝑙³_∞)^∗. We also show that $extB_{{\mathcal{L}}_s(^2l^3_{\infty})}{\subset}extB_{{\mathcal{L}}_s(^2l^n_{\infty})}$ for every n ≥ 4. Using the formula for ║f║ for every f ∈ 𝓛_s(²𝑙³_∞)^∗, we show that every extreme point of the unit ball of 𝓛_s(²𝑙³_∞) is exposed. We also characterize all the smooth points of the unit ball of 𝓛_s(²𝑙³_∞).

• Journal of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.239-263
• /
• 2019

The $Calder{\acute{o}}n$-Zygmund type estimate is proved for elliptic obstacle problems in bounded non-smooth domains. The problems are related to divergence form nonlinear elliptic equation with measurable nonlinearities. Precisely, nonlinearity $a({\xi},x_1,x^{\prime})$ is assumed to be only measurable in one spatial variable $x_1$ and has locally small BMO semi-norm in the other spatial variables x', uniformly in ${\xi}$ variable. Regarding non-smooth domains, we assume that the boundaries are locally flat in the sense of Reifenberg. We also investigate global regularity in the settings of weighted Orlicz spaces for the weak solutions to the problems considered here.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.4
• /
• pp.20-28
• /
• 2008

We propose a radial image processing method in a discrete polar coordinate system based on L1-norm. For this purpose, we first verified that the polar coordinate based on L2-norm can not exist in discrete system and then develop a method converting the Cartesian coordinate to the discrete polar coordinate. We apply the proposed method to smooth mass images of breast tissue and to detect the boundaries of extremely deformable objects. Compared to the Gaussian smoothing method performed in the Cartesian coordinate system, the proposed method stabilized the image signal while maintaining the overall radial shape of mass images. The proposed boundary detection method can detect shapes with high precision while conventional edge detectors can not accurately detect the shape of deformable objects. We also exploit the method to perform pupil detection and have had good experimental results.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.spc2
• /
• pp.270-277
• /
• 2005

In this paper, a decentralized control problem is considered for multimachine power systems with nonlinear interconnections and disturbances. A direct feedback linearization compensator is employed to cancel most of the nonlinearities, and then a backstepping procedure is applied to deal with the interconnections and to reduce the effects of a disturbance that does not satisfy the matching condition. In this procedure, the disturbance is handled by using a smooth approximation of the signum function. Practical stability is achieved under the assumption that the infinite norm of the disturbance is known. However, even in the case where the infinite norm of the disturbance is not known precisely, the proposed control system still guarantees $L_2$ stability. Furthermore, the origin is globally uniformly asymptotically stable in the absence of the disturbance. A three-machine power system is considered as an application example.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.25-37
• /
• 2001

We consider the finite element method applied to nonlinear Sobolev equation with smooth data and demonstrate for arbitrary order ($k{\geq}2$) finite element spaces the optimal rate of convergence in $L_{\infty}\;W^{1,{\infty}}({\Omega})$ and $L_{\infty}(L_{\infty}({\Omega}))$ (quasi-optimal for k = 1). In other words, the nonlinear Sobolev equation can be approximated equally well as its linear counterpart. Furthermore, we also obtain superconvergence results in $L_{\infty}(W^{1,{\infty}}({\Omega}))$ for the difference between the approximate solution and the generalized elliptic projection of the exact solution.

• Honam Mathematical Journal
• /
• v.32 no.4
• /
• pp.711-738
• /
• 2010

We list two kinds of gradation of openness and we study in the sense of the followings: (i) We give the definition of IVGO of fuzzy sets and obtain some basic results. (ii) We give the definition of interval-valued gradation of clopeness and obtain some properties. (iii) We give the definition of a subspace of an interval-valued smooth topological space and obtain some properties. (iv) We investigate some properties of gradation preserving (in short, IVGP) mappings.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1108-1118
• /
• 2019

Non-local means (NLM) algorithm is an effective and successful denoising method, but it is computationally heavy. To deal with this obstacle, we propose a novel NLM algorithm with fuzzy metric (FM-NLM) for image denoising in this paper. A new feature metric of visual features with fuzzy metric is utilized to measure the similarity between image pixels in the presence of Gaussian noise. Similarity measures of luminance and structure information are calculated using a fuzzy metric. A smooth kernel is constructed with the proposed fuzzy metric instead of the Gaussian weighted L2 norm kernel. The fuzzy metric and smooth kernel computationally simplify the NLM algorithm and avoid the filter parameters. Meanwhile, the proposed FM-NLM using visual structure preferably preserves the original undistorted image structures. The performance of the improved method is visually and quantitatively comparable with or better than that of the current state-of-the-art NLM-based denoising algorithms.

• Geophysics and Geophysical Exploration
• /
• v.9 no.1
• /
• pp.121-128
• /
• 2006

Magnetic survey flights by helicopters are usually parallel to the topographic surface, with a nominal clearance, but especially in high-resolution surveys the altitudes at which observations are made may be too variable to be regarded as a smooth surface. We have developed a reduction procedure for such data using the method of equivalent sources, where surrounding sources are included to control edge effects, and data from points distributed randomly in three dimensions are directly modelled. Although the problem is generally underdetermined, the method of conjugate gradients can be used to find a minimum-norm solution. There is freedom to select the harmonic function that relates the magnetic anomaly with the source. When the upward continuation function operator is selected, the equivalent source is the magnetic anomaly itself. If we select as source a distribution of magnetic dipoles in the direction of the ambient magnetic field, we can easily derive reduction-to-pole anomalies by rotating the direction of the magnetic dipoles to vertical.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.3
• /
• pp.211-236
• /
• 2019

This paper is devoted to the study and investigation of the Runge-Kutta discontinuous Galerkin method for a system of differential equations consisting of two hyperbolic conservation laws. The numerical coupling flux which is used at a given interface (x = 0) is the upwind flux. Moreover, in the linear case, we derive optimal convergence rates in the $L_2$-norm, showing an error estimate of order ${\mathcal{O}}(h^{k+1})$ in domains where the exact solution is smooth; here h is the mesh width and k is the degree of the (orthogonal Legendre) polynomial functions spanning the finite element subspace. The underlying temporal discretization scheme in time is the third-order total variation diminishing Runge-Kutta scheme. We justify the advantages of the Runge-Kutta discontinuous Galerkin method in a series of numerical examples.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.