• Title/Summary/Keyword: Chebyshev

Search Result 348, Processing Time 0.022 seconds

The Modified Generalized Chebyshev Filter with Two Attenuation Poles in Stopband (저지 대역에 2개의 감쇠극을 갖는 변형된 Generalized Chebyshev Filter)

  • Kim In-Seon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.4 s.95
    • /
    • pp.438-446
    • /
    • 2005
  • In this paper, the modified generalized Chebyshev rational function is presented. The new element values of prototype low pass filter are obtained by network synthesis using this rational function. This proposed filter has an equal ripple passband as same as conventional generalized Chebyshev filter, but unlike conventional filter which has only one attenuation pole at finite frequency, the proposed filter has two different from each other attenuation pole in stopband. If the harmonic frequency is set to the second attenuation pole frequency, this harmonic is suppressed efficiently. Furthermore, since the location of the second attenuation pole can be arbitrary adjusted. our filters are very available for the realization of wide stopband, particularly.

Design of a Passband Filter Using Modified Chebyshev Function (변형된 Chebyshev 함수를 이용한 대역통과 필터 설계)

  • 안정철;정국성최석우윤창훈
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.795-798
    • /
    • 1998
  • In this paper, a new class of bandpass filter using a modified Chebyshev lowpass filter function is described. The prosposed bandpass filter which exhibits diminishing ripples in the passband has maximum value at the center frequency. Due to the lower pole-Q, the performance in the frequency and time domains is improved as compared with the classical Chebyshev bandpass filter.

  • PDF

CONSTRAINED JACOBI POLYNOMIAL AND CONSTRAINED CHEBYSHEV POLYNOMIAL

  • Ahn, Young-Joon
    • Communications of the Korean Mathematical Society
    • /
    • v.23 no.2
    • /
    • pp.279-284
    • /
    • 2008
  • In this paper, we present the constrained Jacobi polynomial which is equal to the constrained Chebyshev polynomial up to constant multiplication. For degree n=4, 5, we find the constrained Jacobi polynomial, and for $n{\geq}6$, we present the normalized constrained Jacobi polynomial which is similar to the constrained Chebyshev polynomial.

Partially Implicit Chebyshev Pseudo-spectral Method for a Periodic Unsteady Flow Analysis (부분 내재적 체비셰브 스펙트럴 기법을 이용한 주기적인 비정상 유동 해석)

  • Im, Dong Kyun
    • Journal of Aerospace System Engineering
    • /
    • v.14 no.3
    • /
    • pp.17-23
    • /
    • 2020
  • In this paper, the efficient periodic unsteady flow analysis is developed by using a Chebyshev collocation operator applied to the time differential term of the governing equations. The partial implicit time integration method was also applied in the governing equation for a fluid, which means flux terms were implicitly processed for a time integration and the time derivative terms were applied explicitly in the form of the source term by applying the Chebyshev collocation operator. To verify this method, we applied the 1D unsteady Burgers equation and the 2D oscillating airfoil. The results were compared with the existing unsteady flow frequency analysis technique, the Harmonic Balance Method, and the experimental data. The Chebyshev collocation operator can manage time derivatives for periodic and non-periodic problems, so it can be applied to non-periodic problems later.

NUMERICAL IMPLEMENTATIONS OF CAUCHY-TYPE INTEGRAL EQUATIONS

  • Abbasbandy, S.;Du, Jin-Yuan
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.1
    • /
    • pp.253-260
    • /
    • 2002
  • In this paper, a good interpolation formulae are applied to the numerical solution of Cauchy integral equations of the first kind with using some Chebyshev quadrature rules. To demonstrate the effectiveness of the Radau-Chebyshev with respect to the olds, [6],[7],[8] and [121, some examples are given.

CONTINUITY OF ONE-SIDED BEST SIMULTANEOUS APPROXIMATIONS

  • Lee, Mun-Bae;Park, Sung-Ho;Rhee, Hyang-Joo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.743-753
    • /
    • 2000
  • In the space $C_1(X)$ of real-valued continuous functions with $L_1-norm$, every bounded set has a relative Chebyshev center in a finite-dimensional subspace S. Moreover, the set function $F\rightarrowZ_S(F)$ corresponding to F the set of its relative Chebyshev centers, in continuous on the space B[$C_1(X)$(X)] of nonempty bounded subsets of $C_1(X)$ (X) with the Hausdorff metric. In particular, every bounded set has a relative Chebyshev center in the closed convex set S(F) of S and the set function $F\rightarrowZ_S(F)$(F) is continuous on B[$C_1(X)$ (X)] with a condition that the sets S(.) are equal.

  • PDF

Comparison of Matrix Exponential Methods for Fuel Burnup Calculations

  • Oh, Hyung-Suk;Yang, Won-Sik
    • Nuclear Engineering and Technology
    • /
    • v.31 no.2
    • /
    • pp.172-181
    • /
    • 1999
  • Series expansion methods to compute the exponential of a matrix have been compared by applying them to fuel depletion calculations. Specifically, Taylor, Pade, Chebyshev, and rational Chebyshev approximations have been investigated by approximating the exponentials of bum matrices by truncated series of each method with the scaling and squaring algorithm. The accuracy and efficiency of these methods have been tested by performing various numerical tests using one thermal reactor and two fast reactor depletion problems. The results indicate that all the four series methods are accurate enough to be used for fuel depletion calculations although the rational Chebyshev approximation is relatively less accurate. They also show that the rational approximations are more efficient than the polynomial approximations. Considering the computational accuracy and efficiency, the Pade approximation appears to be better than the other methods. Its accuracy is better than the rational Chebyshev approximation, while being comparable to the polynomial approximations. On the other hand, its efficiency is better than the polynomial approximations and is similar to the rational Chebyshev approximation. In particular, for fast reactor depletion calculations, it is faster than the polynomial approximations by a factor of ∼ 1.7.

  • PDF

PMSM Servo Drive for V-Belt Continuously Variable Transmission System Using Hybrid Recurrent Chebyshev NN Control System

  • Lin, Chih-Hong
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.1
    • /
    • pp.408-421
    • /
    • 2015
  • Because the wheel of V-belt continuously variable transmission (CVT) system driven by permanent magnet synchronous motor (PMSM) has much unknown nonlinear and time-varying characteristics, the better control performance design for the linear control design is a time consuming job. In order to overcome difficulties for design of the linear controllers, a hybrid recurrent Chebyshev neural network (NN) control system is proposed to control for a PMSM servo-driven V-belt CVT system under the occurrence of the lumped nonlinear load disturbances. The hybrid recurrent Chebyshev NN control system consists of an inspector control, a recurrent Chebyshev NN control with adaptive law and a recouped control. Moreover, the online parameters tuning methodology of adaptive law in the recurrent Chebyshev NN can be derived according to the Lyapunov stability theorem and the gradient descent method. Furthermore, the optimal learning rate of the parameters based on discrete-type Lyapunov function is derived to achieve fast convergence. The recurrent Chebyshev NN with fast convergence has the online learning ability to respond to the system's nonlinear and time-varying behaviors. Finally, to show the effectiveness of the proposed control scheme, comparative studies are demonstrated by experimental results.