Boyle temperature and cubic equations of state

The sensitivity of Boyle temperature to changes in parameters appearing in cubic equations of state and to volume shift is analyzed. Analytical expressions for the Boyle temperature and for the dependency to the shift of the equation of state are given for the most common cases of the alpha function.     

基于Lascenov多项式零点的(0,2)-插值的正则性

本文给出了基于Ｌａｓｃｅｎｏｖ多项式零点（０，２）－插值正则性的充要条件，并给出基多项式存在时的明显表达式。     

Interpolation on Sparse Grids and Tensor Products of Nikol'skij–Besov Spaces

We investigate the order of convergence of periodic interpolation on sparse grids (blending interpolation) in the framework of tensor products of Nikol'skij–Besov spaces. To this end, we make use of the uniformity of the considered tensor norms and provide a unified approach to error estimates for the interpolation of univariate periodic functions from Nikol'skij–Besov spaces.     

Hermite interpolation with radial basis functions on spheres

We show how conditionally negative definite functions on spheres coupled with strictly completely monotone functions (or functions whose derivative is strictly completely monotone) can be used for Hermite interpolation. The classes of functions thus obtained have the advantage over the strictly positive definite functions studied in [17] that closed form representations (as opposed to series expansions) are readily available. Furthermore, our functions include the historically significant spherical multiquadrics. Numerical results are also presented. This revised version was published online in June 2006 with corrections to the Cover Date.     

Locality properties of radial basis function expansion coefficients for equispaced interpolation

Natasha Flyer ^{Many types of radial basis functions (RBFs) are global in termsof having large magnitude across the entire domain. Yet, incontrast, e.g. with expansions in orthogonal polynomials, RBFexpansions exhibit a strong property of locality with regardto their coefficients. That is, changing a single data valuemainly affects the coefficients of the RBFs which are centredin the immediate vicinity of that data location. This localityfeature can be advantageous in the development of fast and well-conditionediterative RBF algorithms. With this motivation, we employ hereboth analytical and numerical techniques to derive the decayrates of the expansion coefficients for cardinal data, in both1D and 2D. Furthermore, we explore how these rates vary in theinteresting high-accuracy limit of increasingly flat RBFs.}     

Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks

We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is Hamiltonian), by Thomassen (every 4-connected line graph is Hamiltonian) and by Fleischner (every cyclically 4-edge-connected cubic graph has either a 3-edge-coloring or a dominating cycle), which are known to be equivalent, are equivalent to the statement that every snark (i.e. a cyclically 4-edge-connected cubic graph of girth at least five that is not 3-edge-colorable) has a dominating cycle.We use a refinement of the contractibility technique which was introduced by Ryjá?ek and Schelp in 2003 as a common generalization and strengthening of the reduction techniques by Catlin and Veldman and of the closure concept introduced by Ryjá?ek in 1997.     

Hermite四点插指公式

文章利用Hermite插值基函数,将求解Hermite四点插指问题转换为求解8个派生出来的多项式插值问题,证明了Hermite四点插指公式的存在唯一性,并用两种方法构造出Hermite四点插指公式,最后给出了一个算例.     

Approximation of finite-section equations by piecewise constant functions

The problem is studied of reducing the amount of discrete information required for achieving a prescribed accuracy of solving Fredholm integral equations of the first kind on a half-line. The equations are solved by the finite-section method combined with piecewise constant interpolation of the kernel and the right-hand side at uniform grid points. The approximating properties of the discretization schemes are examined, and the corresponding computational costs are analyzed.     

The cubic semilocal convergence on two variants of Newton's method

In this paper, we discuss two variants of Newton's method without using any second derivative for solving nonlinear equations. By using the majorant function and confirming the majorant sequences, we obtain the cubic semilocal convergence and the error estimation in the Kantorovich-type theorems. The numerical examples are presented to support the usefulness and significance.     

Classification of sets satisfying the geometric characterization

The geometric characterization identifies the sets of nodes such that the Lagrange polynomials are products of factors of first degree. We offer a detailed classification of all known sets satisfying the geometric characterization in the plane. The defect, which takes into account the number of lines containing more nodes than the degree, plays a fundamental role in this classification. Partially supported by the Spanish Research Grant MTM2006-03388, by Gobierno de Aragón and Fondo Social Europeo.