• Journal of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1037-1048
• /
• 1997

We show that an asymptotically Euclidean scalar-flat Kahler metric ona complex surface can be smoothly conformally compactified at the infinity point. We discuss some implication of this, characterizing such metrics on $C^2$ blown up at some points.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.244-262
• /
• 2022

In this paper, we analyze the hybridizable discontinuous Galerkin (HDG) method for second-order elliptic equations with nonlinear coefficients, which are used in many fields. We present the HDG method that uses a mixed formulation based on numerical trace and flux. Under assumptions on the nonlinear coefficient and H²-regularity for a dual problem, we prove that the discrete systems are well-posed and the numerical solutions have the optimal order of convergence as a mesh parameter. Also, we provide a matrix formulation that can be calculated using an iterative technique for numerical experiments. Finally, we present representative numerical examples in 2D to verify the validity of the proof of Theorem 3.10.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.563-578
• /
• 2005

In [Z. Cai and B. C. Shin, SIAM J. Numer. Anal. 40 (2002), 307-318], we developed the discrete first-order system least squares method for the second-order elliptic boundary value problem by directly approximating $H(div){\cap}H(curl)-type$ space based on the Helmholtz decomposition. Under general assumptions, error estimates were established in the $L^2\;and\;H^1$ norms for the vector and scalar variables, respectively. Such error estimates are optimal with respect to the required regularity of the solution. In this paper, we study solution methods for solving the system of linear equations arising from the discretization of variational formulation which possesses discrete biharmonic term and focus on numerical results including the performances of multigrid preconditioners and the finite element accuracy.

• Journal of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1269-1283
• /
• 2018

We are concerned with elliptic equations in ${\mathbb{R}}^N$, driven by a non-local integro-differential operator, which involves the fractional Laplacian. The main aim of this paper is to prove the existence of small solutions for our problem with negative energy in the sense that the sequence of solutions converges to 0 in the $L^{\infty}$-norm by employing the regularity type result on the $L^{\infty}$-boundedness of solutions and the modified functional method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.1
• /
• pp.1-15
• /
• 1999

Gradient recovery techniques for the second order elliptic boundary value problem are well known. In particular, the Midpoint and the Vertex Recovery Operator have been studied by various authors and under suitable assumptions on the regularity of the unknown solution superconvergence property of these recovered gradients have been proved. In this paper we extend these results to the recovered gradient of the finite element approximation to a model initial-boundary value problem, and go on to prove superconvergence result for this recovered gradient in a discrete (in time) error norm.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.425-440
• /
• 2010

Using Green's theorem, elliptic boundary value problems can be converted to boundary integral equations. A numerical methods for boundary integral equations are boundary elementary method(BEM). BEM has advantages over finite element method(FEM) whenever the fundamental solutions are known. Helmholtz type equations arise naturally in many physical applications. In a boundary integral formulation for the exterior Neumann there occurs a hypersingular operator which exhibits a strong singularity like $\frac{1}{|x-y|^3}$ and hence is not an integrable function. In this paper we are going to remove this hypersingularity by reducing the regularity of test functions.

• Journal of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.747-775
• /
• 2020

In this work we investigate the nonlocal elliptic equation with critical Hardy-Sobolev exponents as follows, $$(P)\;\{(-{\Delta}_p)^su={\lambda}{\mid}u{\mid}^{q-2}u+{\frac{{\mid}u{\mid}^{p{^*_s}(t)-2}u}{{\mid}x{\mid}^t}}{\hspace{10}}in\;{\Omega},\\u=0{\hspace{217}}in\;{\mathbb{R}}^N{\backslash}{\Omega},$$ where Ω ⊂ ℝ^N is an open bounded domain with Lipschitz boundary, 0 < s < 1, λ > 0 is a parameter, 0 < t < sp < N, 1 < q < p < p^∗_s where $p^*_s={\frac{N_p}{N-sp}}$, $p^*_s(t)={\frac{p(N-t)}{N-sp}}$, are the fractional critical Sobolev and Hardy-Sobolev exponents respectively. The fractional p-laplacian (-∆_p)^su with s ∈ (0, 1) is the nonlinear nonlocal operator defined on smooth functions by $\displaystyle(-{\Delta}_p)^su(x)=2{\lim_{{\epsilon}{\searrow}0}}\int{_{{\mathbb{R}}^N{\backslash}{B_{\epsilon}}}}\;\frac{{\mid}u(x)-u(y){\mid}^{p-2}(u(x)-u(y))}{{\mid}x-y{\mid}^{N+ps}}dy$, x ∈ ℝ^N. The main goal of this work is to show how the usual variational methods and some analysis techniques can be extended to deal with nonlocal problems involving Sobolev and Hardy nonlinearities. We also prove that for some α ∈ (0, 1), the weak solution to the problem (P) is in C^1,α(${\bar{\Omega}}$).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.547-556
• /
• 2003

This paper proposes a novel arithmetic unit over GF(2$^{m}$ ) for low-area elliptic curve cryptographic processor. The proposed arithmetic unit, which is linear feed back shift register (LFSR) architecture, is designed by using hardware sharing between the binary GCD algorithm and the most significant bit (MSB)-first multiplication scheme, and it can perform both division and multiplication in GF(2$^{m}$ ). In other word, the proposed architecture produce division results at a rate of one per 2m-1 clock cycles in division mode and multiplication results at a rate of one per m clock cycles in multiplication mode. Analysis shows that the computational delay time of the proposed architecture, for division, is less than previously proposed dividers with reduced transistor counts. In addition, since the proposed arithmetic unit does not restrict the choice of irreducible polynomials and has regularity and modularity, it provides a high flexibility and scalability with respect to the field size m. Therefore, the proposed novel architecture can be used for both division and multiplication circuit of elliptic curve cryptographic processor. Specially, it is well suited to low-area applications such as smart cards and hand held devices.

• Journal of the Korean Mathematical Society
• /
• v.57 no.6
• /
• pp.1451-1470
• /
• 2020

We are concerned with the following elliptic equations: $$\{(-{\Delta})^s_pu={\lambda}f(x,u)\;{\text{in {\Omega}}},\\u=0\;{\text{on {\mathbb{R}}^N{\backslash}{\Omega}},$$ where λ are real parameters, (-∆)^s_p is the fractional p-Laplacian operator, 0 < s < 1 < p < + ∞, sp < N, and f : Ω × ℝ → ℝ satisfies a Carathéodory condition. By applying abstract critical point results, we establish an estimate of the positive interval of the parameters λ for which our problem admits at least one or two nontrivial weak solutions when the nonlinearity f has the subcritical growth condition. In addition, under adequate conditions, we establish an apriori estimate in L^∞(Ω) of any possible weak solution by applying the bootstrap argument.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.928-931
• /
• 2003

This paper presents a digit-serial/parallel multiplier for finite fields GF(2m). The hardware requirements of the implemented multiplier are less than those of the existing multiplier of the same class, while processing time and area complexity. The implemented multiplier possesses the features of regularity and modularity. Thus, it is well suited to VLSI implementation. If the implemented digit-serial multiplier chooses the digit size D appropriately, it can meet the throughput requirement of a certain application with minimum hardware. The multipliers and squarers analyzed in this paper can be used efficiently for crypto processor in Elliptic Curve Cryptosystem.