• Title/Summary/Keyword: linear approximation

Search Result 749, Processing Time 0.028 seconds

Development of a Flow Analysis Code Using an Unstructured Grid with the Cell-Centered Method

  • Myong, Hyon-Kook;Kim, Jong-Tae
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.12
    • /
    • pp.2218-2229
    • /
    • 2006
  • A conservative finite-volume numerical method for unstructured grids with the cell-centered method has been developed for computing flow and heat transfer by combining the attractive features of the existing pressure-based procedures with the advances made in unstructured grid techniques. This method uses an integral form of governing equations for arbitrary convex polyhedra. Care is taken in the discretization and solution procedure to avoid formulations that are cell-shape-specific. A collocated variable arrangement formulation is developed, i.e. all dependent variables such as pressure and velocity are stored at cell centers. For both convective and diffusive fluxes the forms superior to both accuracy and stability are particularly adopted and formulated through a systematic study on the existing approximation ones. Gradients required for the evaluation of diffusion fluxes and for second-order-accurate convective operators are computed by using a linear reconstruction based on the divergence theorem. Momentum interpolation is used to prevent the pressure checkerboarding and a segregated solution strategy is adopted to minimize the storage requirements with the pressure-velocity coupling by the SIMPLE algorithm. An algebraic solver using iterative preconditioned conjugate gradient method is used for the solution of linearized equations. The flow analysis code (PowerCFD) developed by the present method is evaluated for its application to several 2-D structured-mesh benchmark problems using a variety of unstructured quadrilateral and triangular meshes. The present flow analysis code by using unstructured grids with the cell-centered method clearly demonstrate the same accuracy and robustness as that for a typical structured mesh.

Stable Mass-Spring Model for Real-time Animation of Flexible Objects (비정형 물체의 실시간 애니메이션을 위한 안정적 질량-스프링 모델)

  • Gang, Yeong-Min;Jo, Hwan-Gyu;Park, Chan-Jong
    • Journal of the Korea Computer Graphics Society
    • /
    • v.5 no.1
    • /
    • pp.27-33
    • /
    • 1999
  • In this paper, we propose an efficient technique for the animation of flexible thin objects. Mass-spring model was employed to represent the flexible objects. Till now, many techniques have used the mass-spring model to generate plausible animation of soft objects. A straight-forward approach to the animation with mass-spring model is explicit Euler method, but the explicit Euler method has serious disadvantage that it suffers from 'instability problem'. The implicit integration method is a possible solution to overcome the instability problem. However, the most critical flaw of the implicit method is that it involves a large linear system. This paper presents a fast animation technique for mass-spring model with approximated implicit method. The proposed technique stably updates the state of n mass-points in O(n) time when the number of total springs are O(n). We also consider the interaction of the flexible object and air in order to generate plausible results.

  • PDF

The configuration Optimization of Truss Structure (트러스 구조물의 형상최적화에 관한 연구)

  • Lim, Youn Su;Choi, Byoung Han;Lee, Gyu Won
    • Journal of Korean Society of Steel Construction
    • /
    • v.16 no.1 s.68
    • /
    • pp.123-134
    • /
    • 2004
  • In this research, a multilevel decomposition technique to enhance the efficiency of the configuration optimization of truss structures was proposed. On the first level, the nonlinear programming problem was formulated considering cross-sectional areas as design variables, weight, or volume as objective function and behavior under multiloading condition as design constraint. Said nonlinear programming problem was transformed into a sequential linear programming problem. which was effective in calculation through the approximation of member forces using behavior space approach. Such approach has proven to be efficient in sensitivity analysis and different form existing shape optimization studies. The modified method of feasible direction (MMFD) was used for the optimization process. On the second level, by treating only shape design variables, the optimum problem was transformed into and unconstrained optimal design problem. A unidirectional search technique was used. As numerical examples, some truss structures were applied to illustrate the applicability. and validity of the formulated algorithm.

Curved Feature Modeling and Accuracy Analysis Using Point Cloud Data (점군집 데이터를 이용한 곡면객체 모델링 및 정확도 분석)

  • Lee, Dae Geon;Yoo, Eun Jin;Lee, Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.3
    • /
    • pp.243-251
    • /
    • 2016
  • LiDAR data processing steps include noise removal, filtering, classification, segmentation, shape recognition, modeling, and quality assessment. This paper focuses on modeling and accuracy evaluation of 3D objects with curved surfaces. The appropriate modeling functions were determined by analyzing surface patch shape. Existing methods for modeling curved surface features require linearization, initial approximation, and iteration of the non-linear functions. However, proposed method could directly estimate the unknown parameters of the modeling functions. The results demonstrate feasibility of the proposed method. The proposed method was applied to the simulated and real building data of hemi-spherical and semi-cylindrical surfaces. The parameters and accuracy of the modeling functions were estimated. It is expected that the proposed method would contribute to automatic modeling of various objects.

Biokinetics of Protein Degrading Clostridium cadaveris and Clostridium sporogenes in Batch and Continuous Mode of Operations

  • Koo, Taewoan;Jannat, Md Abu Hanifa;Hwang, Seokhwan
    • Journal of Microbiology and Biotechnology
    • /
    • v.30 no.4
    • /
    • pp.533-539
    • /
    • 2020
  • A quantitative real-time polymerase chain reaction (QPCR) was applied to estimate biokinetic coefficients of Clostridium cadaveris and Clostridium sporogenes, which utilize protein as carbon source. Experimental data on changes in peptone concentration and 16S rRNA gene copy numbers of C. cadaveris and C. sporogenes were fitted to model. The fourth-order Runge-Kutta approximation with non-linear least squares analysis was employed to solve the ordinary differential equations to estimate biokinetic coefficients. The maximum specific growth rate (μmax), half-saturation concentration (Ks), growth yield (Y), and decay coefficient (Kd) of C. cadaveris and C.sporogenes were 0.73 ± 0.05 and 1.35 ± 0.32 h-1, 6.07 ± 1.52 and 5.67 ± 1.53 g/l, 2.25 ± 0.75 × 1010 and 7.92 ± 3.71 × 109 copies/g, 0.002 ± 0.003 and 0.002 ± 0.001 h-1, respectively. The theoretical specific growth rate of C. sporogenes always exceeded that of C. cadaveris at peptone concentration higher than 3.62 g/l. When the influent peptone concentration was 5.0 g/l, the concentration of C.cadaveris gradually decreased to the steady value of 2.9 × 1010 copies/ml at 4 h Hydraulic retention time (HRT), which indicates a 67.1% reduction of the initial population, but the wash out occurred at HRTs of 1.9 and 3.2 h. The 16S rRNA gene copy numbers of C. sporogenes gradually decreased to steady values ranging from 1.1 × 1010 to 2.9 × 1010 copies/ml. C. sporogenes species was predicted to wash out at an HRT of 1.6 h.

Family of Cascade-correlation Learning Algorithm (캐스케이드-상관 학습 알고리즘의 패밀리)

  • Choi Myeong-Bok;Lee Sang-Un
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.1
    • /
    • pp.87-91
    • /
    • 2005
  • The cascade-correlation (CC) learning algorithm of Fahlman and Lebiere is one of the most influential constructive algorithm in a neural network. Cascading the hidden neurons results in a network that can represent very strong nonlinearities. Although this power is in principle useful, it can be a disadvantage if such strong nonlinearity is not required to solve the problem. 3 models are presented and compared empirically. All of them are based on valiants of the cascade architecture and output neurons weights training of the CC algorithm. Empirical results indicate the followings: (1) In the pattern classification, the model that train only new hidden neuron to output layer connection weights shows the best predictive ability; (2) In the function approximation, the model that removed input-output connection and used sigmoid-linear activation function is better predictability than CasCor algorithm.

Performance Analysis on Various Design Issues of Quasi-Cyclic Low Density Parity Check Decoder (Quasi-Cyclic Low Density Panty Check 복호기의 다양한 설계 관점에 대한 성능분석)

  • Chung, Su-Kyung;Park, Tae-Geun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.11
    • /
    • pp.92-100
    • /
    • 2009
  • In this paper, we analyze the hardware architecture of Low Density Parity Check (LDPC) decoder using Log Likelihood Ration-Belief Propagation (LLR-BP) decoding algorithm. Various design issues that affect the decoding performance and the hardware complexity are discussed and the tradeoffs between the hardware complexity and the performance are analyzed. The message data for passing error probability is quantized to 7 bits and among them the fractional part is 4 bits. To maintain the decoding performance, the integer and fractional parts for the intrinsic information is 2 bits and 4 bits respectively. We discuss the alternate implementation of $\Psi$(x) function using piecewise linear approximation. Also, we improve the hardware complexity and the decoding time by applying overlapped scheduling.

A Design of OFDM Signal for Reducing the ICI Caused by Phase Noise (위상잡음에 의한 ICI를 제거하기 위한 OFDM 신호 설계)

  • Li Yingshan;Hieu Nguyen Thanh;Ryu Heung-Gyoon;Jeong Young-Hoo;Hahm Young-Kown
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.3 s.94
    • /
    • pp.319-326
    • /
    • 2005
  • In the multi-carrier OFDM communication system for the high data rate transmission, the ICI caused by phase noise of transceiver local oscillator may degrade the system performance seriously. In this paper, a new ICI self-cancellation scheme using data-conjugate method is proposed to reduce the ICI caused by phase noise effectively. Then, the CPE, ICI and CIR are derived by the phase noise linear approximation method. Besides, to analyze the efficiency of system performance improvement, the proposed method is compared with the original OFDM and the conventional ICI self-cancellation scheme using data-conversion method. As results, the performance degradation caused by ICI can be mitigated effectively in the OFDM system with ICI self-cancellation scheme, and more performance improvement can be achieved by the proposed ICI self-cancellation scheme using data-conjugate method than the conventional ICI self-cancellation scheme using data-conversion method when phase noise exists.

Phase Noise Compensation in OFDM Communication System by STFBC Method (OFDM 통신 시스템에서 STFBC 기법을 이용한 위상잡음 보상)

  • Li Yingshan;Ryu Heung-Gyoon;Jeong YoungHo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.10 s.101
    • /
    • pp.1043-1049
    • /
    • 2005
  • In OFDM system suitable for high capacity high speed broadband transmission, ICI caused by phase noise degrades system performance seriously by destroying the orthogonality among subcarriers. In this paper, a new STFBC method combining ICI self cancellation scheme and antenna, time, frequency diversity is studied to reduce ICI effectively. CPE and ICI are analyzed by the phase noise linear approximation method in the proposed STFBC OFDM system. CIR, PICR and BER are discussed to compare the system performance degraded by phase noise of PLL. As results, STFBC method significantly reduces ICI. Furthermore, the SCI that usually happens in the traditional STBC, SFBC diversity coding method can be easily avoided.

Real-Time Lane Detection Based on Inverse Perspective Transform and Search Range Prediction (역 원근 변환과 검색 영역 예측에 의한 실시간 차선 인식)

  • Jeong, Seung-Gweon;Kim, In-Soo;Kim, Sung-Han;Lee, Dong-Hwoal;Yun, Kang-Sup;Lee, Man-Hyung
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.3
    • /
    • pp.68-74
    • /
    • 2001
  • A lane detection based on a road model or feature all needs correct acquirement of information on the lane in an image. It is inefficient to implement a lane detection algorithm through the full range of an image when it is applied to a real road in real time because of the calculating time. This paper defines two (other proper terms including"modes") for detecting lanes on a road. First is searching mode that is searching the lane without any prior information of a road. Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It allows to extract accurately and efficiently the edge candidate points of a lane without any unnecessary searching. By means of inverse perspective transform which removes the perspective effect on the edge candidate points, we transform the edge candidate information in the Image Coordinate System(ICS) into the plan-view image in the World Coordinate System(WCS). We define a linear approximation filter and remove faulty edge candidate points by using it. This paper aims at approximating more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.e fitting.

  • PDF