• Title/Summary/Keyword: Radial basis functions (RBFs)

Search Result 11, Processing Time 0.022 seconds

DEVELOPMENT OF TERRAIN CONTOUR MATCHING ALGORITHM FOR THE AIDED INERTIAL NAVIGATION USING RADIAL BASIS FUNCTIONS

  • Gong, Hyeon-Cheol
    • Journal of Astronomy and Space Sciences
    • /
    • v.15 no.1
    • /
    • pp.229-234
    • /
    • 1998
  • We study on a terrain contour matching algorithm using Radial Basis Functions(RBFs) for aided inertial navigation system for position fixing aircraft, cruise missiles or re-entry vehicles. The parameter optimization technique is used for updating the parameters describing the characteristics of an area with modified Gaussian least square differential correction algorithm and the step size limitation filter according to the amount of updates. We have applied the algorithm for matching a sampled area with a target area supposed that the area data are available from Radar Terrain Sensor(RTS) and Reference Altitude Sensor(RAS)

  • PDF

SOLVING PARTIAL DIFFERENTIAL ALGEBRAIC EQUATIONS BY COLLOCATION AND RADIAL BASIS FUNCTIONS

  • Bao, Wendi;Song, Yongzhong
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.951-969
    • /
    • 2012
  • In this paper, we propose a class of meshless collocation approaches for the solution of time dependent partial differential algebraic equations (PDAEs) in terms of a radial basis function interpolation numerical scheme. Kansa's method and the Hermite collocation method (HCM) for PDAEs are given. A sensitivity analysis of the solutions from different shape parameter c is obtained by numerical experiments. With use of the random collocation points, we have obtain the more accurate solution by the methods than those by the finite difference method for the PDAEs with index-2, i.e, we avoid the influence from an index jump of PDAEs in some degree. Several numerical experiments show that the methods are efficient.

A Method for RBF-based Approximate Optimization of Expensive Black Box Functions (고비용 블랙박스 함수의 RBF기반 근사 최적화 기법)

  • Park, Sangkun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.21 no.4
    • /
    • pp.443-452
    • /
    • 2016
  • This paper proposes a method for expensive black box optimization using radial basis functions (RBFs). The proposed algorithm is a computational strategy that uses a RBF model approximating the expensive black box function to predict an optimum. First, a RBF-based approximation technique is introduced and a sampling plan for estimation of the black box function is described. Then the proposed algorithm is explained, which presents the pseudo-codes for implementation and the detailed description of each step performed in the optimization process. In addition, numerical experiments will be given to analyze the performance of the proposed algorithm, by investigating computation accuracy, number of function evaluations, and convergence history. Finally, geometric distance problem as application example will be also presented for showing the algorithm applicability to different engineering problems.

MESHLESS AND HOMOTOPY PERTURBATION METHODS FOR ONE DIMENSIONAL INVERSE HEAT CONDUCTION PROBLEM WITH NEUMANN AND ROBIN BOUNDARY CONDITIONS

  • GEDEFAW, HUSSEN;GIDAF, FASIL;SIRAW, HABTAMU;MERGIAW, TADESSE;TSEGAW, GETACHEW;WOLDESELASSIE, ASHENAFI;ABERA, MELAKU;KASSIM, MAHMUD;LISANU, WONDOSEN;MEBRATE, BENYAM
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.675-694
    • /
    • 2022
  • In this article, we investigate the solution of the inverse problem for one dimensional heat equation with Neumann and Robin boundary conditions, that is, we determine the temperature and source term with given initial and boundary conditions. Three radial basis functions(RBFs) have been used for numerical solution, and Homotopy perturbation method for analytic solution. Numerical solutions which are obtained by considering each of the three RBFs are compared to the exact solution. For appropriate value of shape parameter c, numerical solutions best approximates exact solutions. Furthermore, we have shown the impact of noisy data on the numerical solution of u and f.

The smooth topology optimization for bi-dimensional functionally graded structures using level set-based radial basis functions

  • Wonsik Jung;Thanh T. Banh;Nam G. Luu;Dongkyu Lee
    • Steel and Composite Structures
    • /
    • v.47 no.5
    • /
    • pp.569-585
    • /
    • 2023
  • This paper proposes an efficient approach for the structural topology optimization of bi-directional functionally graded structures by incorporating popular radial basis functions (RBFs) into an implicit level set (ILS) method. Compared to traditional element density-based methods, a level set (LS) description of material boundaries produces a smoother boundary description of the design. The paper develops RBF implicit modeling with multiquadric (MQ) splines, thin-plate spline (TPS), exponential spline (ES), and Gaussians (GS) to define the ILS function with high accuracy and smoothness. The optimization problem is formulated by considering RBF-based nodal densities as design variables and minimizing the compliance objective function. A LS-RBF optimization method is proposed to transform a Hamilton-Jacobi partial differential equation (PDE) into a system of coupled non-linear ordinary differential equations (ODEs) over the entire design domain using a collocation formulation of the method of lines design variables. The paper presents detailed mathematical expressions for BiDFG beams topology optimization with two different material models: continuum functionally graded (CFG) and mechanical functionally graded (MFG). Several numerical examples are presented to verify the method's efficiency, reliability, and success in accuracy, convergence speed, and insensitivity to initial designs in the topology optimization of two-dimensional (2D) structures. Overall, the paper presents a novel and efficient approach to topology optimization that can handle bi-directional functionally graded structures with complex geometries.

An adaptive meshfree RPIM with improved shape parameter to simulate the mixing of a thermoviscoplastic material

  • Zouhair Saffah;Mohammed Amdi;Abdelaziz Timesli;Badr Abou El Majd;Hassane Lahmam
    • Structural Engineering and Mechanics
    • /
    • v.88 no.3
    • /
    • pp.239-249
    • /
    • 2023
  • The Radial Point Interpolation Method (RPIM) has been proposed to overcome the difficulties associated with the use of the Radial Basis Functions (RBFs). The RPIM has the following properties: Simple implementation in terms of boundary conditions as in the Finite Element Method (FEM). A less expensive CPU time compared to other collocation meshless methods such as the Moving Least Square (MLS) collocation method. In this work, we propose an adaptive high-order numerical algorithm based on RPIM to simulate the thermoviscoplastic behavior of a material mixing observed in the Friction Stir Welding (FSW) process. The proposed adaptive meshfree RPIM algorithm adapts well to the geometric and physical data by choosing a good shape parameter with a good precision. Our numerical approach combines the RPIM and the Asymptotic Numerical Method (ANM). A numerical procedure is also proposed in this work to automatically determine an improved shape parameter for the RBFs. The efficiency of the proposed algorithm is analyzed in comparison with an iterative algorithm.

The Study of Neural Networks Using Orthogonal function System in Hidden-Layer (직교함수를 은닉층에 지닌 신경회로망에 대한 연구)

  • 권성훈;최용준;이정훈;유석용;엄기환;손동설
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.482-485
    • /
    • 1999
  • In this paper we proposed a heterogeneous hidden layer consisting of both sigmoid functions and RBFs(Radial Basis Function) in multi-layered neural networks. Focusing on the orthogonal relationship between the sigmoid function and its derivative, a derived RBF that is a derivative of the sigmoid function is used as the RBF in the neural network. so the proposed neural network is called ONN(Orthogonal Neural Network). Identification results using a nonlinear function confirm both the ONN's feasibility and characteristics by comparing with those obtained using a conventional neural network which has sigmoid function or RBF in hidden layer

  • PDF

The Study of Neural Networks Using Orthogonal Function System (직교함수를 사용한 신경회로망에 대한 연구)

  • 권성훈;최용준;이정훈;손동설;엄기환
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.214-217
    • /
    • 1999
  • In this paper we proposed a heterogeneous hidden layer consisting of both sigmoid functions and RBFs(Radial Basis Function) in multi-layered neural networks. Focusing on the orthogonal relationship between the sigmoid function and its derivative, a derived RBF that is a derivative of the sigmoid function is used as the RBF in the neural network. so the proposed neural network is called ONN's feasibility Neural Network). Identification results using a nonlinear. function confirm both the ONN's feasibility and characteristics by comparing with those obtained using a conventional neural network which has sigmoid function or RBF in hidden layer.

  • PDF

The Design of Polynomial RBF Neural Network by Means of Fuzzy Inference System and Its Optimization (퍼지추론 기반 다항식 RBF 뉴럴 네트워크의 설계 및 최적화)

  • Baek, Jin-Yeol;Park, Byaung-Jun;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.2
    • /
    • pp.399-406
    • /
    • 2009
  • In this study, Polynomial Radial Basis Function Neural Network(pRBFNN) based on Fuzzy Inference System is designed and its parameters such as learning rate, momentum coefficient, and distributed weight (width of RBF) are optimized by means of Particle Swarm Optimization. The proposed model can be expressed as three functional module that consists of condition part, conclusion part, and inference part in the viewpoint of fuzzy rule formed in 'If-then'. In the condition part of pRBFNN as a fuzzy rule, input space is partitioned by defining kernel functions (RBFs). Here, the structure of kernel functions, namely, RBF is generated from HCM clustering algorithm. We use Gaussian type and Inverse multiquadratic type as a RBF. Besides these types of RBF, Conic RBF is also proposed and used as a kernel function. Also, in order to reflect the characteristic of dataset when partitioning input space, we consider the width of RBF defined by standard deviation of dataset. In the conclusion part, the connection weights of pRBFNN are represented as a polynomial which is the extended structure of the general RBF neural network with constant as a connection weights. Finally, the output of model is decided by the fuzzy inference of the inference part of pRBFNN. In order to evaluate the proposed model, nonlinear function with 2 inputs, waster water dataset and gas furnace time series dataset are used and the results of pRBFNN are compared with some previous models. Approximation as well as generalization abilities are discussed with these results.

Genetic Optimization of Fuzzy C-Means Clustering-Based Fuzzy Neural Networks (FCM 기반 퍼지 뉴럴 네트워크의 진화론적 최적화)

  • Choi, Jeoung-Nae;Kim, Hyun-Ki;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.466-472
    • /
    • 2008
  • The paper concerns Fuzzy C-Means clustering based fuzzy neural networks (FCM-FNN) and the optimization of the network is carried out by means of hierarchal fair competition-based parallel genetic algorithm (HFCPGA). FCM-FNN is the extended architecture of Radial Basis Function Neural Network (RBFNN). FCM algorithm is used to determine centers and widths of RBFs. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM-FNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Since the performance of FCM-FNN is affected by some parameters of FCM-FNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the HFCPGA which is a kind of multipopulation-based parallel genetic algorithms(PGA) is exploited to carry out the structural optimization of FCM-FNN. Moreover the HFCPGA is taken into consideration to avoid a premature convergence related to the optimization problems. The proposed model is demonstrated with the use of two representative numerical examples.