An algorithm for use with several meshless schemes is presented based on a local extremum diminishing property. The scheme is applied to the Euler equations in two dimensions. The algorithm is suitable for use with many meshless schemes, three of which are detailed here. First, a method based on Taylor series expansion and least squares is highlighted. Next, a similar least squares method is us...

Evaluation and analysis of most remotely sensed data requires careful image-to-image registration or ortho-rectification (geocoding). Photogrammetric practice has shown that polynomial transformation functions are useful for registration of aerial photographs. However, multiand hyperspectral remotely sensed data are often recorded by airborne line scanners. Then ortho-rectification by conventio...

This paper discusses the application of the multi-zone decomposition technique with Multiquadric scheme for the numerical solutions of a time-dependent problem. The construction of the multi-zone algorithm is based on a domain decomposition technique to subdivide the global region into a number of nite subdomains. The reduction of ill-conditioning and the improvement of the computational eecien...

An improvement to the traditional Finite Volume Method (FVM) for the solution of boundary value problems is presented. The new method applies the local Hermitian interpolation with Radial Basis Functions (RBF) as an interpolation scheme to the FVM discretization. This approach, called the Control Volume-Radial Basis Function (CV-RBF) method, uses an interpolation scheme based on the meshless Sy...

Radial basis function methods for interpolation can be interpreted as roughness-minimizing splines. Although this relationship has already been established for radial basis functions of the form g(r) = r and g(r) = r log(r), it is extended here to include a much larger class of functions. This class includes the multiquadric g(r) = (r 2 + c 2) 1=2 and inverse multiquadric g(r) = (r 2 + c 2) ?1=...

In the 1990’s exponential-type error bounds appeared in the theory of radial basis functions. For multiquadric interpolation it is O(λ 1 d ) as d → 0, where λ is a constant satisfying 0 < λ < 1. For Gaussian interpolation it is O(C d) c′ d as d → 0 where C ′ and c are constants. In both cases the parameter d, called fill distance, measures the spacing of the points where interpolation occurs. T...

A previous paper by the authors [FH93] noted that there was a strong tendency to obtain near-repeated knots in their algorithm for least squares approximation of scattered data by multiquadric functions. In this paper we observe that this leads naturally to the inclusion of derivatives of the multiquadric basis function in the approximation, and give an algorithm for accomplishing this. A compa...