• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.295-309
• /
• 2023

The Richards' equation attracts the attention of several scientific researchers due to its importance in the hydrogeology field especially porous soil. This work presents a numerical method to solve the two dimensional Richards' equation. The pressure form and the mixed form of Richards' equation are solved numerically using a bivariate diamond finite volumes scheme. Euler explicit scheme is used for the time discretization. Different test cases are done to validate the accuracy and the efficiency of our numerical model and to compare the possible numerical strategies. We started with a first simple test case of Richards' pressure form where the hydraulic capacity and the hydraulic conductivity are taken constant and then a second test case where the hydrodynamics parameters are linear variables. Finally, a third test case where the soil parameters are taken according the Van Gunchten empirical model is presented.

• Communications for Statistical Applications and Methods
• /
• v.31 no.1
• /
• pp.65-85
• /
• 2024

The tail probability of a function of a multivariate random variable is not easy to estimate by the crude Monte Carlo simulation. When the occurrence of the function value over a threshold is rare, the accurate estimation of the corresponding probability requires a huge number of samples. When the explicit form of the cumulative distribution function of each component of the variable is known, the inverse transform likelihood ratio method is directly applicable scheme to estimate the tail probability efficiently. The method is a type of the importance sampling and its efficiency depends on the selection of the importance sampling distribution. When the cumulative distribution of the multivariate random variable is represented by a copula and its marginal distributions, we develop an iterative algorithm to find the optimal importance sampling distribution, and show the convergence of the algorithm. The performance of the proposed scheme is compared with the crude Monte Carlo simulation numerically.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.695-708
• /
• 2024

In this paper we present a non-standard finite difference method for solving a fractional decay model. The proposed NSFDM is constructed by incorporating a non-standard denominator function, resulting in an explicit numerical scheme as easy as the conventional Euler method, but it provides very accurate solutions and has unconditional stability. Two examples from the literature are presented to demonstrate the performance of the proposed numerical scheme, which is compared to three methods from the literature. It is found that the method's estimated errors are extremely minimal, such as within the machine precision.

• Journal of Magnetics
• /
• v.14 no.4
• /
• pp.137-143
• /
• 2009

The convergence behavior of the all-electron full-potential linearized augmented plane-wave (FLAPW) method with the explicit orthogonalization (XO) scheme is tested on ferromagnetic bulk body-centered-cubic Fe. Applying a commonly used criterion relating the plane-wave and angular momentum cutoffs, $l_{max}\;=\;R_{MT}K_{max}$, where $R_{MT}$ is the muffin-tin (MT) sphere radius and $K_{max}$ is the plane-wave cutoff for the basis - the total energy is converged and stable for $K_{max}R_{MT}$ = 10. The total energy convergence dependence on the star-function cutoff, $G_{max}$, is minimal and so a $G_{max}$ of 3$K_{max}$ or a large enough $G_{max}$ is a reasonable choice. We demonstrate that the convergence with respect to $l_{max}$ or a fixed large enough $G_{max}\;and\;K_{max}$ are independent, and that $K_{max}$ provides a better measure of the convergence than $R_{MT}K_{max}$. The dependence of the total energy on $R_{MT}$ is shown to be small if the core states are treated equivalently, and that the XO scheme is able to treat systems with significantly smaller $R_{MT}$ than the standard LAPW method. For converged systems, the calculated lattice parameter, bulk modulus, and magnetic moments are in excellent agreement with the experimental values.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.893-902
• /
• 2002

MPLS enables efficient explicit routing, and thus provides great advantages in supporting traffic engineering. Exploiting this capability, we Propose a load balancing scheme which deploys a multipath routing. It is named LBM (Load Balancing in MPLS networks), and targets at efficient network utilization as well as performance enhancement. LBM establishes multiple LSP (Label Switched Path)s between a pair of ingress-egress routers, and distributes traffic over these LSPs at the new level. Its routing decision is based on both the length and the utilization of the paths. In order to enhance the efficiency of a link usage, a link is limited to be used by shorter paths as its utilization becomes higher Longer paths are considered to be candidate alternative paths as the utilization of shorter paths becomes higher. Simulation experiments are performed in order to compare the performance of LBM to that of static shortest path only scheme as well as the other representative dynamic multipath traffic distribution approaches. The simulation results show that LBM outperforms the compared approaches, and the performance gain is more significant when the traffic distribution among the ingress-egress pairs is non-uniform.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.441-450
• /
• 2002

As the size of embedded system software increase bigger and bigger, and it's complexity is grower and grower, the usage of dynamic memory management scheme such collector also has been increased. Using the garbage collector, however, inherently lead us performance degradation. In order to resolve this kind of performance problem in the Java based embedded system. we introduce an explicit dynamic memory free method to the automated dynamic memory management environment. which can be performed by a programmer. In the worst case, the prosed scheme shows the same performance as the case of that only garbage collector is working, since the unclaimed garbage objects will eventually be collected later by the garbage collector. In the best case. our method is free from any runtime overhead because the applications can be implemented without any intervention of the garbage collector. Although the proposed method can be facilitated with all the existing garbage collection algorithms, it shows an outperform in the case of mark-and-sweep algorithm.

• Water for future
• /
• v.24 no.4
• /
• pp.49-58
• /
• 1991

Flood routing in the Youngsan River was performed for the flood event of July, 1989 by two finite difference methods. The Saint Venant eq., a kind of hyperbolic partial differential equation is employed as governing equation and the explicit scheme (Leap Frog) and implicit scheme (Preissmann) are used to discretize the GE. As for the external boundary conditions, discharge and tidal elevation are upstream and downstream BC, respectively and estuary dam is included in internal BC. Lateral inflows and upstream discharges are the hourly results from storage function method, At Naju station, a Relatively upstream points in this river, the outputs are interpreted as good ones by comparing two numerical results of FDMs with the observed data and the calibrated results by storage function method. and two computational results are compared at the other sites, from middle stream and downstream points, and thus are considered reliable. Therefore, we can conclude from this research that these numerical models are adaptable in simulating and forecasting the flood in natural channels in Korea as well as existing hydrologic models. And the study about optimal gate control at the flood time is expected as further study using these models.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.516-524
• /
• 2008

This paper presents a new modeling technique for the simulation of cloth specific characteristics with a set of hard constraints using an implicit constraint enforcement scheme. A conventional explicit Baumgarte constraint stabilization method has several defects. It requires users to pick problem-dependent coefficients to achieve fast convergence and has inherent stabilization limits. The proposed implicit constraint enforcement method is stable with large time steps, does not require problem dependent feed-back parameters, and guarantees the natural physics-based motion of an object. In addition, its computational complexity is the same as the explicit Baumgarte method. This paper describes a formulation of implicit constraint enforcement and provides a constraint error analysis. The modeling technique for complex components of cloth such as seams, buttons, sharp creases, wrinkles, and prevention of excessive elongation are explained. Combined with an adaptive constraint activation scheme, the results using the proposed method show the substantial enhancement of the realism of cloth simulations with a corresponding savings in computational cost.

• Journal of computational fluids engineering
• /
• v.13 no.4
• /
• pp.114-125
• /
• 2008

Current state and perspective of DNS of turbulence and turbulent combustion are discussed with feature trend of the fastest supercomputer in the world. Based on the perspective of DNS of turbulent combustion, possibility of perfect simulations of IC engine is shown. In 2020, the perfect simulation will be realized with 30 billion grid points by 1EXAFlops supercomputer, which requires 4 months CPU time. The CPU time will be reduced to about 4 days if several developments were achieved in the current fundamental researches. To shorten CPU time required for DNS of turbulent combustion, two numerical methods are introduced to full-explicit full-compressible DNS code. One is compact finite difference filter to reduce spatial resolution requirements and numerical oscillations in small scales, and another is well-known point-implicit scheme to avoid quite small time integration of the order of nanosecond for fully explicit DNS. Availability and accuracy of these numerical methods have been confirmed carefully for auto-ignition, planar laminar flame and turbulent premixed flames. To realize DNS of IC engine with realistic kinetic mechanism, several DNS of elemental combustion process in IC engines has been conducted.

• Smart Structures and Systems
• /
• v.14 no.6
• /
• pp.1269-1289
• /
• 2014

With the sub-stepping technique, the numerical analysis in real-time dynamic hybrid testing is split into the response analysis and signal generation tasks. Two target computers that operate in real-time may be assigned to implement these two tasks, respectively, for fully extending the simulation scale of the numerical substructure. In this case, the integration time-step of solving the dynamic response of the numerical substructure can be dozens of times bigger than the sampling time-step of the controller. The time delay between the real and desired feedback forces becomes more striking, which challenges the well-developed delay compensation methods in real-time dynamic hybrid testing. This paper focuses on displacement prediction and force correction for delay compensation in the real-time dynamic hybrid testing with a large integration time-step. A new displacement prediction scheme is proposed based on recently-developed explicit integration algorithms and compared with several commonly-used prediction procedures. The evaluation of its prediction accuracy is carried out theoretically, numerically and experimentally. Results indicate that the accuracy and effectiveness of the proposed prediction method are of significance.