• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2003.05a
• /
• pp.141-144
• /
• 2003

For the analysis of combustion instabilities of a liquid locket engine, a simple spray combustion model has been analyzed by the Euler-Lagrange method. Gas temperature, droplet trajectory, and droplet radius have been evaluated on 2-D axisymmetric coordinates. The Euler-Lagrange method has been shown to have a good tendency of gas temperature distribution as well as droplet trajectory and radius change.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.199-214
• /
• 2020

This paper describes the development of a parallel computational algorithm based on the finite element tearing and interconnecting (FETI) method that uses a local Lagrange multiplier. In this approach, structural computational domain is decomposed into non-overlapping sub-domains using local Lagrange multiplier. The local Lagrange multipliers are imposed at interconnecting nodes. 8-node solid element using extra shape function is adopted by using the representative volume element (RVE). The parallel computational algorithm is further established based on message passing interface (MPI). Finally, the present FETI-local approach is implemented on parallel hardware and shows improved performance.

• Proceedings of the SAREK Conference
• /
• 2007.11a
• /
• pp.29-33
• /
• 2007

In order to protect the environment from the refrigerant pollution, the $CO_2$ may be regarded as one of the most attractive alternative refrigerants for an automotive air-conditioning system. Control methods for a $CO_2$ system should be different because of $CO_2$'s unique properties as a refrigerant. Especially, the high-side pressure of a $CO_2$ system should be controlled for the effective operation of the system. In this study, the high-side pressure setpoint algorithm was developed by using a neural network and a Lagrange interpolation method. These methods were compared. Simulation results showed that a Lagrange interpolation method was more effective than a neural network in the respect of its easiness of programming and shorter execution time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.965-972
• /
• 2015

Along with the rapid development in digital times, image media are being used in internet, computer and digital camera. But image deterioration occurs due to various exterior reasons in the procedures of acquisition, processing, transmission and recording of digital image and major reason is noise. Therefore in order to remove salt & pepper noise, this study suggested the algorithm which replaces the noise to original pixel in case of non-noise, and processes the noise with Lagrange interpolation method in case of noise. In case high density noise was added and the noise could not be removed, noise characteristics were improved by processing the noises repeatedly. And for objective judgment, this method was compared with existing methods and PSNR(peak signal to noise ratio) was used as judgment standard.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.455-462
• /
• 2015

Image media is used for the internet, computers and digital cameras as part of the core services of multimedia. Digital images can be easily acquired and processed, due to the development of digital home appliances and personal computers' application software. However, image degradation occurs by various external causes in the acquisition, processing and transmitting process of digital images, and its main cause is known to be noise. Therefore, this study proposed and conducted the simulation of image restoration filter algorithm that processes impulse noise and Gaussian noise by applying Lagrange interpolation and spatial weighted method according to distance, respectively. The proposed algorithm improved 8.77[dB], 8.83[dB] and 10.02[dB], respectively, compared to existing A-TMF, AWMF and MMF, as a result of processing by applying the damaged Girl images to impulse noise(P=60%) and Gaussian noise(${\sigma}=10$).

• Communications of Mathematical Education
• /
• v.37 no.1
• /
• pp.65-84
• /
• 2023

The method of Lagrange multipliers, one of the most fundamental algorithms for solving equality constrained optimization problems, has been widely used in basic mathematics for artificial intelligence (AI), linear algebra, optimization theory, and control theory. This method is an important tool that connects calculus and linear algebra. It is actively used in artificial intelligence algorithms including principal component analysis (PCA). Therefore, it is desired that instructors motivate students who first encounter this method in college calculus. In this paper, we provide an integrated perspective for instructors to teach the method of Lagrange multipliers effectively. First, we provide visualization materials and Python-based code, helping to understand the principle of this method. Second, we give a full explanation on the relation between Lagrange multiplier and eigenvalues of a matrix. Third, we give the proof of the first-order optimality condition, which is a fundamental of the method of Lagrange multipliers, and briefly introduce the generalized version of it in optimization. Finally, we give an example of PCA analysis on a real data. These materials can be utilized in class for teaching of the method of Lagrange multipliers.

• ETRI Journal
• /
• v.6 no.2
• /
• pp.18-26
• /
• 1984

Among the various forms of interpolating polynomial for approximation, this paper is a study about the characteristics of piecewise Lagrange interpolating polynomials. And throughout the study, an attempt is made to construct the two-dimensional ap proximating function over Rectangular Grid and Triangular Grid by using the one-dim ensional interpolating polynomials.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.963-980
• /
• 2009

In this paper, spectral scheme based on Hermite interpolation for solving partial differential equations is presented. The idea of this Hermite spectral method comes from the spectral method on arbitrary grids of Carpenter and Gottlieb [J. Comput. Phys. 129(1996) 74-86] using the Lagrange interpolation.

• Transactions of Materials Processing
• /
• v.25 no.1
• /
• pp.49-55
• /
• 2016

Electrohydraulic forming (EHF) is a high-speed forming process that uses an electric arc discharge in water. Shock waves resulting from the electric arc discharge are propagated to the blank through water and the blank moves toward the die. Advantages of EHF include improved formability due to the high-speed process and reduction of the bouncing effect. In the current study, a numerical simulation of EHF was developed using LS-DYNA. In the simulation, the model for the electric arc was assumed as an adiabatic gas expansion and an Arbitrary Lagrange-Eulerian (ALE) multi material formulation was used to describe the interaction between the electric arc and the water. In order to model the Fluid-Structure Interaction (FSI), a coupling mechanism was used. The blank of Al 1100-O was simulated using shell elements. The results of the simulation showed that the blank was deformed due to the pressure propagation of water and the bouncing effect did not affect the formability of blank.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.5
• /
• pp.899-909
• /
• 1992

An iterative solution technique is presented to analyze the dynamic systems of rigid bodies subjected to kinematic constraints. Lagrange multipliers associated with the constraints are iteratively computed by monotonically reducing an appropriately defined constraint error vector, and the resulting equation of motion is solved by a well-established ODE technique. Constraints on the velocity and acceleration as well as the position are made to be satisfied at joints at each time step. Time integration is efficiently performed because decomposition or orthonormalization of the large matrix is not required at all. An acceleration technique is suggested for the faster convergence of the iterative scheme.