Inverse heat conduction problems by using particular solutions

Based on the method of fundamental solutions, we develop in this paper a new computational method to solve two-dimensional transient heat conduction inverse problems. The main idea is to use particular solutions as radial basis functions (PSRBF) for approximation of the solutions to the inverse heat conduction problems. The heat conduction equations are first analyzed in the Laplace transformed domain and the Durbin inversion method is then used to determine the solutions in the time domain. Least-square and singular value decomposition (SVD) techniques are adopted to solve the ill-conditioned linear system of algebraic equations obtained from the proposed PSRBF method. To demonstrate the effectiveness and simplicity of this approach, several numerical examples are given with satisfactory accuracy and stability.Peer reviewe

A High-Order Radial Basis Function (RBF) Leray Projection Method for the Solution of the Incompressible Unsteady Stokes Equations

A new projection method based on radial basis functions (RBFs) is presented for discretizing the incompressible unsteady Stokes equations in irregular geometries. The novelty of the method comes from the application of a new technique for computing the Leray-Helmholtz projection of a vector field using generalized interpolation with divergence-free and curl-free RBFs. Unlike traditional projection methods, this new method enables matching both tangential and normal components of divergence-free vector fields on the domain boundary. This allows incompressibility of the velocity field to be enforced without any time-splitting or pressure boundary conditions. Spatial derivatives are approximated using collocation with global RBFs so that the method only requires samples of the field at (possibly scattered) nodes over the domain. Numerical results are presented demonstrating high-order convergence in both space (between 5th and 6th order) and time (up to 4th order) for some model problems in two dimensional irregular geometries.Comment: 34 pages, 8 figure

The use of the mesh free methods (radial basis functions) in the modeling of radionuclide migration and moving boundary value problems

Recently, the mesh free methods (radial basis functions-RBFs) have emerged as a novel computing method in the scientific and engineering computing community. The numerical solution of partial differential equations (PDEs) has been usually obtained by finite difference methods (FDM), finite element methods (FEM) and boundary elements methods (BEM). These conventional numerical methods still have some drawbacks. For example, the construction of the mesh in two or more dimensions is a nontrivial problem. Solving PDEs using radial basis function (RBF) collocations is an attractive alternative to these traditional methods because no tedious mesh generation is required. We compare the mesh free method, which uses radial basis functions, with the traditional finite difference scheme and analytical solutions. We will present some examples of using RBFs in geostatistical analysis of radionuclide migration modeling. The advection-dispersion equation will be used in the Eulerian and Lagrangian forms. Stefan's or moving boundary value problems will also be presented. The position of the moving boundary will be simulated by the moving data centers method and level set method

Moving-boundary problems solved by adaptive radial basis functions

The objective of this paper is to present an alternative approach to the conventional level set methods for solving two-dimensional moving-boundary problems known as the passive transport. Moving boundaries are associated with time-dependent problems and the position of the boundaries need to be determined as a function of time and space. The level set method has become an attractive design tool for tracking, modeling and simulating the motion of free boundaries in fluid mechanics, combustion, computer animation and image processing. Recent research on the numerical method has focused on the idea of using a meshless methodology for the numerical solution of partial differential equations. In the present approach, the moving interface is captured by the level set method at all time with the zero contour of a smooth function known as the level set function. A new approach is used to solve a convective transport equation for advancing the level set function in time. This new approach is based on the asymmetric meshless collocation method and the adaptive greedy algorithm for trial subspaces selection. Numerical simulations are performed to verify the accuracy and stability of the new numerical scheme which is then applied to simulate a bubble that is moving, stretching and circulating in an ambient flow to demonstrate the performance of the new meshless approach. (C) 2010 Elsevier Ltd. All rights reserved

Numerical investigation of Differential Biological-Models via GA-Kansa Method Inclusive Genetic Strategy

In this paper, we use Kansa method for solving the system of differential equations in the area of biology. One of the challenges in Kansa method is picking out an optimum value for Shape parameter in Radial Basis Function to achieve the best result of the method because there are not any available analytical approaches for obtaining optimum Shape parameter. For this reason, we design a genetic algorithm to detect a close optimum Shape parameter. The experimental results show that this strategy is efficient in the systems of differential models in biology such as HIV and Influenza. Furthermore, we prove that using Pseudo-Combination formula for crossover in genetic strategy leads to convergence in the nearly best selection of Shape parameter.Comment: 42 figures, 23 page

A multidomain spectral method for solving elliptic equations

We present a new solver for coupled nonlinear elliptic partial differential equations (PDEs). The solver is based on pseudo-spectral collocation with domain decomposition and can handle one- to three-dimensional problems. It has three distinct features. First, the combined problem of solving the PDE, satisfying the boundary conditions, and matching between different subdomains is cast into one set of equations readily accessible to standard linear and nonlinear solvers. Second, touching as well as overlapping subdomains are supported; both rectangular blocks with Chebyshev basis functions as well as spherical shells with an expansion in spherical harmonics are implemented. Third, the code is very flexible: The domain decomposition as well as the distribution of collocation points in each domain can be chosen at run time, and the solver is easily adaptable to new PDEs. The code has been used to solve the equations of the initial value problem of general relativity and should be useful in many other problems. We compare the new method to finite difference codes and find it superior in both runtime and accuracy, at least for the smooth problems considered here.Comment: 31 pages, 8 figure