Finite-Part Integrals and Modified Splines

We first state a uniform convergence theorem for finite-part integrals which are derivatives of weighted Cauchy principal value integrals. We then give a two-stage process to modify approximating splines and optimal nodal splines in such a way that the conditions of this theorem are satisfied. Consequently, these modified splines can be used in the numerical evaluation of these finite-part integrals.     

Numerical integration of 2‐D integrals based on local bivariate C 1 quasi‐interpolating splines

In this paper cubature formulas based on bivariate C ¹ local polynomial splines with a four directional mesh [4] are generated and studied. Some numerical results with comparison with other methods are given. Moreover the method proposed is applied to the numerical evaluation of 2‐D singular integrals defined in the Hadamard finite part sense. Computational features, convergence properties and error bounds are proved. This revised version was published online in August 2006 with corrections to the Cover Date.     

An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation

The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of the ^GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy traffic limits of the ^GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas. This revised version was published online in June 2006 with corrections to the Cover Date.     

ContributionsSign-balanced covering matrices

A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]^t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C₁, C₂,…, C_t of t columns and for each choice = (₁,…,_t) Δ of signs, the linear combination ∑_j=1^t _jC_j contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (₁, …, _t) of signs in δ, the linear combination ∑_j=1^t _jC_j contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described.     

EXISTENCE OF GLOBAL SMOOTH SOLUTION FOR SCALAR CONSERVATION LAWS WITH DEGENERATE VISCOSITY IN 2-DIMENSIONAL SPACE

This article concerns the existence of global smooth solution for scalar conservation laws with degenerate viscosity in 2-dimensional space. The analysis is based on successive approximation and maximum principle.     

THE STEP-TRANSITION OPERATORS FOR MULTI-STEP METHODS OF ODE'S

1.'IntroductionThedisad~ageofsymplecticmethodsinusingtheinformationfrompasttimestepsleadstotheirneedingmorefunctionevaluationthannonsymplecticmethods.Thisdisadvantagecanbeovercomeifonecouldconstructsymplecticmulti-stepmethods.But'theaestProblemshouldbesolvedistogiveoutthedefinitionofsymplecticmultistepmethod.Ulltilnow,apopularideaisthatanm-stepmethodonMmaybewrittenasaone-stepmethodonMa.Inpaper12,71,theauthorshaveinvestigatedthecircumstanceunderWhichadifferenceschemecanpreservetheproductsympl…     

Contributions of Spin–Lattice Relaxation to the Echo Decay of Planar Cu in High-Temperature Superconductors

Measurement ofT_2G, the Gaussian component of the spin-echo envelope of planar Cu nuclei in high-temperature superconductors, gives important information about the real part of the Cu electron spin susceptibility. In the traditional picture of the planar Cu echo decay, the internuclear coupling is assumed to remain static with respect to spin–lattice relaxation and mutual exchange fluctuations. In some circumstances, however, this assumption breaks down. We calculate the internuclear corrections arising from spin–lattice relaxation to the conventional theory ofT_2Gand show thatT_2Gcan be easily corrected for these effects. We argue that mutual exchanges due to the perpendicular indirect couplings are suppressed in these materials. For YBa₂Cu₄O₈, we find a correction on the order of 10% inT_2Gand using the corrected values we find that the isotope ratio⁶³T_2G/⁶⁵T_2Gagrees with theory.     

Guaranteed-accuracy approximation of reachable sets for a linear dynamic system subject to impulse actions

A method is proposed for approximating the reachable set of a dynamic system with a state space dimension no higher than six-eight considered on a finite time interval. The system is governed by linear differential equations with piecewise constant coefficients and impulse actions specified at prescribed times. The method is based on guaranteed-accuracy polyhedral approximations of reachable sets at researcher-specified times. Every approximation is constructed using the preceding one. A procedure is described for choosing parameters of the method that ensure the required accuracy with close-to-minimal time costs.     

A note on generalized averaged Gaussian formulas

We have recently proposed a very simple numerical method for constructing the averaged Gaussian quadrature formulas. These formulas exist in many more cases than the real positive Gauss–Kronrod formulas. In this note we try to answer whether the averaged Gaussian formulas are an adequate alternative to the corresponding Gauss–Kronrod quadrature formulas, to estimate the remainder term of a Gaussian rule.     

三级近似束流光学计算程序

为了精确计算束流在离子光学系统中的传输,用Visual FORTRAN 6.5语言编写了一个计算程序,长约13000行. 此程序可以计算由三圆筒单透镜、三膜片单透镜、双元筒透镜、均匀场静电加速管、磁四极透镜、六极磁铁、静电四极透镜、偏转磁铁、螺线管透镜、ExB~正交电磁场分析器、静电偏转器、漂浮管、QWR(Quarter Wave Resonators)和SLR(Split Loop Resonators)射频加速元件等元件任意组成的离子光学系统. 粒子轨迹的计算可精确到三级近似. 粒子的分布类型也可以有多种选择. 程序具有最优化计算功能,即可以自动调整元件的参数,以实现所需要的光学条件. 各元件之后的横向和纵向相图以及系统的束流包络线以图形方式显示在屏幕上.