• Atmosphere
• /
• v.33 no.4
• /
• pp.331-341
• /
• 2023

A numerical forecasting models usually predict future states by performing time integration considering fixed static time-steps. A time-step that is too long can cause model instability and failure of forecast simulation, and a time-step that is too short can cause unnecessary time integration calculations. Thus, in numerical models, the time-step size can be determined by the CFL (Courant-Friedrichs-Lewy)-condition, and this condition acts as a necessary condition for finding a numerical solution. A static time-step is defined as using the same fixed time-step for time integration. On the other hand, applying a different time-step for each integration while guaranteeing the stability of the solution in time advancement is called an adaptive time-step. The adaptive time-step algorithm is a method of presenting the maximum usable time-step suitable for each integration based on the CFL-condition for the adaptive time-step. In this paper, the adaptive time-step algorithm is applied for the Korean Integrated Model (KIM) to determine suitable parameters used for the adaptive time-step algorithm through the monthly verifications of 10-day simulations (during January and July 2017) at about 12 km resolution. By comparing the numerical results obtained by applying the 25 second static time-step to KIM in Supercomputer 5 (Nurion), it shows similar results in terms of forecast quality, presents the maximum available time-step for each integration, and improves the calculation efficiency by reducing the number of total time integrations by 19%.

• Nuclear Engineering and Technology
• /
• v.43 no.6
• /
• pp.531-546
• /
• 2011

The backward differentiation formula (BDF) method is applied to a three-dimensional reactor kinetics calculation for efficient yet accurate transient analysis with adaptive time step control. The coarse mesh finite difference (CMFD) formulation is used for an efficient implementation of the BDF method that does not require excessive memory to store old information from previous time steps. An iterative scheme to update the nodal coupling coefficients through higher order local nodal solutions is established in order to make it possible to store only node average fluxes of the previous five time points. An adaptive time step control method is derived using two order solutions, the fifth and the fourth order BDF solutions, which provide an estimate of the solution error at the current time point. The performance of the BDF- and CMFD-based spatial kinetics calculation and the adaptive time step control scheme is examined with the NEACRP control rod ejection and rod withdrawal benchmark problems. The accuracy is first assessed by comparing the BDF-based results with those of the Crank-Nicholson method with an exponential transform. The effectiveness of the adaptive time step control is then assessed in terms of the possible computing time reduction in producing sufficiently accurate solutions that meet the desired solution fidelity.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.265-268
• /
• 2004

In this paper. we propose an adaptive step-size algorithm for the adaptive interference canceller (AIC) in the space-time trellis coded DS-CDMA system. In the AIC, the performance of the blind LMS algorithms that updates the tap-weight vector of the AIC is heavily dependent on the choice of step-size. To improve the performance of the fixed step-size AIC (FS-AIC), the regular adaptive step-size algorithm is extended in complex domain and applied to the joint AIC and ML decoder scheme. Simulation results show that the joint adaptive step-size AIC (AS-AIC) and ML decoder scheme using the proposed algorithm has boner performance than not only the conventional ML decoder but also the joint FS-AIC and ML decoder scheme without much increase of the decoding delay and complexity.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.46-50
• /
• 2001

Adaptive signal processing is used to acoustic echo canceller. adaptive noise canceller and adaptive algorithm among adaptive algorithms is mainly used because the structure is simple and computa LMS algorithm has trade-off between the converge speed and the steady state error. In this paper, step-size of adaptive algorithm is varied with orthogonality Principles of optimal filter to get fasts though small steady state error. Time varying step-size is determined proportional to the maximum vector of LMS algorithm. As results of simulations, the adaptive algorithm with proposed time-v compared with conventional ones.

• Nuclear Engineering and Technology
• /
• v.53 no.2
• /
• pp.399-413
• /
• 2021

The solution of the time-dependent neutron diffusion equation can be approximated using quasi-static methods that factorise the neutronic flux as the product of a time dependent function times a shape function that depends both on space and time. A generalization of this technique is the updated modal method. This strategy assumes that the neutron flux can be decomposed into a sum of amplitudes multiplied by some shape functions. These functions, known as modes, come from the solution of the eigenvalue problems associated with the static neutron diffusion equation that are being updated along the transient. In previous works, the time step used to update the modes is set to a fixed value and this implies the need of using small time-steps to obtain accurate results and, consequently, a high computational cost. In this work, we propose the use of an adaptive control time-step that reduces automatically the time-step when the algorithm detects large errors and increases this value when it is not necessary to use small steps. Several strategies to compute the modes updating time step are proposed and their performance is tested for different transients in benchmark reactors with rectangular and hexagonal geometry.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.83-88
• /
• 2017

This paper related with the performance evaluation of H-MMA (Hybrid-MMA) which is applying the adaptive modulus and adaptive step size concept to MMA adaptive equalization algorithm in order to reduce the intersymbol interference that is occurred in communication channel for digital code transmission. In the conventional MMA adaptive equalizer, the coefficient is updated by using the equalizer output and possible to compensation of amplitude and phase in 2nd dimensional QAM signal, the equalization performance were degraded due to fixed modulus and step size. For the overcomming the abovemensioned problem, it is possible to improving the equalization performance in the 2nd dimensional QAM signal by applying the adaptive modulus and adaptive step size propotional to equalizer output signal to the conventional MMA algorithm. The computer simulation was performed in the same channel for the compare the performance of MMA and proposed H-MMA which is proposed in this paper. As a result of simulation, the proposed H-MMA has slower convergence time in order to arriving the steady state than MMA. But after the steady state, H-MMA has more superior to the MMA in every performance index and the equalization noise was reduced.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1175-1178
• /
• 1998

we propose the Walsh-Hadamard Transform adaptive filter with time-varying step size. The performance of the proposed algorithm is evealuated in system identification where computer simulations are performed for both time-invariant and time-varying system. It is shown that the proposed algorithm produces good results compared with similar algorithms under different conditions, particularly in case of time-varying circumstance.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1051-1056
• /
• 2005

Least mean square(LMS) algorithm is one of the most popular algorithm in adaptive signal processing because of the simplicity and the small computation. But the convergence speed of time domain adaptive algorithm is slow when the spread width of eigen values is wide. Moreover we have to choose the step size well for convergency in this paper, we use adaptive algorithm of wavelet transform. And we propose a new wavelet based adaptive algorithm of wavelet transform. And we propose a new wavelet based adaptive algorithm with variable step size, which Is linear to absolute value of error signal. We applied this algorithm to adaptive noise canceler. Simulation results are presented to compare the performance of the proposed algorithm with the usual algorithms.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.115-118
• /
• 2000

We present a new variable step size LMS algorithm using the correlation between reference input and error signal of adaptive filter. The proposed algorithm updates each weight of filter by different step size at same sample time. We applied this algorithm to adaptive multip]e-notch filter. Simulation results are presented to compare the performance of the proposed algorithm with the usual LMS algorithm and another variable step algorithm.

• Nuclear Engineering and Technology
• /
• v.55 no.9
• /
• pp.3301-3312
• /
• 2023

This study incorporates a high-fidelity transient analysis solver based on multigroup CMFD in the MOC code STREAM. Transport modeling with heterogeneous geometries of the reactor core increases computational cost in terms of memory and time, whereas the multigroup CMFD reduces the computational cost. The reactor condition does not change at every time step, which is a vital point for the utilization of CMFD. CMFD correction factors are updated from the transport solution whenever the reactor core condition changes, and the simulation continues until the end. The transport solution is adjusted once CMFD achieves the solution. The flux-weighted method is used for rod decusping to update the partially inserted control rod cell material, which maintains the solution's stability. A smaller time-step size is needed to obtain an accurate solution, which increases the computational cost. The adaptive step-size control algorithm is robust for controlling the time step size. This algorithm is based on local errors and has the potential capability to accept or reject the solution. Several numerical problems are selected to analyze the performance and numerical accuracy of parallel computing, rod decusping, and adaptive time step control. Lastly, a typical pressurized LWR was chosen to study the rod-ejection accident.