• Title/Summary/Keyword: Iterative Approach

Search Result 500, Processing Time 0.025 seconds

Iterative Regression Optimization of Two-Parameters in Micellar Liquid Chromatography (미셀 액체 크로마토그래피에서 두 가지 파라미터의 반복 회귀 최적화)

  • Kim, In-Whan;Kim, Sang-Tae
    • Analytical Science and Technology
    • /
    • v.6 no.3
    • /
    • pp.267-274
    • /
    • 1993
  • The iterative regression optimization strategy using two parameters is described and applied to the separation of amino acids and peptides by means of micellar liquid chromatography. The parameters examined are concentration of surfactant and 2-propanol. This approach results in a efficient optimization using a small number of initial experiments.

  • PDF

Quasi-Cyclic Low-Density Parity-Check Codes with Large Girth Based on Euclidean Geometries (유클리드 기하학 기반의 넓은 둘레를 가지는 준순환 저밀도 패리티검사 코드)

  • Lee, Mi-Sung;Jiang, Xueqin;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.11
    • /
    • pp.36-42
    • /
    • 2010
  • This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES

  • Ali Beik, Fatemeh Panjeh;Salkuyeh, Davod Khojasteh
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.2
    • /
    • pp.349-372
    • /
    • 2015
  • This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

Three-Dimensional Shape Reconstruction from Images by Shape-from-Silhouette Technique and Iterative Triangulation

  • Cho, Jung-Ho;Samuel Moon-Ho Song
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.11
    • /
    • pp.1665-1673
    • /
    • 2003
  • We propose an image-based three-dimensional shape determination system. The shape, and thus the three-dimensional coordinate information of the 3-D object, is determined solely from captured images of the 3-D object from a prescribed set of viewpoints. The approach is based on the shape-from-silhouette (SFS) technique, and the efficacy of the SFS method is tested using a sample data set. The extracted three-dimensional shape is modeled with polygons generated by a new iterative triangulation algorithm, and the polygon model can be exported to commercial software. The proposed system may be used to visualize the 3-D object efficiently, or to quickly generate initial CAD data for reverse engineering purposes, including three dimensional design applications such as 3-D animation and 3-D games.

An Approach for the Automatic Box-Jenkins Modelling

  • Park, Sung-Joo;Hong, Chang-Soo;Jeon, Tae-Joon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.10 no.1
    • /
    • pp.17-25
    • /
    • 1984
  • The use of Box-Jenkins technique is still very limited due to the high level of knowledge required in comprehending the technique and the cumbersome iterative procedure which requires a large amount of cost and time. This paper proposes a method of automating the univariate Box-Jekins modelling to overcome the limitations of subjective identification in iterative procedure by using Variate Difference method, D-statistic and Pattern Recognition algorithm combined with Akaike's Information Criterion. The results of the application to real data show that the average performance of automatic modelling procedure is better or not worse, at least, than those of the existing models which have been manually set up and reported in the literature.

  • PDF

A NON-ITERATIVE RECONSTRUCTION METHOD FOR AN INVERSE PROBLEM MODELED BY A STOKES-BRINKMANN EQUATIONS

  • Hassine, Maatoug;Hrizi, Mourad;Malek, Rakia
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.5
    • /
    • pp.1079-1101
    • /
    • 2020
  • This work is concerned with a geometric inverse problem in fluid mechanics. The aim is to reconstruct an unknown obstacle immersed in a Newtonian and incompressible fluid flow from internal data. We assume that the fluid motion is governed by the Stokes-Brinkmann equations in the two dimensional case. We propose a simple and efficient reconstruction method based on the topological sensitivity concept. The geometric inverse problem is reformulated as a topology optimization one minimizing a least-square functional. The existence and stability of the optimization problem solution are discussed. A topological sensitivity analysis is derived with the help of a straightforward approach based on a penalization technique without using the classical truncation method. The theoretical results are exploited for building a non-iterative reconstruction algorithm. The unknown obstacle is reconstructed using a levelset curve of the topological gradient. The accuracy and the robustness of the proposed method are justified by some numerical examples.

Lateral vibration control of a low-speed maglev vehicle in cross winds

  • Yau, J.D.
    • Wind and Structures
    • /
    • v.15 no.3
    • /
    • pp.263-283
    • /
    • 2012
  • This paper presents a framework of nonlinear dynamic analysis of a low-speed moving maglev (magnetically levitated) vehicle subjected to cross winds and controlled using a clipped-LQR actuator with time delay compensation. A four degrees-of-freedom (4-DOFs) maglev-vehicle equipped with an onboard PID (Proportional-Integral-Derivative) controller traveling over guideway girders was developed to regulate the electric current and control voltage. With this maglev-vehicle/guideway model, dynamic interaction analysis of a low-speed maglev vehicle with guideway girders was conducted using an iterative approach. Considering the time-delay issue of unsynchronized tuning forces in control process, a clipped-LQR actuator with time-delay compensation is developed to improve control effectiveness of lateral vibration of the running maglev vehicle in cross winds. Numerical simulations demonstrate that although the lateral response of the maglev vehicle moving in cross winds would be amplified significantly, the present clipped-LQR controller exhibits its control performance in suppressing the lateral vibration of the vehicle.

Novel Analysis of Waveguide Stub Structure Using Iterative Green's Function Method (반복 그린 함수 방법을 이용한 도파관 스텁 구조의 새로운 해석법)

  • Cho, Yong-Heui
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.125-131
    • /
    • 2007
  • An iterative Green's function method (IGFM) is introduced in order to analyze complex electromagnetic waveguide stub structures in view of a university student. The IGFM utilizes a Green's function approach and an regional iteration scheme. A physical iteration mechanism with simple mathematical equations facilitates clear formulations of the IGFM. Scattering characteristics of a standard E-plane T-junction stub in a parallel-plate waveguide are theoretically investigated in terms of the IGFM. Numerical computations illustrate the characteristics of reflection and transmission powers versus frequency.

Implementation of a Direct Learning Control Law for the Trajectory Tracking Control of a Robot (로봇의 궤적추종제어를 위한 직접학습 제어법칙의 구현)

  • Kim, Jin-Hyoung;Ahn, Hyun-Sik;Kim, Do-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • pp.694-696
    • /
    • 2000
  • In this paper, the Direct Learning Control is applied to robot's trajectory tracking control to solve the problem that lies in the existing Iterative Learning Control(ILC) and the tracking Performance is analyzed and the better approach is searched using computer simulation and experiments. It is assumed that the Direct Learning Control(DLC) is saved onto memory basically after obtaining control input Profiles for several Periodic output trajectories using the ILC. In case the new output trajectory has special relations with the previous output trajectories, there is an advantage that the desired control input profile can be obtained without iterative executions only using the DLC. The robot's tracking control system is comprised of DSP chip. A/D converter, D/A converter and high-speed pulse counter included in the control board and the performance is examined by carrying out the tracking control for the given output trajectory.

  • PDF

Pipelined Scheduling for Dynamically Reconfigurable FPGAs

  • Harashima, Katsumi;Minami, Yuuki;Kutsuwa, Toshiro
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1276-1279
    • /
    • 2002
  • In order to satisfy the requirement for various applications in an electronic device, many dynamically reconfigurable systems such as FPGAs have been used recently. This paper presents a pipelined scheduling for dynamically reconfigurable systems based on FPGAs. For reconfigurable systems conventional schedulings have reduced processing time by minimizing the number of reconfigurations. However, they are not effective enough for applications including many iterative processes such as digital signal processing. Our approach has been able to increase throughput of iterative applications on dynamically reconfigurable systems by using pipelined scheduling.

  • PDF