Mesh-free approximations via the error reproducing kernel method and applications to nonlinear systems developing shocks

Error estimates for the error reproducing kernel method (ERKM) are provided. The ERKM is a mesh-free functional approximation scheme [A. Shaw, D. Roy, A NURBS-based error reproducing kernel method with applications in solid mechanics, Computational Mechanics (2006), to appear (available online)], wherein a targeted function and its derivatives are first approximated via non-uniform rational B-splines (NURBS) basis function. Errors in the NURBS approximation are then reproduced via a family of non-NURBS basis functions, constructed using a polynomial reproduction condition, and added to the NURBS approximation of the function obtained in the first step. In addition to the derivation of error estimates, convergence studies are undertaken for a couple of test boundary value problems with known exact solutions. The ERKM is next applied to a one-dimensional Burgers equation where, time evolution leads to a breakdown of the continuous solution and the appearance of a shock. Many available mesh-free schemes appear to be unable to capture this shock without numerical instability. However, given that any desired order of continuity is achievable through NURBS approximations, the ERKM can even accurately approximate functions with discontinuous derivatives. Moreover, due to the variation diminishing property of NURBS, it has advantages in representing sharp changes in gradients. This paper is focused on demonstrating this ability of ERKM via some numerical examples. Comparisons of some of the results with those via the standard form of the reproducing kernel particle method (RKPM) demonstrate the relative numerical advantages and accuracy of the ERKM.     

Approximations for the delay probability in the M/G/s queue

This paper develops approximations for the delay probability in an M/G/s queue. For M/G/s queues, it has been well known that the delay probability in the M/M/s queue, i.e., the Erlang delay formula, is usually a good approximation for other service-time distributions. By using an excellent approximation for the mean waiting time in the M/G/s queue, we provide more accurate approximations of the delay probability for small values of s. To test the quality of our approximations, we compare them with the exact value and the Erlang delay formula for some particular cases.     

基于输入-输出数据的重心法模糊系统及其泛逼近性

研究基于输入-输出数据的重心法模糊系统及其泛逼近性.首先,将一组单输入-单榆出数据转换成模糊推理规则,通过选择适当的模糊蕴涵算子生成模糊关系,再利用这种模糊关系求出二雄随机变量的联合概率密度函数.当将模糊蕴涵分别取为Larsen蕴涵和Mamdani蕴涵时,分别得到了两种具体的概率密度函数(称之为Larsen分布和Mamdani分布).其次,利用这两种概率分布.分别求出了对应的两种回归函数,指出这种回归函数实际上是模糊控制中的重心法模糊系统.我们分别给出了这种模糊系统具有泛逼近性的充分条件.从而进一步揭示了模糊系统的概率论意义.     

Ramanujan formula for the generalized Stirling approximation

The aim of this paper is to improve Ramanujan’s formula for approximation of the factorial function, starting from Burnside’s formula in contradistinction with the classical formula that starts from Stirling’s formula.     

Detectability of critical points of smooth functionals from their finite-dimensional approximations

Given a critical point of a C²-functional on a separable Hilbert space, we obtain sufficient conditions for it to be detectable (i.e. ‘visible’) from finite-dimensional Rayleigh-Ritz-Galerkin (RRG) approximations. While examples show that even nondegenerate critical points are, without any further restriction, not visible, we single out relevant classes of smooth functionals, e.g. the Hamiltonian action on the loop space or the functionals associated with boundary value problems for some semilinear elliptic equations, such that their nondegenerate critical points are visible from their RRG approximations.     

Gaussian beam decomposition of high frequency wave fields

In this paper, we present a method of decomposing a highly oscillatory wave field into a sparse superposition of Gaussian beams. The goal is to extract the necessary parameters for a Gaussian beam superposition from this wave field, so that further evolution of the high frequency waves can be computed by the method of Gaussian beams. The methodology is described for R^d${\mathbb{R}}^d$ with numerical examples for d=2$d=2$. In the first example, a field generated by an interface reflection of Gaussian beams is decomposed into a superposition of Gaussian beams. The beam parameters are reconstructed to a very high accuracy. The data in the second example is not a superposition of a finite number of Gaussian beams. The wave field to be approximated is generated by a finite difference method for a geometry with two slits. The accuracy in the decomposition increases monotonically with the number of beams.     

The ηHe scattering length revisited

The possible existence of -mesic nuclei poses an interesting and still open issue of research. Since the occurence of such -nucleus bound states is reflected in the corresponding -nucleus scattering length, we critically review the present knowledge for the ³He system. Specifically, we scrutinize the available experimental information for the reaction p + d + ³He which is commonly used to extract the ³He scattering length. We point out several striking discrepancies between the various measurements. Subject to those inconsistencies, we deduce a value a = | 4.3±0.3| + i(0.5±0.5) fm.     

Finding all solutions to polynomial systems and other systems of equations

In a previous paper, the authors suggested a procedure for obtaining all solutions to certain systems ofn equations inn complex variables. The idea was to start with a trivial system of equations to which all solutions were easily known. The trivial system was then perturbed into the given system. During the perturbation process, one followed the solution paths from each of the trivial solutions into the solutions of the given system. All solutions to the given system were thereby obtained.This paper utilizes a different approach that eliminates the requirement of the previous paper for a leading dominating term in each equation. We add a dominating term artificially and then fade it. Also we rely on mathematically more fundamental concepts from differential topology. These advancements permit the calculation of all solutions to arbitrary polynomials and to various other systems ofn equations inn complex variables. In addition, information on the number of solutions can be obtained without calculation.Work supported in part by NSF Grant No. MCS77-15509 and ARO Grant No. DAAG-29-78-G-0160.Work supported in part by ARO Grant No. DAAG-29-78-G-0160     

Light-scattering by optically soft randomly oriented spheroids

In the framework of the Rayleigh–Gans–Debye approximation and anomalous diffraction approaches, the light scattering characteristics of randomly oriented spheroids have been investigated. It has been proved that the system of randomly oriented spheroids is equivalent to the system of polydisperse spherical particles that have the same values of volume and surface area as nonspherical particles. The power law size distribution meeting these requirements has been obtained.