• Title/Summary/Keyword: Fibonacci search

Search Result 5, Processing Time 0.021 seconds

Maximum Power Point Tracking Control Employing Fibonacci Search Algorithm for Photovoltaic Power Generation System

  • Miyatake Masafumi;Kouno Tooru;Nakano Motomu
    • Proceedings of the KIPE Conference
    • /
    • 2001.10a
    • /
    • pp.622-625
    • /
    • 2001
  • Photovoltaic generation systems need MPPT (Maximum Power Point Tracking) control because the output power depends on the operating voltage and current. Therefore, many researchers propose various types of MPPT control methods. A new MPPT control scheme is proposed in this paper in order to realize higher efficiency with simple calculation. The line search algorithm with fibonacci sequence which is one of the optimizing method is employed for the MPPT. The line search method is modified for real-time operation. The method is verified by simulations and experiments. It is concluded that the scheme can respond fast variation of irradiance.

  • PDF

Finite Element Analysis of Electromagnetic Systems Considering Hysteresis Characteristics (히스테리시스 특성을 고려한 전자계의 유한 요소 해석)

  • Kim, Hong-Gyu;Hong, Seon-Gi;Jeong, Hyeon-Gyo
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.48 no.3
    • /
    • pp.118-123
    • /
    • 1999
  • This paper describes the finite element procedure including the magnetic hysteresis phenomena. The magnetization-dependent Preisach model is employed to simulate the magnetic hysteresis and applied to each elements. Magnetization is calculated by the Fibonacci search method for the applied field in the implementation of the magnetization-dependent model. This can calculate the magnetization very accurately with small iteration numbers. The magnetic field intensity and the magnetization corresponding to the magnetic flux density obtained by the finite element analysis(FEA) are computed at the same time under the condition that these balues must satisfy the constitutive equation. In order to reduce the total calculation cost, pseudo-permeability is used for the input for the FEA. It is found that the presented method is very useful in combining the hysteresis model with the finite element method.

  • PDF

The most unstable case in plane Poiseuille flow on transition by using pseudospectra method (Pseudospectra를 이용한 평행 평판 사이 유동에서 가장 불안정한 경우)

  • Choi Sangkyu;Chung Myung Kyoon
    • Proceedings of the KSME Conference
    • /
    • 2002.08a
    • /
    • pp.691-694
    • /
    • 2002
  • The most unstable situation of laminar plane Poiseuille flow for transition to turbulence is investigated by using a pseudo-spectral method. A number of various disturbance modes are tested and it is found that the flow is the most unstable when it is disturbed by an oblique wave with an angle of $29.7^{\circ}$.

  • PDF

On-Line Optimal Efficiency Control for Permanent Magnet Synchronous Motors Driving electric Vehicles (전기자동차 구동용 영구자석형 동기전동기의 온라인 최적 효율제어)

  • Chun, Tae-Won
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.43 no.4
    • /
    • pp.586-593
    • /
    • 1994
  • This paper suggests the algorithm for on-line efficiency control of permancent magnet synchronous motors driving the electric vehicles. The existance of unigue d-axis current is verified, which generates the maximum efficiency at operating points of motor. Using the Fibonacci search method, d-axis current converges to the minimization of inverter input power, and to prevent the variation of motor speed in process of the efficiency control, the voltage decoupled control strategy is introduced. Through the experiments, the effects of an efficiency control algorithm are verified.

Block Interpolation Search (블록 보간 탐색법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.157-163
    • /
    • 2017
  • The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.