• Title/Summary/Keyword: nonlinear difference scheme

Search Result 84, Processing Time 0.024 seconds

Numerical analysis of a tidal flow using quadtree grid (사면구조 격자를 이용한 조석흐름 수치모의)

  • Kim, Jong-Ho;Kim, Hyung-Jun;NamGung, Don;Cho, Yong-Sik
    • 한국방재학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.163-167
    • /
    • 2007
  • For numerical analysis of a tidal flow, a two-dimensional hydrodynamic model is developed by solving the nonlinear shallow-water equations. The governing equations are discretized explicitly with a finite difference leap-frog scheme and a first-order upwind scheme on adaptive hierarchical quadtree grids. The developed model is verified by applying to prediction of tidal behaviors. The calculated tidal levels are compared to available field measurements. A very reasonable agreement is observed.

  • PDF

Simulation of Run-up of Tsunamis in the East Sea (동해의 지진해일 처오름 모의)

  • Kim, Jae-Hong;Cho, Yong-Sik
    • Journal of Korea Water Resources Association
    • /
    • v.38 no.6 s.155
    • /
    • pp.461-469
    • /
    • 2005
  • A second-order upwind scheme is used to investigate the run-up heights of tsunamis in the East Sea and the predicted results are compared with the field data and results of a first-order upwind scheme. In the numerical model, the governing equations solved by the finite difference scheme are the linear shallow-water equations in deep water and nonlinear shallow-water equations in shallow water. The target events are 1983 Central East Sea Tsunami and 1993 Hokkaido Nansei Oki Tsunami. The predicted results represent reasonably well the run-up heights of tsunamis in the East Sea. And, the results of simulation are used for the design of inundation map.

A STATISTICS INTERPOLATION METHOD: LINEAR PREDICTION IN A STOCK PRICE PROCESS

  • Choi, U-Jin
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.3
    • /
    • pp.657-667
    • /
    • 2001
  • We propose a statistical interpolation approximate solution for a nonlinear stochastic integral equation of a stock price process. The proposed method has the order O(h$^2$) of local error under the weaker conditions of $\mu$ and $\sigma$ than those of Milstein' scheme.

  • PDF

Real Time Digital Control of PWM Inverter for Uninterruptible Power Supply(UPS) application (무정전 전원공급장치 적용을 위한 PWM 인버터의 Digital 실시간 제어)

  • Min, Wan-Ki;Lee, Sang-Hun;Choi, Jae-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1999.11a
    • /
    • pp.56-60
    • /
    • 1999
  • This paper presents the high performance real time control system of PWM inverter for uninterruptible power supply(UPS). This system is based on a digital control scheme which calculates the pulse widths of the inverter switches for the next sampling time in digital signal processor(DSP). A PI compensator is used to eliminate the voltage error caused by the difference between the actual values of LC filter and those designed. Double regulation loops which are the inner current loop and the outer voltage loop are used to make the transient response time reduce in load disturbance and nonlinear load. This method makes it possible to obtain better response in comparison to conventional digital control system. The proposed scheme provides good performance such as stable operation, low THD of the output voltage, and good dynamic response for load variations and nonlinear load.

  • PDF

Numerical Solution of Nonlinear Diffusion in One Dimensional Porous Medium Using Hybrid SOR Method

  • Jackel Vui Lung, Chew;Elayaraja, Aruchunan;Andang, Sunarto;Jumat, Sulaiman
    • Kyungpook Mathematical Journal
    • /
    • v.62 no.4
    • /
    • pp.699-713
    • /
    • 2022
  • This paper proposes a hybrid successive over-relaxation iterative method for the numerical solution of a nonlinear diffusion in a one-dimensional porous medium. The considered mathematical model is discretized using a computational complexity reduction scheme called half-sweep finite differences. The local truncation error and the analysis of the stability of the scheme are discussed. The proposed iterative method, which uses explicit group technique and modified successive over-relaxation, is formulated systematically. This method improves the efficiency of obtaining the solution in terms of total iterations and program elapsed time. The accuracy of the proposed method, which is measured using the magnitude of absolute errors, is promising. Numerical convergence tests of the proposed method are also provided. Some numerical experiments are delivered using initial-boundary value problems to show the superiority of the proposed method against some existing numerical methods.

Frequency Domain DTV Pilot Detection Based on the Bussgang Theorem for Cognitive Radio

  • Hwang, Sung Sue;Park, Dong Chan;Kim, Suk Chan
    • ETRI Journal
    • /
    • v.35 no.4
    • /
    • pp.644-654
    • /
    • 2013
  • In this paper, a signal detection scheme for cognitive radio (CR) based on the Bussgang theorem is proposed. The proposed scheme calculates the statistical difference between Gaussian noise and the primary user signal by applying the Bussgang theorem to the received signal. Therefore, the proposed scheme overcomes the noise uncertainty and gives scalable complexity according to the zero-memory nonlinear function for a mobile device. We also present the theoretical analysis on the detection threshold and the detection performance in the additive white Gaussian noise channel. The proposed detection scheme is evaluated by computer simulations based on the IEEE 802.22 standard for the wireless regional area network. Our results show that the proposed scheme is robust to the noise uncertainty and works well in a very low signal-to-noise ratio.

NUMERICAL SOLUTIONS FOR ONE AND TWO DIMENSIONAL NONLINEAR PROBLEMS RELATED TO DISPERSION MANAGED SOLITONS

  • Kang, Younghoon;Lee, Eunjung;Lee, Young-Ran
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.4
    • /
    • pp.835-847
    • /
    • 2021
  • We study behavior of numerical solutions for a nonlinear eigenvalue problem on ℝn that is reduced from a dispersion managed nonlinear Schrödinger equation. The solution operator of the free Schrödinger equation in the eigenvalue problem is implemented via the finite difference scheme, and the primary nonlinear eigenvalue problem is numerically solved via Picard iteration. Through numerical simulations, the results known only theoretically, for example the number of eigenpairs for one dimensional problem, are verified. Furthermore several new characteristics of the eigenpairs, including the existence of eigenpairs inherent in zero average dispersion two dimensional problem, are observed and analyzed.

A Non-Uniform Convergence Tolerance Scheme for Enhancing the Branch-and-Bound Method (비균일 수렴허용오차 방법을 이용한 분지한계법 개선에 관한 연구)

  • Jung, Sang-Jin;Chen, Xi;Choi, Gyung-Hyun;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.4
    • /
    • pp.361-371
    • /
    • 2012
  • In order to improve the efficiency of the branch-and-bound method for mixed-discrete nonlinear programming, a nonuniform convergence tolerance scheme is proposed for the continuous subproblem optimizations. The suggested scheme assigns the convergence tolerances for each continuous subproblem optimization according to the maximum constraint violation obtained from the first iteration of each subproblem optimization in order to reduce the total number of function evaluations needed to reach the discrete optimal solution. The proposed tolerance scheme is integrated with five branching order options. The comparative performance test results using the ten combinations of the five branching orders and two convergence tolerance schemes show that the suggested non-uniform convergence tolerance scheme is obviously superior to the uniform one. The results also show that the branching order option using the minimum clearance difference method performed best among the five branching order options. Therefore, we recommend using the "minimum clearance difference method" for branching and the "non-uniform convergence tolerance scheme" for solving discrete optimization problems.

Hybrid Block Coding of Medical Images Using the Characteristics of Human Visual System

  • Park, Kwang-Suk;Chee, Young-Joon
    • Journal of Biomedical Engineering Research
    • /
    • v.15 no.1
    • /
    • pp.57-62
    • /
    • 1994
  • The demand of image compression is increasing now for the integration of medical images into the hospital information system. Even though the quantitative distortion can be measured from the difference between original and reconstructed images, it doesn't include the nonlinear characteristics of human visual system. In this study, we have evaluated the nonlinear characteristics of human visual system and applied them to the compression of medical images. The distortion measures which reflect the characteristics of human visual system has been considered. This image compression procedure consists of coding scheme using JND (Just Noticeable Difference) curve, polynomial approximation and BTC (Block Truncation Coding). Results show that this method can be applied to CT images, scanned film images and other kinds of medical images with the compression ratio of 5-10:1 without any noticeable distortion.

  • PDF

Highly accurate family of time integration method

  • Rezaiee-Pajand, Mohammad;Esfehani, S.A.H.;Karimi-Rad, Mahdi
    • Structural Engineering and Mechanics
    • /
    • v.67 no.6
    • /
    • pp.603-616
    • /
    • 2018
  • In this study, the acceleration vector in each time step is assumed to be a mth order time polynomial. By using the initial conditions, satisfying the equation of motion at both ends of the time step and minimizing the square of the residual vector, the m+3 unknown coefficients are determined. The order of accuracy for this approach is m+1, and it has a very low dispersion error. Moreover, the period error of the new technique is almost zero, and it is considerably smaller than the members of the Newmark method. The proposed scheme has an appropriate domain of stability, which is greater than that of the central difference and linear acceleration techniques. The numerical tests highlight the improved performance of the new algorithm over the fourth-order Runge-Kutta, central difference, linear and average acceleration methods.