• Korea-Australia Rheology Journal
• /
• v.16 no.3
• /
• pp.117-128
• /
• 2004

The effect of molecular parameters on the steady vortex behaviors in the inertial viscoelastic flow past a cylinder has been investigated. FENE-CR model was considered as a constitutive equation. A recently developed iterative solution method (Kim et al., (in press)) was found to be successfully applicable to the computation of inertial viscoelastic flows. The high-resolution computations were carried out to understand the detailed flow behaviors based on the efficient iterative solution method armed with ILU(0) type pre-conditioner and BiCGSTAB method. The discrete elastic viscous split stress-G/streamline upwind Petrov Galerkin (DEVSS-G/SUPG) formulation was adopted as a stabilization method. The vortex size decreased as elasticity increases. However, the vortex enhancement was also observed in the case of large extensibility, which means that the vortex behavior is strongly dependent upon the material parameters. The longitudinal gradient of normal stress was found to retard the formation of vortex, whereas the extensional viscosity played a role in the vortex enhancement. The present results are expected to be helpful for understanding the inertial vortex dynamics of viscoelastic fluids in the flow past a confined cylinder.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.26 no.6
• /
• pp.227-235
• /
• 2022

For a member model in nonlinear structural analysis, a lumped plastic model that idealizes its flexural bending, shear, and axial behaviors by springs with the nonlinear hysteretic model is widely adopted because of its simplicity and transparency compared to the other rigorous finite element methods. On the other hand, a challenging task in its numerical solution is to satisfy the equilibrium condition between nonlinear flexural bending and shear springs connected in series. Since the local forces between flexural and shear springs are not balanced when one or both springs experience stiffness changes (e.g., cracking, yielding, and unloading), the additional unbalanced force due to overshooting or undershooting each spring force is also generated. This paper introduces an iterative scheme for numerical solutions satisfying the equilibrium conditions between flexural bending and shear springs. The effect of equilibrium iteration on analysis results is shown by comparing the results obtained from the proposed method to those from the conventional scheme, where the equilibrium condition is not perfectly satisfied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3204-3217
• /
• 2023

In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

• Communications of the Korean Mathematical Society
• /
• v.15 no.1
• /
• pp.133-142
• /
• 2000

We consider some numerical solution methods for equilibrium equations Af + E$^{T}$ λ = r, Ef = s. Algebraic problems of this form evolve from many applications such as structural optimization, fluid flow, and circuits. An important approach, called the force method, to the solution to such problems involves dimension reduction nullspace computation for E. The purpose of this paper is to investigate the substructuring method for the solution step of the force method in the context of the incompressible fluid flow. We also suggests some iterative methods based upon substructuring scheme..

• ETRI Journal
• /
• v.30 no.6
• /
• pp.807-817
• /
• 2008

We present a low-density parity-check (LDPC)-based, threaded layered space-time-frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean-squared-error iterative-tree-search (U-MMSE-ITS) detector, which is known to be one of the most efficient multi-input multi-output (MIMO) detectors available, is improved by augmentation of the partial-length paths and by the addition of one-bit complement sequences. Compared with the U-MMSE-ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low-complexity belief-propagation (BP) decoding algorithm for LDPC-codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low-complexity BP decoder, the proposed system is a promising solution to high-data-rate transmission over selective-fading channels.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.5
• /
• pp.899-909
• /
• 1992

An iterative solution technique is presented to analyze the dynamic systems of rigid bodies subjected to kinematic constraints. Lagrange multipliers associated with the constraints are iteratively computed by monotonically reducing an appropriately defined constraint error vector, and the resulting equation of motion is solved by a well-established ODE technique. Constraints on the velocity and acceleration as well as the position are made to be satisfied at joints at each time step. Time integration is efficiently performed because decomposition or orthonormalization of the large matrix is not required at all. An acceleration technique is suggested for the faster convergence of the iterative scheme.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1337-1349
• /
• 2011

So far as a solution of the given consistent linear system is concerned many numerical methods - both mathematically non-iterative as well as iterative - have been reported in the literature over the last couple of centuries. Most of these methods consider all the equations including linearly dependent ones in the system and obtain a solution whenever it exists. Since linearly dependent equations do not add any new information to a system concerning a solution we have proposed an algorithm that identifies them and prunes them in the process of solving the system. The pruning process does not involve row/column interchanges as in the case of Gauss reduction with partial/complete pivoting. We demonstrate here that the use of pruning as an inbuilt part of our solution process reduces computational and storage complexities and also computational error.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.5
• /
• pp.439-446
• /
• 2012

This paper presents an implicit moving least squares(MLS) difference method for improving the solution accuracy of 1-D free boundary problems, which implicitly updates the topology change of moving interface. The conventional MLS difference method explicitly updates the moving interface; it requires no iterative solution procedure but results in the loss of accuracy. However, the newly developed implicit scheme makes the total system nonlinear involving iterative solution procedure, but numerical verification show that it dramatically elevates the solution accuracy with moderate computation increase. Through numerical experiments for melting problems having moving singularity, it is verified that the proposed method can achieve the second order accuracy.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.309-322
• /
• 1997

In this paper we introduce and study a new class of completely generalized mildly nonlinear complementarity problems for fuzzy mappings and construct some new iterative algorithms. We also show the existence of solution and the convergence of iterative sequences generated by the algorithm. Our results extend some recent results of Noor, Chang and huang.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.