• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.771-795
• /
• 2013

In this paper we consider the Navier-Stokes equations in the half space. Our aim is to construct a mild solution for initial data in $B^{-\alpha}_{{\infty},{\infty}}(\mathbb{R}^n_+)$, 0 < ${\alpha}$ < 1. To do this, we derive the estimate of the Stokes flow with singular initial data in $B^{-\alpha}_{{\infty},q}(\mathbb{R}^n_+)$, 0 < ${\alpha}$ < 1, 1 < $q{\leq}{\infty}$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.4
• /
• pp.301-327
• /
• 2019

The proper orthogonal decomposition (POD) method for time-dependent problems significantly reduces the computational time as it reduces the original problem to the lower dimensional space. Even a higher degree of reduction can be reached if the solution is smooth in space and time. However, if the solution is discontinuous and the discontinuity is parameterized e.g. with time, the POD approximations are not accurate in the reduced space due to the lack of ability to represent the discontinuous solution as a finite linear combination of smooth bases. In this paper, we propose to post-process the sample solutions and re-initialize the POD approximations to deal with discontinuous solutions and provide accurate approximations while the computational time is reduced. For the post-processing, we use the Gegenbauer reconstruction method. Then we regularize the Gegenbauer reconstruction for the construction of POD bases. With the constructed POD bases, we solve the given PDE in the reduced space. For the POD approximation, we re-initialize the POD solution so that the post-processed sample solution is used as the initial condition at each sampling time. As a proof-of-concept, we solve both one-dimensional linear and nonlinear hyperbolic problems. The numerical results show that the proposed method is efficient and accurate.

• East Asian mathematical journal
• /
• v.24 no.3
• /
• pp.305-315
• /
• 2008

The purpose of this paper is to study the existence and uniqueness of the fixed point of uniformly pseudo-contractive operator and the solution of equation with uniformly accretive operator, and to approximate the fixed point and the solution by the Mann iterative sequence in an arbitrary Banach space or an uniformly smooth Banach space respectively. The results presented in this paper show that if X is a real Banach space and A : X $\rightarrow$ X is an uniformly accretive operator and (I-A)X is bounded then A is a mapping onto X when A is continuous or $X^*$ is uniformly convex and A is demicontinuous. Consequently, the corresponding results which depend on the assumptions that the fixed point of operator and solution of the equation are in existence are improved.

• International Journal of Aeronautical and Space Sciences
• /
• v.3 no.2
• /
• pp.46-58
• /
• 2002

An inverse method is introduced to construct benchmark problems for the numerical solution of initial value problems. Benchmark problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The solution is constructed such that it lies near a given approximate numerical solution, and therefore the special case solution can be generated in a versatile and physically meaningful fashion and can serve as a benchmark problem to validate approximate solution methods. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. A multi-variable orthogonal function expansion method and computer symbol manipulation are successfully used for this process. Using this special case exact solution, it is possible to directly investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given code and a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution. Illustrative examples show the utility of this method not only for the ordinary differential equations (ODEs) but for the partial differential equations (PDEs).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.10
• /
• pp.1639-1647
• /
• 2016

This paper deals with eddy current loss analysis of Slotless Double sided Cored type permanent magnet linear generator by using analytical method, space harmonic method. In order to calculate eddy current, this paper derives analytical solution by the Maxwell equation, magnetic vector potential, Faraday's law and a two-dimensional(2-D) cartesian coordinate system. First, we derived the armature reaction field distribution produced by armature wingding current. Second, by using derived armature reaction field solution, the analytical solution for eddy current density distribution are also obtained. Finally, the analytical solution for eddy current loss induced in permanent magnets(PMs) are derived by using equivalent, electrical resistance calculated from PMs volume and eddy current density distribution solution. The analytical result from space harmonic method are validated extensively by comparing with finite element method(FEM).

• Communications of the Korean Mathematical Society
• /
• v.36 no.3
• /
• pp.549-555
• /
• 2021

We show the solvability of the ordinary differential equations describing curves on sphere or hyperbolic space. Making use of the geometric properties of the equations, we derive explicit solution formulae.

• The Pure and Applied Mathematics
• /
• v.14 no.4
• /
• pp.279-282
• /
• 2007

Using the center instead of the Lipschitz condition we show how to provide weaker sufficient convergence conditions of the modified Newton Kantorovich method for the solution of nonlinear singular integral equations with Curleman shift (NLSIES). Finer error bounds on the distances involved and a more precise information on the location of the solution are also obtained and under the same computational cost than in [1].

• East Asian mathematical journal
• /
• v.23 no.2
• /
• pp.257-260
• /
• 2007

Using the center instead of the Lipschitz condition we show how to provide weaker sufficient convergence conditions of the modified Newton Kantorovich method for the solution of nonlinear singular integral equations with Curleman shift (NLSIES). Finer error bounds on the distances involved and a more precise information on the location of the solution are also obtained and under the same computational cost than in [1].

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.264-272
• /
• 1995

This paper presents an efficient design method to realize an associative memory with BSB neural networks by means of the parametrization of the solution space and searching for the optimal solution using an evolution program. In particular, the performance index based on DOA analysis in this paper may make and associative memory implementation to reach on the level of practical success.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.109-116
• /
• 2015

This paper is concerned with the single vendor single buyer integrated production inventory problem. To make this problem more practical, space restriction and lead time proportional to lot size are considered. Since the space for the inventory is limited in most practical inventory system, the space restriction for the inventory of a vendor and a buyer is considered. As product's quantity to be manufactured by the vendor is increased, the lead time for the order is usually increased. Therefore, lead time for the product is proportional to the order quantity by the buyer. Demand is assumed to be stochastic and the continuous review inventory policy is used by the buyer. If the buyer places an order, then the vendor will start to manufacture products and the products will be transferred to the buyer with equal shipments many times. The mathematical formulation with space restriction for the inventory of a vendor and a buyer is suggested in this paper. This problem is constrained nonlinear integer programming problem. Order quantity, reorder points for the buyer, and the number of shipments are required to be determined. A Lagrangian relaxation approach, a popular solution method for constrained problem, is developed to find lower bound of this problem. Since a Lagrangian relaxation approach cannot guarantee the feasible solution, the solution method based on the Lagrangian relaxation approach is proposed to provide with a good feasible solution. Total costs by the proposed method are pretty close to those by the Lagrangian relaxation approach. Sensitivity analysis for space restriction for the vendor and the buyer is done to figure out the relationships between parameters.