• Title/Summary/Keyword: High-order interpolation

Search Result 154, Processing Time 0.025 seconds

HIGH-ORDER ADAPTIVE-GRID METHOD FOR THE ANALYSIS OF UNSTEADY COMPRESSIBLE FLOW (비정상 압축성 유동 해석을 위한 고차 정확도 적응 격자 기법의 연구)

  • Chang, S.M.;Morris, Philip J.
    • Journal of computational fluids engineering
    • /
    • v.13 no.3
    • /
    • pp.69-78
    • /
    • 2008
  • The high-order numerical method based on the adaptive mesh refinement(AMR) on the quadrilateral unstructured grids has been developed in this paper. This adaptive-grid method, originally developed with MUSCL-TVD scheme, is now extended to the WENO (weighted essentially no-oscillatory) scheme with the Runge-Kutta time integration of fifth order in spatial and temporal accuracy. The multidimensional interpolation was studied in the preliminary research, which allows us to maintain the same order of accuracy for the computation of numerical flux between two adjacent cells of different levels. Some standard benchmark tests are done to validate this method for checking the overall capacity and efficiency of the present adaptive-grid technique.

DEVELOPMENT OF A HIGH-ORDER NUMERICAL METHOD IN THE QUADRILATERAL ADAPTIVE GRIDS (사각형 적응 격자 고차 해상도 수치 기법의 개발)

  • Chang, S.M.;Morris, P.J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2006.10a
    • /
    • pp.47-50
    • /
    • 2006
  • In the aeroacoustic application of computational fluid dynamics, the physical phenomena like the crackle in the unsteady compressible jets should be based on very time-accurate numerical solution. The accuracy of the present numerical scheme is extended to the fifth order, using the WENO filter to the sixth-order central difference computation. However, the computational capacity is very restricted by the environment of computational power, so therefore the quadrilateral adaptive grids technique is introduced for this high-order accuracy scheme. The first problem is the multi-dimensional interpolation between fine and coarse grids. Some general benchmark problems are solved to show the effectiveness of this method.

  • PDF

Kirchhoff Plate Analysis by Using Hermite Reproducing Kernel Particle Method (HRKPM을 이용한 키르히호프 판의 해석)

  • 석병호;송태한
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.5
    • /
    • pp.67-72
    • /
    • 2003
  • For the analysis of Kirchhoff plate bending problems, a new meshless method is implemented. For the satisfaction of the $C^1$ continuity condition in which the first derivative is treated an another primary variable, Hermite interpolation is enforced on standard reproducing kernel particle method. In order to impose essential boundary conditions on solving $C^1$ continuity problems, shape function modifications are adopted. Through numerical tests, the characteristics and accuracy of the HRKPM are investigated and compared with the finite element analysis. By this implementatioa it is shown that high accuracy is achieved by using HRKPM for solving Kirchhoff plate bending problems.

A Comparative Study on the Spatial Statistical Models for the Estimation of Population Distribution

  • Oh, Doo-Ri;Hwang, Chul Sue
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.3
    • /
    • pp.145-153
    • /
    • 2015
  • This study aims to accurately estimate population distribution more specifically than administrative unites using a RK (Regression-Kriging) model. The RK model is the areal interpolation technique that involves linear regression and the Kriging model. In order to estimate a population’s distribution using a sample region, four different models were used, namely; a regression model, RK model, OK (Ordinary Kriging) model and CK (Co-Kriging) model. The results were then compared with each other. Evaluation of the accuracy and validity of evaluation analysis results were the basis RMSE (Root Mean Square Error), MAE (Mean Absolute Error), G statistic and correlation coefficient (ρ). In the sample regions, every statistic value of the RK model showed better results than other models. The results of this comparative study will be useful to estimate a population distribution of the metropolitan areas with high population density

GENERALIZED SYMMETRICAL SIGMOID FUNCTION ACTIVATED NEURAL NETWORK MULTIVARIATE APPROXIMATION

  • ANASTASSIOU, GEORGE A.
    • Journal of Applied and Pure Mathematics
    • /
    • v.4 no.3_4
    • /
    • pp.185-209
    • /
    • 2022
  • Here we exhibit multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝN, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are achieved by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by the generalized symmetrical sigmoid function. The approximations are point-wise and uniform. The related feed-forward neural network is with one hidden layer.

PARAMETRIZED GUDERMANNIAN FUNCTION RELIED BANACH SPACE VALUED NEURAL NETWORK MULTIVARIATE APPROXIMATIONS

  • GEORGE A. ANASTASSIOU
    • Journal of Applied and Pure Mathematics
    • /
    • v.5 no.1_2
    • /
    • pp.69-93
    • /
    • 2023
  • Here we give multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝN, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are derived by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by a parametrized Gudermannian sigmoid function. The approximations are pointwise and uniform. The related feed-forward neural network is with one hidden layer.

Area-efficient Interpolation Architecture for Soft-Decision List Decoding of Reed-Solomon Codes (연판정 Reed-Solomon 리스트 디코딩을 위한 저복잡도 Interpolation 구조)

  • Lee, Sungman;Park, Taegeun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.59-67
    • /
    • 2013
  • Reed-Solomon (RS) codes are powerful error-correcting codes used in diverse applications. Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The algorithm requires very intensive computations for interpolation, therefore an efficient VLSI architecture, which is realizable in hardware with a moderate hardware complexity, is mandatory for various applications. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list decoding of Reed-Solomon codes. The proposed architecture processes the candidate polynomial in such a way that the terms of X degrees are processed in serial and the terms of Y degrees are processed in parallel. The processing order of candidate polynomials adaptively changes to increase the efficiency of memory access for coefficients; this minimizes the internal registers and the number of memory accesses and simplifies the memory structure by combining and storing data in memory. Also, the proposed architecture shows high hardware efficiency, since each module is balanced in terms of latency and the modules are maximally overlapped in schedule. The proposed interpolation architecture for the (255, 239) RS list decoder is designed and synthesized using the DongbuHitek $0.18{\mu}m$ standard cell library, the number of gate counts is 25.1K and the maximum operating frequency is 200 MHz.

Performance Evaluation of Channel Estimation Algorithm for Pilot Symbol-Assisted IMT-2000 System over Multipath Rayleigh Fading Channel (다중경로 레일레이 페이딩 채널에서 파일럿 심볼 구조의 IMT-2000 시스템의 채널추정 알고리즘 성능평가)

  • 구제길;최형진
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.7
    • /
    • pp.1128-1138
    • /
    • 2000
  • This paper presents two different approaches for channel estimation of IMT-2000 pilot symbol-assisted W-CDMA reverse link over Rayleigh fading channels of one and two paths. By obtaining BER performance through computer simulations, the proposed algorithms of 2-point second-order interpolation and IDD BWMA are compared with the performance of existing interpolation and adaptive algorithms. The BER performance of the proposed algorithms is superior to WMSA, linear and second-order Gaussian interpolation, LMS, and RLS algorithm in fast fading channels. In particular, the BER performance of the IDD BWMA algorithm is nearly insensitive for Doppler frequency within simulation range $E_b/N_0$ = 28 dB. The two proposed algorithms also have relatively simple structure and similar processing delay in comparison to the existing algorithms. Therefore, these algorithms are more suitable for high-speed mobile communication environments.

  • PDF

New De-interlacing Algorithm Combining Edge Dependent Interpolation and Global Motion Compensation Based on Horizontal and Vertical Patterns (수평, 수직 패턴에 기반 한 경계 방향 보간과 전역 움직임 보상을 고려한 새로운 순차주사화 알고리즘)

  • 박민규;이태윤;강문기
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.43-53
    • /
    • 2004
  • In this paper, we propose a robust deinterlacing algorithm which combines edge dependent interpolation (EDI) and global motion compensation (GMC). Generally, EDI algorithm shows a visually better performance than any other deinterlacing algorithm using one field. However, due to the restriction of information in one field, a high duality progressive image from Interlaced sources cannot be acquired by intrafield methods. On the contrary, since algorithms based on motion compensation make use of not only spatial information but also temporal information, they yield better results than those of using one field. However, performance of algorithms based on motion compensation depends on the performance of motion estimation. Hence, the proposed algorithm makes use of mixing process of EDI and GMC. In order to obtain the best result, an adaptive thresholding algorithm for detecting the failure of GMC is proposed. Experimental results indicate that the proposed algorithm outperforms the conventional approaches with respect to both objective and subjective criteria.

A Deblurring Algorithm Combined with Edge Directional Color Demosaicing for Reducing Interpolation Artifacts (컬러 보간 에러 감소를 위한 에지 방향성 컬러 보간 방법과 결합된 디블러링 알고리즘)

  • Yoo, Du Sic;Song, Ki Sun;Kang, Moon Gi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.205-215
    • /
    • 2013
  • In digital imaging system, Bayer pattern is widely used and the observed image is degraded by optical blur during image acquisition process. Generally, demosaicing and deblurring process are separately performed in order to convert a blurred Bayer image to a high resolution color image. However, the demosaicing process often generates visible artifacts such as zipper effect and Moire artifacts when performing interpolation across edge direction in Bayer pattern image. These artifacts are emphasized by the deblurring process. In order to solve this problem, this paper proposes a deblurring algorithm combined with edge directional color demosaicing method. The proposed method is consisted of interpolation step and region classification step. Interpolation and deblurring are simultaneously performed according to horizontal and vertical directions, respectively during the interpolation step. In the region classification step, characteristics of local regions are determined at each pixel position and the directionally obtained values are region adaptively fused. Also, the proposed method uses blur model based on wave optics and deblurring filter is calculated by using estimated characteristics of local regions. The simulation results show that the proposed deblurring algorithm prevents the boosting of artifacts and outperforms conventional approaches in both objective and subjective terms.