scholarly journals Adaptive Step-Size Control for Dynamic Relaxation Using Continuous Kinetic Damping

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Samuel Jung ◽  
Tae-Yun Kim ◽  
Wan-Suk Yoo

Dynamic relaxation (DR) is a widely used numerical method to determine the static equilibrium of a dynamic system. However, it is difficult to apply conventional DR methods to nonlinear models because they require estimation of a stiffness matrix of the model. To resolve the forementioned problem, a new dynamic relaxation method using continuous kinetic damping (CKDR) was proposed in previous research. The CKDR method does not require any model parameters including the stiffness matrix, and it possesses absolute stability and a second-order convergence rate. However, the convergence rate is proportional to square of the step size, and this may result in a low convergence rate if the selected step size is excessively small. This problem leads to difficulties in the practical use of CKDR. Thus, an adaptive step-size method is proposed in this paper to control the convergence rate of CKDR. The proposed method estimates natural frequency of the model and determines adaptive step size. Static equilibrium simulations were performed for three different models to verify the method. The results revealed that the computational cost of CKDR with a variable step size was very efficient when compared to fixed step sizes and that the convergence rate was also controlled as intended. In addition, the lowest natural frequencies of models in static equilibrium were accurately estimated.

2012 ◽  
Vol 16 (S3) ◽  
pp. 355-375 ◽  
Author(s):  
Olena Kostyshyna

An adaptive step-size algorithm [Kushner and Yin,Stochastic Approximation and Recursive Algorithms and Applications, 2nd ed., New York: Springer-Verlag (2003)] is used to model time-varying learning, and its performance is illustrated in the environment of Marcet and Nicolini [American Economic Review93 (2003), 1476–1498]. The resulting model gives qualitatively similar results to those of Marcet and Nicolini, and performs quantitatively somewhat better, based on the criterion of mean squared error. The model generates increasing gain during hyperinflations and decreasing gain after hyperinflations end, which matches findings in the data. An agent using this model behaves cautiously when faced with sudden changes in policy, and is able to recognize a regime change after acquiring sufficient information.


Author(s):  
Shuo Peng ◽  
A.-J. Ouyang ◽  
Jeff Jun Zhang

With regards to the low search accuracy of the basic invasive weed optimization algorithm which is easy to get into local extremum, this paper proposes an adaptive invasive weed optimization (AIWO) algorithm. The algorithm sets the initial step size and the final step size as the adaptive step size to guide the global search of the algorithm, and it is applied to 20 famous benchmark functions for a test, the results of which show that the AIWO algorithm owns better global optimization search capacity, faster convergence speed and higher computation accuracy compared with other advanced algorithms.


Author(s):  
Alfredo Bonini Neto ◽  
Luis Roberto Almeida Gabriel Filho ◽  
Dilson Amancio Alves

Sign in / Sign up

Export Citation Format

Share Document