Gaussian Radial Basis Function interpolation in vertical deformation analysis

In many deformation analyses,the partial derivatives at the interpolated scattered data points are required.In this paper,the Gaussian Radial Basis Functions(GRBF)is proposed for the interpolation and differentiation of the scattered data in the vertical deformation analysis.For the optimal selection of the shape parameter,which is crucial in the GRBF interpolation,two methods are used:the Power Gaussian Radial Basis Functions(PGRBF)and Leave One Out Cross Validation(LOOCV)(LGRBF).We compared the PGRBF and LGRBF to the traditional interpolation methods such as the Finite Element Method(FEM),polynomials,Moving Least Squares(MLS),and the usual GRBF in both the simulated and actual Interferometric Synthetic Aperture Radar(InSAR)data.The estimated results showed that the surface interpolation accuracy was greatly improved by LGRBF and PGRBF methods in comparison withFEM,polynomial,and MLS methods.Finally,LGRBF and PGRBF interpolation methods are used to compute invariant vertical deformation parameters,i.e.,changes in Gaussian and mean Curvatures in the Groningen area in the North of Netherlands.

Spherical Scattered Data Quasi-interpolation by Gaussian Radial Basis Function

Since the spherical Gaussian radial function is strictly positive definite, the authors use the linear combinations of translations of the Gaussian kernel to interpolate the scattered data on spheres in this article. Seeing that target functions axe usually outside the native spaces, and that one has to solve a large scaled system of linear equations to obtain combinatorial coefficients of interpolant functions, the authors first probe into some problems about interpolation with Gaussian radial functions. Then they construct quasi- interpolation operators by Gaussian radial function, and get the degrees of approximation. Moreover, they show the error relations between quasi-interpolation and interpolation when they have the same basis functions. Finally, the authors discuss the construction and approximation of the quasi-interpolant with a local support function.

A Novel Method for Solving Ordinary Differential Equations with Artificial Neural Networks

This research work investigates the use of Artificial Neural Network (ANN) based on models for solving first and second order linear constant coefficient ordinary differential equations with initial conditions. In particular, we employ a feed-forward Multilayer Perceptron Neural Network (MLPNN), but bypass the standard back-propagation algorithm for updating the intrinsic weights. A trial solution of the differential equation is written as a sum of two parts. The first part satisfies the initial or boundary conditions and contains no adjustable parameters. The second part involves a feed-forward neural network to be trained to satisfy the differential equation. Numerous works have appeared in recent times regarding the solution of differential equations using ANN, however majority of these employed a single hidden layer perceptron model, incorporating a back-propagation algorithm for weight updation. For the homogeneous case, we assume a solution in exponential form and compute a polynomial approximation using statistical regression. From here we pick the unknown coefficients as the weights from input layer to hidden layer of the associated neural network trial solution. To get the weights from hidden layer to the output layer, we form algebraic equations incorporating the default sign of the differential equations. We then apply the Gaussian Radial Basis function (GRBF) approximation model to achieve our objective. The weights obtained in this manner need not be adjusted. We proceed to develop a Neural Network algorithm using MathCAD software, which enables us to slightly adjust the intrinsic biases. We compare the convergence and the accuracy of our results with analytic solutions, as well as well-known numerical methods and obtain satisfactory results for our example ODE problems.