• Title/Summary/Keyword: relaxation iterative method

Search Result 35, Processing Time 0.035 seconds

Reduced-order controller design via an iterative LMI method (반복 선형행렬부등식을 이용한 축소차수 제어기 설계)

  • Kim, Seog-Joo;Kwon, Soon-Man;Lee, Jong-Moo;Kim, Chun-Kyung;Cheon, Jong-Min
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2242-2244
    • /
    • 2004
  • This paper deals with the design of a reduced-order stabilizing controller for the linear system. The coupled lineal matrix inequality (LMI) problem subject to a rank condition is solved by a sequential semidefinite programming (SDP) approach. The nonconvex rank constraint is incorporated into a strictly linear penalty function, and the computation of the gradient and Hessian function for the Newton method is not required. The penalty factor and related term are updated iteratively. Therefore the overall procedure leads to a successive LMI relaxation method. Extensive numerical experiments illustrate the proposed algorithm.

  • PDF

Recognizing Static Target in Video Frames Taken from Moving Platform

  • Wang, Xin;Sugisaka, Masanori;Xu, Wenli
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.673-676
    • /
    • 2003
  • This paper deals with the problem of moving object detection and location in computer vision. We describe a new object-dependent motion analysis method for tracking target in an image sequence taken from a moving platform. We tackle these tasks with three steps. First, we make an active contour model of a target in order to build some of low-energy points, which are called kernels. Then we detect interest points in two windows called tracking windows around a kernel respectively. At the third step, we decide the correspondence of those detected interest points between tracking windows by the probabilistic relaxation method In this algorithm, the detecting process is iterative and begins with the detection of all potential correspondence pair in consecutive image. Each pair of corresponding points is then iteratively recomputed to get a globally optimum set of pairwise correspondences.

  • PDF

A Post Smoothing Algorithm for Vessel Segmentation

  • Li, Jiangtao;Lee, Hyo Jong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.345-346
    • /
    • 2009
  • The segmentation of vessel including portal vein, hepatic vein and artery, from Computed Tomography (CT) images plays an important role in the therapeutic strategies for hepatic diseases. Representing segmented vessels in three dimensional spaces is extremely useful for doctors to plan liver surgery. In this paper, proposed method is focused on smoothing technique of segmented 3D liver vessels, which derived from 3D region growing approach. A pixel expand algorithm has been developed first to avoid vessel lose and disconnection cased by the next smoothing technique. And then a binary volume filtering technique has been implemented and applied to make the segmented binary vessel volume qualitatively smoother. This strategy uses an iterative relaxation process to extract isosurfaces from binary volumes while retaining anatomical structure and important features in the volume. Hard and irregular place in volume image has been eliminated as shown in the result part, which also demonstrated that proposed method is a suitable smoothing solution for post processing of fine vessel segmentation.

A One-Pass Standard Cell Placement Algorithm Using Multi-Stage Graph Model (다단 그래프 모델을 이용한 빠른 표준셀 배치 알고리즘)

  • 조환규;경종민
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.6
    • /
    • pp.1074-1079
    • /
    • 1987
  • We present a fast, constructive algorithm for the automatic placement of standard cells, which consists of two steps. The first step is responsible for cell-row assignment of each cell, and converts the circuit connectivity into a multi-stage graph under to constraint that sum of the cell-widths in each stage of the multi-state graph does not exceed maximum cell-row width. Generatin of feed-through cells in the final layout was shown to be drastically reduced by this step. In the second step, the position of each cell within the row is determined one by one from left to right so that the cost function such as the local channel density is minimized. Our experimental result shows that this algorithm yields near optimal results in terms of the number of feed-through cells and the horizontal tracks, while running about 100 times faster than other iterative procedures such as pairwise interchange and generalized force directed relaxation method.

  • PDF

A comparative study of low-complexity MMSE signal detection for massive MIMO systems

  • Zhao, Shufeng;Shen, Bin;Hua, Quan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1504-1526
    • /
    • 2018
  • For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

comparison of Numercal Methods for Obtaining 2-D Impurity Profile in Semiconductor (반도체 내에서의 2차원 불순물 분포를 얻기 위한 수치해법의 비교)

  • Yang, Yeong-Il;Gyeong, Jong-Min;O, Hyeong-Cheol
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.3
    • /
    • pp.95-102
    • /
    • 1985
  • An efficient numerical scheme for assessing the two-dimensional diffusion problem for modelling impurity profile in semiconductor is described. 4 unique combination of ADI (Al-ternating Direction Bmplicit) method and Gauss Elimination has resulted in a reduction of CPU time for most diffusion processes by a factor of 3, compared to other iteration schemes such as SOR (Successive Over-Relaxation) or Stone's iterative method without additional storage re-quirement. Various numerical schemes were compared for 2-D as well as 1-0 diffusion profile in terms of their CPU time while retaining the magnitude of relative error within 0.001%. good agree-ment between 1-D and 2-D simulation profile as well as between 1-D simulation profile and experiment has been obtained.

  • PDF

AN ASSESSMENT OF PARALLEL PRECONDITIONERS FOR THE INTERIOR SPARSE GENERALIZED EIGENVALUE PROBLEMS BY CG-TYPE METHODS ON AN IBM REGATTA MACHINE

  • Ma, Sang-Back;Jang, Ho-Jong
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.435-443
    • /
    • 2007
  • Computing the interior spectrum of large sparse generalized eigenvalue problems $Ax\;=\;{\lambda}Bx$, where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance.

Effect of the boundary shape of weld specimen on the stress distribution (용접시편의 테두리 모양이 응력 분포에 미치는 영향)

  • Yang, Seung-Yong;Goo, Byeong-Choon
    • Proceedings of the KSME Conference
    • /
    • 2004.11a
    • /
    • pp.348-352
    • /
    • 2004
  • In finite element analysis of mechanical behavior of weld, typical process is first to obtain a finite element model containing residual stress by conducting welding analysis and then to examine the computational specimen for various external loading. The numerical specimen with residual stress has irregular boundary lines since one usually begins the welding analysis from a body having regular straight boundary lines and large thermal contraction takes place during cooling of weld metal. We notice that these numerical weld specimens are different from the real weld specimens as the real specimens are usually cut from a bigger weld part and consequently have straight boundaries neglecting elastic relaxation associated with the cutting. In this paper, an iterative finite element method is described to obtain a weld specimen which is bounded by straight lines. The stress distributions of two types of weld specimen, one with regular and the other with irregular boundaries, are compared to check the effect of the boundary shape. Results show that the stress distribution can be different when large plastic deformation is induced by the application of external loading. In case of elastic small deformation, the difference turns out almost negligible.

  • PDF

Robust Secure Transmit Design with Artificial Noise in the Presence of Multiple Eavesdroppers

  • Liu, Xiaochen;Gao, Yuanyuan;Sha, Nan;Zang, Guozhen;Wang, Shijie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2204-2224
    • /
    • 2021
  • This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel. To enhance security of communication link, the artificial noise (AN) is generated at transmitter. We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers. The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs). The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly. To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP). Additionally, the secrecy rate maximization is explored for fixed total transmit power. To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA). The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

AMG-CG method for numerical analysis of high-rise structures on heterogeneous platforms with GPUs

  • Li, Zuohua;Shan, Qingfei;Ning, Jiafei;Li, Yu;Guo, Kaisheng;Teng, Jun
    • Computers and Concrete
    • /
    • v.29 no.2
    • /
    • pp.93-105
    • /
    • 2022
  • The degrees of freedom (DOFs) of high-rise structures increase rapidly due to the need for refined analysis, which poses a challenge toward a computationally efficient method for numerical analysis of high-rise structures using the finite element method (FEM). This paper presented an efficient iterative method, an algebraic multigrid (AMG) with a Jacobi overrelaxation smoother preconditioned conjugate gradient method (AMG-CG) used for solving large-scale structural system equations running on heterogeneous platforms with parallel accelerator graphics processing units (GPUs) enabled. Furthermore, an AMG-CG FEM application framework was established for the numerical analysis of high-rise structures. In the proposed method, the coarsening method, the optimal relaxation coefficient of the JOR smoother, the smoothing times, and the solution method for the coarsest grid of an AMG preconditioner were investigated via several numerical benchmarks of high-rise structures. The accuracy and the efficiency of the proposed FEM application framework were compared using the mature software Abaqus, and there were speedups of up to 18.4x when using an NVIDIA K40C GPU hosted in a workstation. The results demonstrated that the proposed method could improve the computational efficiency of solving structural system equations, and the AMG-CG FEM application framework was inherently suitable for numerical analysis of high-rise structures.