• Structural Engineering and Mechanics
• /
• v.55 no.4
• /
• pp.885-900
• /
• 2015

This paper introduces Romberg-Richardson's method as one of the numerical integration tools for computation of stress intensity factor in a pre-cracked specimen subjected to a complex stress field across the crack faces. Also, the computation of stress intensity factor for various stress fields using existing three methods: average stress over interval method, piecewise linear stress method, piecewise quadratic method are modified by using Richardson extrapolation method. The direct integration method is used as reference for constant and linear stress distribution across the crack faces while Gauss-Chebyshev method is used as reference for nonlinear distribution of stress across the crack faces in order to obtain the stress intensity factor. It is found that modified methods (average stress over intervals-Richardson method, piecewise linear stress-Richardson method, piecewise quadratic-Richardson method) yield more accurate results after a few numbers of iterations than those obtained using these methods in their original form. Romberg-Richardson's method is proven to be more efficient and accurate than Gauss-Chebyshev method for complex stress field.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.718-724
• /
• 2008

We present a novel joint barcode deblurring and nonuniform illumination compensation algorithm for barcode signals whose number of modules is known. The proposed algorithm is based on a penalized least squares method using a roughness penalty function for an illumination model and a double well penalty function for a barcode signal model. In simulations, the proposed method shows an improved performance compared with a conventional method without compensating nonuniform illumination effects. In addition, the proposed method converges quickly during optimization(within 15 iterations), thereby showing strong possibility for real time decoding of barcode signals.

• Structural Engineering and Mechanics
• /
• v.7 no.3
• /
• pp.241-257
• /
• 1999

This paper presents a procedure to minimize the cost of materials of cable-stayed bridges with composite box girder and concrete tower. Two sets of iterations are included in the proposed procedure. The first set of iteration performs the structural analysis for a cable-stayed bridge. The second set of iteration performs the optimization process. The design is formulated as a general mathematical problem with the cost of the bridge as the objective function and bending forces, shear forces, fatigue stresses, buckling and deflection as constraints. The constraints are developed based on the Canadian National Standard CAN/CSA-S6-88. The finite element method is employed to perform the complicated nonlinear structural analysis of the cable-stayed bridges. The internal penalty function method is used in the optimization process. The limit states design method is used to determine the load capacity of the bridge. A computer program written in FORTRAN 77 is developed and its validity is verified by several practical-sized designs.

• Advances in materials Research
• /
• v.11 no.4
• /
• pp.351-374
• /
• 2022

Softening function is the primary input for modeling the fracture of concrete when the cohesive crack approach is used. In this paper, based on the laboratory data on notched beams, an inverse algorithm is proposed that can accurately find the softening curve of the concrete. This algorithm uses non-linear finite element analysis and the damage-plasticity model. It is based on the kinematics of the beam at the late stages of loading. The softening curve, obtained from the corresponding algorithm, has been compared to other softening curves in the literature. It was observed that in determining the behavior of concrete, the usage of the presented curve made accurate results in predicting the peak loads and the load-deflection curves of the beams with different concrete mixtures. In fact, the proposed algorithm leads to softening curves that can be used for modeling the tensile cracking of concrete precisely. Moreover, the advantage of this algorithm is the low number of iterations for converging to an appropriate answer.

• Journal of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.427-444
• /
• 2024

The matrix completion problem is to predict missing entries of a data matrix using the low-rank approximation of the observed entries. Typical approaches to matrix completion problem often rely on thresholding the singular values of the data matrix. However, these approaches have some limitations. In particular, a discontinuity is present near the thresholding value, and the thresholding value must be manually selected. To overcome these difficulties, we propose a shrinkage and thresholding function that smoothly thresholds the singular values to obtain more accurate and robust estimation of the data matrix. Furthermore, the proposed function is differentiable so that the thresholding values can be adaptively calculated during the iterations using Stein unbiased risk estimate. The experimental results demonstrate that the proposed algorithm yields a more accurate estimation with a faster execution than other matrix completion algorithms in image inpainting problems.

• Korean Journal of Optics and Photonics
• /
• v.6 no.3
• /
• pp.245-256
• /
• 1995

Rugate filters of inhomogeneous refractive index were designed using the Fourier transform and the effect of reflectance, stop bandwidth, optical thickness, and Q function on the rugate filter was investigated. An iterative correction process using a merit function was employed to fit an initial design to the target spectrum. Three Q functions derived by Sossi, Bovard, and Fabricius, respectively, were compared in terms of the number of iteration, merit function, and optimum optical thickness. The result shows that after a number of iterations the Q functions by Bovard and Fabricius produce high rejection rugate filters closer to the target spectrum than the Sossi's Q function and the optimal optical thickness is determined by the stop-band width of the rugate filter. ilter.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1561-1597
• /
• 2019

In this paper we introduce the notions of topological entropy and topological pressure for non-autonomous iterated function systems (or NAIFSs for short) on countably infinite alphabets. NAIFSs differ from the usual (autonomous) iterated function systems, they are given [32] by a sequence of collections of continuous maps on a compact topological space, where maps are allowed to vary between iterations. Several basic properties of topological pressure and topological entropy of NAIFSs are provided. Especially, we generalize the classical Bowen's result to NAIFSs ensures that the topological entropy is concentrated on the set of nonwandering points. Then, we define the notion of specification property, under which, the NAIFSs have positive topological entropy and all points are entropy points. In particular, each NAIFS with the specification property is topologically chaotic. Additionally, the ${\ast}$-expansive property for NAIFSs is introduced. We will prove that the topological pressure of any continuous potential can be computed as a limit at a definite size scale whenever the NAIFS satisfies the ${\ast}$-expansive property. Finally, we study the NAIFSs induced by expanding maps. We prove that these NAIFSs having the specification and ${\ast}$-expansive properties.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2016

It is well known that the behavior of PV curves is similar to a quadratic function. This is used in some papers to approximate PV curves and calculate the maximum-loading point by minimum number of power flow runs. This paper also based on quadratic approximation of the PV curves is aimed at completing previous works so that the computational efforts are reduced and the accuracy is maintained. To do this, an iterative method based on a quadratic function with two constant coefficients, instead of the three ones, is used. This simplifies the calculation of the quadratic function. In each iteration, to prevent the calculations from diverging, the equations are solved on the assumption that voltage magnitude at a selected load bus is known and the loading factor is unknown instead. The voltage magnitude except in the first iteration is selected equal to the one at the nose point of the latest approximated PV curve. A method is presented to put the mentioned voltage in the first iteration as close as possible to the collapse point voltage. This reduces the number of iterations needed to determine the maximum-loading point. This method is tested on four IEEE test systems.

• Structural Engineering and Mechanics
• /
• v.66 no.4
• /
• pp.465-476
• /
• 2018

In this paper, a new meta-heuristic optimization method is presented. This new method is named "Numbers Cup Optimization" (NCO). The NCO algorithm is inspired by the sport competitions. In this method, the objective function and the design variables are defined as the team and the team members, respectively. Similar to all cups, teams are arranged in groups and the competitions are performed in each group, separately. The best team in each group is determined by the minimum or maximum value of the objective function. The best teams would be allowed to the next round of the cup, by accomplishing minor changes. These teams get grouped again. This process continues until two teams arrive the final and the champion of the Numbers Cup would be identified. In this algorithm, the next cups (same iterations) will be repeated by the improvement of players' performance. To illustrate the capabilities of the proposed method, some standard functions were selected to optimize. Also, size optimization of three benchmark trusses is performed to test the efficiency of the NCO approach. The results obtained from this study, well illustrate the ability of the NCO in solving the optimization problems.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.21 no.3
• /
• pp.167-180
• /
• 2017

According to the fact that the low convergence level of the complete elliptic integral of the first kind for the modulus which having values approach to one. In this paper we propose novelty of the complete elliptic integral which having new infinite series that consists of new modulus introduced as own modulus function. We apply scheme of iteration by substituting the common modulus with own modulus function into the new infinite series. We obtained so many new exact formulas of the complete elliptic integral derived from this method correspond to the number of iterations. On the other hand, it has been also obtained a lot of new transformation functions with the corresponding own modulus functions. The calculation results show that the enhancement of the number of significant figures of the new infinite series of the complete elliptic integral of the first kind corresponds to the level of quadratic convergence.