Search results

The Motz problem can be considered as a benchmark problem for testing the performance of numerical methods in the solution of elliptic problems with boundary singularities. The purpose of this paper is to address the solution of the Motz problem using the radial basis function (RBF) method, which is a truly meshfree scheme.

Both the global RBF collocation method (also known as Kansa's method) and the recently proposed local RBF‐based differential quadrature (LRBFDQ) method are considered. In both cases, it is shown that the accuracy of the solution can be significantly increased by using special functions which capture the behavior of the singularity. In the case of global collocation, the functional space spanned by the RBF is enlarged by adding singular functions which capture the behavior of the local singular solution. In the case of local collocation, the problem is modified appropriately in order to eliminate the singularities from the formulation.

The paper shows that the exponential convergence both with increasing resolution and increasing shape parameter, which is typical of the RBF method, is lost in problems containing singularities. The accuracy of the solution can be increased by collocation of the partial differential equation (PDE) at boundary nodes. However, in order to restore the exponential convergence of the RBF method, it is necessary to use special functions which capture the behavior of the solution near the discontinuity.

The paper uses Motz's problem as a prototype for problems described by elliptic partial differential equations with boundary singularities. However, the results obtained in the paper are applicable to a wide range of problems containing boundaries with conditions which change from Dirichlet to Neumann, thus leading to singularities in the first derivatives.

The paper shows that both the global RBF collocation method and the LRBFDQ method, are truly meshless methods which can be very useful for the solution of elliptic problems with boundary singularities. In particular, when complemented with special functions that capture the behavior of the solution near the discontinuity, the method exhibits exponential convergence both with resolution and with shape parameter.

The purpose of this paper is to propose an improved optimization methodology of information granulation‐based fuzzy radial basis function neural networks (IG‐FRBFNN). In the IG‐FRBFNN, the membership functions of the premise part of fuzzy rules are determined by means of fuzzy c‐means (FCM) clustering. Also, high‐order polynomial is considered as the consequent part of fuzzy rules which represent input‐output relation characteristic of sub‐space and weighted least squares learning is used to estimate the coefficients of polynomial. Since the performance of IG‐RBFNN is affected by some parameters such as a specific subset of input variables, the fuzzification coefficient of FCM, the number of rules and the order of polynomial of consequent part of fuzzy rules, we need the structural as well as parametric optimization of the network. The proposed model is demonstrated with the use of two kinds of examples such as nonlinear function approximation problem and Mackey‐Glass time‐series data.

The type of polynomial of each fuzzy rule is determined by selection algorithm by considering the local error as performance index. In addition, the combined local error is introduced as a performance index considered by two kinds of parameters such as the polynomial type of each rule and the number of polynomial coefficients of each rule. Besides this, other structural and parametric factors of the IG‐FRBFNN are optimized to minimize the global error of model by means of the hierarchical fair competition‐based parallel genetic algorithm.

The performance of the proposed model is illustrated with the aid of two examples. The proposed optimization method leads to an accurate and highly interpretable fuzzy model.

The proposed hybrid optimization methodology is interesting for designing an accurate and highly interpretable fuzzy model. Hybrid optimization algorithm comes in the form of the combination of the combined local error and the global error.

This paper aims to develop a meshfree algorithm based on local radial basis functions (RBFs) combined with the differential quadrature (DQ) method to provide numerical approximations of the solutions of time-dependent, nonlinear and spatially one-dimensional reaction-diffusion systems and to capture their evolving patterns. The combination of local RBFs and the DQ method is applied to discretize the system in space; implicit multistep methods are subsequently used to discretize in time.

In a method of lines setting, a meshless method for their discretization in space is proposed. This discretization is based on a DQ approach, and RBFs are used as test functions. A local approach is followed where only selected RBFs feature in the computation of a particular DQ weight.

The proposed method is applied on four reaction-diffusion models: Huxley’s equation, a linear reaction-diffusion system, the Gray–Scott model and the two-dimensional Brusselator model. The method captured the various patterns of the models similar to available in literature. The method shows second order of convergence in space variables and works reliably and efficiently for the problems.

The originality lies in the following facts: A meshless method is proposed for reaction-diffusion models based on local RBFs; the proposed scheme is able to capture patterns of the models for big time T; the scheme has second order of convergence in both time and space variables and Nuemann boundary conditions are easy to implement in this scheme.

The purpose of this paper is to develop two meshfree algorithms based on multiquadric radial basis functions (RBFs) and differential quadrature (DQ) technique for numerical simulation and to capture the shocks behavior of Burgers’ type problems.

The algorithms convert the problems into a system of ordinary differential equations which are solved by the Runge–Kutta method.

Two meshfree algorithms are developed and their stability is discussed. Numerical experiment is done to check the efficiency of the algorithms, and some shock behaviors of the problems are presented. The proposed algorithms are found to be accurate, simple and fast.

The present algorithms LRBF-DQM and GRBF-DQM are based on radial basis functions, which are new for Burgers’ type problems. It is concluded from the numerical experiments that LRBF-DQM is better than GRBF-DQM. The algorithms give better results than available literature.

The study aims to present a new meshless method based on the Taylor series expansion. The compact supported radial basis functions (CSRBFs) are very attractive, can be considered as a numerical tool for the engineering problems and used to obtain the trial solution and its derivatives without differentiating the basis functions for a meshless method. A meshless based on the CSRBF and Taylor series method has been developed for the solutions of engineering problems.

This paper is devoted to present a truly meshless method which is called a radial basis Taylor series method (RBTSM) based on the CSRBFs and Taylor series expansion (TSE). The basis function and its derivatives are obtained without differentiating CSRBFs.

The RBTSM does not involve differentiation of the approximated function. This property allows us to use a wide range of CSRBF and weight functions including the constant one. By using a different number of terms in the TSE, the global convergence properties of the RBTSM can be improved. The global convergence properties are satisfied by the RBTSM. The computed results based on the RBTSM shows excellent agreement with results given in the open literature. The RBTSM can provide satisfactory results even with the problem domains which have curved boundaries and irregularly distributed nodes.

The CSRBFs have been widely used for the construction of the basic function in the meshless methods. However, the derivative of the basis function is obtained with the differentiation of the CSRBF. In the RBTSM, the derivatives of the basis function are obtained by using the TSE without differentiating the CSRBF.

The purpose of this paper is to provide an effective and simple technique to structural damage identification, particularly to identify a crack in a structure. Artificial neural networks approach is an alternative to identify the extent and location of the damage over the classical methods. Radial basis function (RBF) networks are good at function mapping and generalization ability among the various neural network approaches. RBF neural networks are chosen for the present study of crack identification.

Analyzing the vibration response of a structure is an effective way to monitor its health and even to detect the damage. A novel two‐stage improved radial basis function (IRBF) neural network methodology with conventional RBF in the first stage and a reduced search space moving technique in the second stage is proposed to identify the crack in a cantilever beam structure in the frequency domain. Latin hypercube sampling (LHS) technique is used in both stages to sample the frequency modal patterns to train the proposed network. Study is also conducted with and without addition of 5% white noise to the input patterns to simulate the experimental errors.

The results show a significant improvement in identifying the location and magnitude of a crack by the proposed IRBF method, in comparison with conventional RBF method and other classical methods. In case of crack location in a beam, the average identification error over 12 test cases was 0.69 per cent by IRBF network compared to 4.88 per cent by conventional RBF. Similar improvements are reported when compared to hybrid CPN BPN networks. It also requires much less computational effort as compared to other hybrid neural network approaches and classical methods.

The proposed novel IRBF crack identification technique is unique in originality and not reported elsewhere. It can identify the crack location and crack depth with very good accuracy, less computational effort and ease of implementation.

Global optimization in electrical engineering using stochastic methods requires usually a large amount of CPU time to locate the optimum, if the objective function is calculated either with the finite element method (FEM) or the boundary element method (BEM). One approach to reduce the number of FEM or BEM calls using neural networks and another one using multiquadric functions have been introduced recently. This paper compares the efficiency of both methods, which are applied to a couple of test problems and the results are discussed.

The purpose of this paper is to introduce a local Newton basis functions collocation method for solving the 2D nonlinear coupled Burgers’ equations. It needs less computer storage and flops than the usual global radial basis functions collocation method and also stabilizes the numerical solutions of the convection-dominated equations by using the Newton basis functions.

A meshless method based on spatial trial space spanned by the local Newton basis functions in the “native” Hilbert space of the reproducing kernel is presented. With the selected local sub-clusters of domain nodes, an approximation function is introduced as a sum of weighted local Newton basis functions. Then the collocation approach is used to determine weights. The method leads to a system of ordinary differential equations (ODEs) for the time-dependent partial differential equations (PDEs).

The method is successfully used for solving the 2D nonlinear coupled Burgers’ equations for reasonably high values of Reynolds number (Re). It is a well-known issue in the analysis of the convection-diffusion problems that the solution becomes oscillatory when the problem becomes convection-dominated if the standard methods are followed without special treatments. In the proposed method, the authors do not detect any instability near the front, hence no technique is needed. The numerical results show that the proposed method is efficient, accurate and stable for flow with reasonably high values of Re.

The authors used more stable basis functions than the standard basis of translated kernels for representing of kernel-based approximants for the numerical solution of partial differential equations (PDEs). The local character of the method, having a well-structured implementation including enforcing the Dirichlet and Neuman boundary conditions, and producing accurate and stable results for flow with reasonably high values of Re for the numerical solution of the 2D nonlinear coupled Burgers’ equations without any special technique are the main values of the paper.

The purpose of this paper is to upgrade our previous developments of Local Radial Basis Function Collocation Method (LRBFCM) for heat transfer, fluid flow and electromagnetic problems to thermoelastic problems and to study its numerical performance with the aim to build a multiphysics meshless computing environment based on LRBFCM.

Linear thermoelastic problems for homogenous isotropic body in two dimensions are considered. The stationary stress equilibrium equation is written in terms of deformation field. The domain and boundary can be discretized with arbitrary positioned nodes where the solution is sought. Each of the nodes has its influence domain, encompassing at least six neighboring nodes. The unknown displacement field is collocated on local influence domain nodes with shape functions that consist of a linear combination of multiquadric radial basis functions and monomials. The boundary conditions are analytically satisfied on the influence domains which contain boundary points. The action of the stationary stress equilibrium equation on the constructed interpolation results in a sparse system of linear equations for solution of the displacement field.

The performance of the method is demonstrated on three numerical examples: bending of a square, thermal expansion of a square and thermal expansion of a thick cylinder. Error is observed to be composed of two contributions, one proportional to a power of internodal spacing and the other to a power of the shape parameter. The latter term is the reason for the observed accuracy saturation, while the former term describes the order of convergence. The explanation of the observed error is given for the smallest number of collocation points (six) used in local domain of influence. The observed error behavior is explained by considering the Taylor series expansion of the interpolant. The method can achieve high accuracy and performs well for the examples considered.

The method can at the present cope with linear thermoelasticity. Other, more complicated material behavior (visco-plasticity for example), will be tackled in one of our future publications.

LRBFCM has been developed for thermoelasticity and its error behavior studied. A robust way of controlling the error was devised from consideration of the condition number. The performance of the method has been demonstrated for a large number of the nodes and on uniform and non-uniform node arrangements.

The purpose of this paper is to consider the concept of Fuzzy Radial Basis Function Neural Networks with Information Granulation (IG‐FRBFNN) and their optimization realized by means of the Multiobjective Particle Swarm Optimization (MOPSO).

In fuzzy modeling, complexity, interpretability (or simplicity) as well as accuracy of the obtained model are essential design criteria. Since the performance of the IG‐RBFNN model is directly affected by some parameters, such as the fuzzification coefficient used in the FCM, the number of rules and the orders of the polynomials in the consequent parts of the rules, the authors carry out both structural as well as parametric optimization of the network. A multi‐objective Particle Swarm Optimization using Crowding Distance (MOPSO‐CD) as well as O/WLS learning‐based optimization are exploited to carry out the structural and parametric optimization of the model, respectively, while the optimization is of multiobjective character as it is aimed at the simultaneous minimization of complexity and maximization of accuracy.

The performance of the proposed model is illustrated with the aid of three examples. The proposed optimization method leads to an accurate and highly interpretable fuzzy model.

A MOPSO‐CD as well as O/WLS learning‐based optimization are exploited, respectively, to carry out the structural and parametric optimization of the model. As a result, the proposed methodology is interesting for designing an accurate and highly interpretable fuzzy model.