• 제목/요약/키워드: approximation technique

검색결과 558건 처리시간 0.028초

Identification of 18 flutter derivatives by covariance driven stochastic subspace method

  • Mishra, Shambhu Sharan;Kumar, Krishen;Krishna, Prem
    • Wind and Structures
    • /
    • 제9권2호
    • /
    • pp.159-178
    • /
    • 2006
  • For the slender and flexible cable supported bridges, identification of all the flutter derivatives for the vertical, lateral and torsional motions is essential for its stability investigation. In all, eighteen flutter derivatives may have to be considered, the identification of which using a three degree-of-freedom elastic suspension system has been a challenging task. In this paper, a system identification technique, known as covariance-driven stochastic subspace identification (COV-SSI) technique, has been utilized to extract the flutter derivatives for a typical bridge deck. This method identifies the stochastic state-space model from the covariances of the output-only (stochastic) data. All the eighteen flutter derivatives have been simultaneously extracted from the output response data obtained from wind tunnel test on a 3-DOF elastically suspended bridge deck section-model. Simplicity in model suspension and measurements of only output responses are additional motivating factors for adopting COV-SSI technique. The identified discrete values of flutter derivatives have been approximated by rational functions.

스테레오 영상인식을 이용한 신관폭발고도 계측기술 (Measuring Technique for Height of Burst using Stereo-vision Recognition)

  • 강규창;최주호;박원우;황의성;홍성수;유준
    • 한국군사과학기술학회지
    • /
    • 제2권1호
    • /
    • pp.194-203
    • /
    • 1999
  • This paper presents a measuring technique for bursting height of proximity fuses. This technique uses camera calibration to obtain the perspective transformation matrix describing the projection of the world coordinates to image coordinates, and calculates the world coordinates of bursting points from their image coordinates. The surface approximation algorithm by polynomial functions are also implemented.

  • PDF

버블패킹기법을 이용한 무요소 갤러킨법에 관한 연구 (Study On The Element Free Galerkin Method Using Bubble Packing Technique)

  • 정순완;최유진;김승조
    • 대한기계학회논문집A
    • /
    • 제24권10호
    • /
    • pp.2469-2476
    • /
    • 2000
  • The meshing of the domain has long been the major bottleneck in performing the finite element analysis. Research efforts which are so-called meshfree methods have recently been directed towards eliminating or at least easing the requirement for meshing of the domain. In this paper, a new meshfree method for solving nonlinear boundary value problem, based on the bubble packing technique and Delaunay triangle is proposed. The method can be efficiently implemented to the problems with singularity by using formly distributed nodes.

Source Localization Techniques for Magnetoencephalography (MEG)

  • Kwang-Ok An;Chang-Hwan Im;Hyun-Kyo Jung;Yong-Ho Lee;Hyuk-Chan Kwon
    • KIEE International Transaction on Systems and Control
    • /
    • 제2D권2호
    • /
    • pp.53-58
    • /
    • 2002
  • In this paper, various aspects in magnetoencephalography (MEG) source localization are studied. To minimize the errors in experimental data, an approximation technique using a polynomial function is proposed. The simulation shows that the proposed technique yields more accurate results. To improve the convergence characteristics in the optimization algorithm, a hybrid algorithm of evolution strategy and sensitivity analysis is applied to the neuromagnetic inverse problem. The effectiveness of the hybrid algorithm is verified by comparison with conventional algorithms. In addition, an artificial neural network (ANN) is applied to find an initial source location quickly and accurately. The simulation indicates that the proposed technique yields more accurate results effectively.

  • PDF

응답량 재사용을 통한 순차 근사최적설계 (A Sequential Approximate Optimization Technique Using the Previous Response Values)

  • 황태경;최은호;임오강
    • 대한기계학회논문집A
    • /
    • 제29권1호
    • /
    • pp.45-52
    • /
    • 2005
  • A general approximate optimization technique by sequential design domain(SDD) did not save response values for getting an approximate function in each step. It has a disadvantage at aspect of an expense. In this paper, previous response values are recycled for constructing an approximate function. For this reason, approximation function is more accurate. Accordingly, even if we did not determine move limit, a system is converged to the optimal design. Size and shape optimization using approximate optimization technique is carried out with SDD. Algorithm executing Pro/Engineer and ANSYS are automatically adopted in the approximate optimization program by SDD. Convergence criterion is defined such that optimal point must be located within SDD during the three steps. The PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information in the direction finding problem and uses the active set strategy.

Analysis of a nonuniform guiding structure by the adaptive finite-difference and singular value decomposition methods

  • Abdolshakoor Tamandani;Mohammad G. H. Alijani
    • ETRI Journal
    • /
    • 제45권4호
    • /
    • pp.704-712
    • /
    • 2023
  • This paper presents a flexible finite-difference technique for analyzing the nonuniform guiding structures. Because the voltage and current variations along the nonuniform structure differ for each segment, this work considers the adaptable discretization steps. This technique increases the accuracy of the final response. Moreover, by applying the singular value decomposition and discarding the nonprincipal singular values, an optimal lower rank approximation of the discretization matrix is obtained. The computational cost of the introduced method is significantly reduced using the optimal discretization matrix. Also, the proposed method can be extended to the nonuniform waveguides. The technique is verified by analyzing several practical transmission lines and waveguides with nonuniform profiles.

Recursive 디지털 필터 모델에 대한 역 필터링 기법 (An inverse filtering technique for the recursive digital filter model)

  • Sung-Jin Kim
    • 융합신호처리학회논문지
    • /
    • 제5권2호
    • /
    • pp.151-158
    • /
    • 2004
  • 본 논문에서는 디지털 필터 모델에 대한 역 필터링 기법을 제안한다. 이 기법은 안정한 non-causal IIR 역 필터를 안정한 causal 역 필터로 변환(근사)시키는 것이다. 실제로 이 역 필터에 대한 FIR 근사 방법을 제안한다. 전역통과 시스템에 대한 역 필터의 임펄스 응답은 그 시스템에 대한 임펄스 응답의 거울 영상(mirror image) 임을 알 수 있다. 특히 전역통과 시스템에 대한 임펄스 응답이 이러한 대칭성을 갖기 때문에, 제안한 기법은 다른 시스템 보다 전역통과 시스템에 더욱 유용하다. 제안한 역 필터링 기법을 설명하기 위하여, 네 개의 예제를 제시한다. 그들 중 둘은 전역통과 필터에 대한 것이며, 다른 두 개의 예제는 IIR과 FIR 필터에 대한 것이다. 또한 컴퓨터 시뮬레이션을 통하여 제안한 기법이 잘 동작함을 보인다.

  • PDF

효율적인 재해석 기법에 의한 철근콘크리트 교각의 최적설계 (Optimization of Reinforced Concrete Piers Based on Efficient Reanalysis Technique)

  • 조효남;민대홍;신만규
    • 한국전산구조공학회논문집
    • /
    • 제14권4호
    • /
    • pp.505-513
    • /
    • 2001
  • 본 연구에서는 지진하중을 받는 철근콘크리트(Reinforced Concrete : RC) 교각의 효율적인 최적설계 알고리즘을 제안하였다. 제안한 RC 교각 최적설계 알고리즘은 효율적인 강도재해석 기법을 기초로 하고 있다. 또한 RC 교각의 특성을 고려하여 제약조건 소거기법과 같은 근사화 기법을 도입 하였다. 기존의 최적설계 방법 비교를 통해 제안한 RC 교각의 최적설계 방법의 효율성과 신뢰성을 비교하였다. 그리고 시방서의 내진 규정에 따른 수치예제를 통하여 제안한 강도재해석기법에 의한 새로운 알고리즘이 기존의 최적설계 방법에 비해 효율성과 신뢰도가 우수하다는 것을 입증하였다.

  • PDF

Wiener-Hopf Technique와 Fourier Transform Analysis를 이용한 병렬 슬릿의 TE파 산란 해석 (Analysis of TE-Wave Scattering from Transversal-Shifted Tandem Slits Using Wiener-Hopf Techniques and Fourier Transform Analysis)

  • 서태윤;안성환;이재욱;조춘식
    • 한국전자파학회논문지
    • /
    • 제19권9호
    • /
    • pp.968-977
    • /
    • 2008
  • 본 논문에서는 Fourier-transform analysis와 Wiener-Hopf technique을 사용하여 병렬 슬릿에 의한 TE파 산란의 완전한 표현식을 유도하고 두 방법의 특징을 비교하고자 한다. Fourier transform analysis는 슬릿의 폭이 좁은 경우에는 빠른 수렴해를 얻을 수 있으며, Wiener-Hopf technique은 슬릿의 폭이 넓을 경우(상호 유도 결합이 적은 경우)에 매우 정확한 근사식 결과를 나타내며, 위의 두 해석 결과는 비교적 일치하는 결과들을 보여준다.

복소수의 대수적 정수환 근사화를 이용한 이산 후리에 변환 (The Discrete Fourier Transform Using the Complex Approximations of the Ring of Algebraic Integer)

  • 김덕현;김재공
    • 전자공학회논문지B
    • /
    • 제30B권9호
    • /
    • pp.18-26
    • /
    • 1993
  • This paper presents a multiplier free technique for the complex DFT by rotations and additions based on the complex approximation of the ring of algebraic integers. Speeding-up the computation time and reducing the dynamic range growth has been achieved by the elimination of multiplication. Moreover the DFT of no twiddle factor quantization errors is possible. Numerical examples are given to prove the algorithm and the applicable size of the DFT is 16 has been concluded.

  • PDF