An algebraic cubature formula on curvilinear polygons

We implement in Matlab a Gauss-like cubature formula on bivariate domains whose boundary is a piecewise smooth Jordan curve (curvilinear polygons). The key tools are Green’s integral formula, together with the recent software package Chebfun to approximate the boundary curve close to machine precision by piecewise Chebyshev interpolation. Several tests are presented, including some comparisons of this new routine ChebfunGauss with the recent SplineGauss that approximates the boundary by splines.     

A new algorithm for computing the multivariate Faà di Bruno’s formula

A new algorithm for computing the multivariate Faà di Bruno’s formula is provided. We use a symbolic approach based on the classical umbral calculus that turns the computation of the multivariate Faà di Bruno’s formula into a suitable multinomial expansion. We propose a MAPLE procedure whose computational times are faster compared with the ones existing in the literature. Some illustrative applications are also provided.     

Anisotropic error bounds of Lagrange interpolation with any order in two and three dimensions

In this paper, using the Newton’s formula of Lagrange interpolation, we present a new proof of the anisotropic error bounds for Lagrange interpolation of any order on the triangle, rectangle, tetrahedron and cube in a unified way.     

Numerical inversion of a general incomplete elliptic integral

We present a numerical method to invert a general incomplete elliptic integral with respect to its argument and/or amplitude. The method obtains a solution by bisection accelerated by half argument formulas and addition theorems to evaluate the incomplete elliptic integrals and Jacobian elliptic functions required in the process. If faster execution is desirable at the cost of complexity of the algorithm, the sequence of bisection is switched to allow an improvement by using Newton’s method, Halley’s method, or higher-order Schröder methods. In the improvement process, the elliptic integrals and functions are computed by using Maclaurin series expansion and addition theorems based on the values obtained at the end of the bisection. Also, the derivatives of the elliptic integrals and functions are recursively evaluated from their values. By adopting 0.2 as the critical value of the length of the solution interval to shift to the improvement process, we suppress the expected number of bisections to be as low as four on average. The typical number of applications of update formulas in the double precision environment is three for Newton’s method, and two for Halley’s method or higher-order Schröder methods. Whether the improvement process is added or not, our method requires none of the procedures to compute the incomplete elliptic integrals and Jacobian elliptic functions but only those to evaluate the complete elliptic integrals once at the beginning. As a result, it runs fairly quickly in general. For example, when using the improvement process, it is around 2–5 times faster than Newton’s method using Boyd’s starter (Boyd (2012) [25]) in inverting E(φ|m)$E\left(\phi \right|m)$, Legendre’s incomplete elliptic integral of the second kind.     

Hall–Littlewood polynomials, alcove walks, and fillings of Young diagrams

A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. The inversion statistic, which is the more intricate one, suffices for specializing a closely related formula to one for the type A Hall–Littlewood Q-polynomials (spherical functions on p-adic groups). An apparently unrelated development, at the level of arbitrary finite root systems, led to Schwer’s formula (rephrased and rederived by Ram) for the Hall–Littlewood P-polynomials of arbitrary type. The latter formula is in terms of so-called alcove walks, which originate in the work of Gaussent–Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by deriving a Haglund–Haiman–Loehr type formula for the Hall–Littlewood P-polynomials of type A from Ram’s version of Schwer’s formula via a “compression” procedure.     

Meshless cubature over the disk using thin-plate splines

In some recent papers, the construction of meshless interpolatory cubature formulas using radial basis functions has been studied. In particular, thin-plate splines allow us to conveniently use Green’s formula and give good results on scattered samples of small/moderate size over polygons. Here, we discuss the extension to meshless cubature over the disk and its practical implementation.     

Comments on generalized Heron polynomials and Robbins’ conjectures

Heron’s formula for a triangle gives a polynomial for the square of its area in terms of the lengths of its three sides. There is a very similar formula, due to Brahmagupta, for the area of a cyclic quadrilateral in terms of the lengths of its four sides. (A polygon is cyclic if its vertices lie on a circle.) In both cases if A is the area of the polygon, (4A)² is a polynomial function of the square in the lengths of its edges. David Robbins in [D.P. Robbins, Areas of polygons inscribed in a circle, Discrete Comput. Geom. 12 (2) (1994) 223-236. MR 95g:51027; David P. Robbins, Areas of polygons inscribed in a circle, Amer. Math. Monthly 102 (6) (1995) 523-530. MR 96k:51024] showed that for any cyclic polygon with n edges, (4A)² satisfies a polynomial whose coefficients are themselves polynomials in the edge lengths, and he calculated this polynomial for n=5 and n=6. He conjectured the degree of this polynomial for all n, and recently Igor Pak and Maksym Fedorchuk [Maksym Fedorchuk, Igor Pak, Rigidity and polynomial invariants of convex polytopes, Duke Math. J. 129 (2) (2005) 371-404. MR 2006f:52015] have shown that this conjecture of Robbins is true. Robbins also conjectured that his polynomial is monic, and that was shown in [V.V. Varfolomeev, Inscribed polygons and Heron polynomials (Russian. Russian summary), Mat. Sb. 194 (3) (2003) 3-24. MR 2004d:51014]. A short independent proof will be shown here.     

Extension of a quadratic transformation due to Exton

By applying various known summation theorems to a general formula based upon Bailey’s transform theorem due to Slater, Exton has obtained numerous new quadratic transformations involving hypergeometric functions of two and of higher order. Some of the results have typographical errors and have been corrected recently by Choi and Rathie. In addition, two new quadratic transformation formulæ were also obtained [Junesang Choi, A.K. Rathie, Quadratic transformations involving hypergeometric functions of two and higher order, EAMJ, East Asian Math. J. 22 (2006) 71-77]. The aim of this research paper is to obtain a generalization of one of the Exton’s quadratic transformation. The results are derived with the help of generalized Kummer’s theorem obtained earlier by Lavoie, Grondin and Rathie. As special cases, we mention six interesting results closely related to that of Exton’s result.     

Raney and Catalan

Raney’s lemma is often used in a counting argument to prove the formula for (generalized) Catalan numbers. It ensures the existence of “good” cyclic shifts of certain sequences, i.e. cyclic shifts for which all partial sums are positive.We introduce a simple algorithm that finds these cyclic shifts and also those with a slightly weaker property. Moreover it provides simple proofs of lemma’s of Raney type.A similar clustering procedure is also used in a simple proof of a theorem on probabilities of which many well-known results (e.g. on lattice paths and on generalized Catalan numbers) can be derived as corollaries. The theorem generalizes generalized Catalan numbers. In the end it turns out to be equivalent to a formula of Raney.     

Gauss-Green cubature and moment computation over arbitrary geometries

We have implemented in Matlab a Gauss-like cubature formula over arbitrary bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n−1 using N∼cmn² nodes, 1≤c≤p, m being the total number of points given on the boundary. It does not need any decomposition of the domain, but relies directly on univariate Gauss-Legendre quadrature via Green’s integral formula. Several numerical tests are presented, including computation of standard as well as orthogonal moments over a nonstandard planar region.     

L-stable Simpson’s 3/8 rule and Burgers’ equation

In this paper we develop an unconditionally stable third order time integration formula for the diffusion equation with Neumann boundary condition. We use a suitable arithmetic average approximation and explicit backward Euler formula and then develop a third order L-stable Simpson’s 3/8 type formula. We also observe that the arithmetic average approximation is not unique. Then L-stable Simpson’s 3/8 type formula and Hopf-Cole transformation is used to solve Burger’s equation with Dirichlet boundary condition. It is also observed that this numerical method deals efficiently in case of inconsistencies in initial and boundary conditions.     

关于ζ函数的积分表示

由Riemannζ函数的函数方程得到Hurwitzζ函数的Hermite公式,再从Hermite公式得到Γ(s)的Binet′s第二表达式,从而由ζ函数推得Γ(s)的性质.     

Local approximation of functions with several variables

This paper presents the problem of local approximation of scalar functions with several variables, including points of non-differentiability. The procedure considers that the mapping displays rates of change of power type with respect to linear changes in the coordinate domain, and the exponents are not necessarily integer. The approach provides a formula describing the local variability of scalar fields which contains and generalizes Taylor’s formula of first order. The functions giving the contact are Müntz polynomials. The knowledge of their coefficients and exponents enables the finding of local extremes including cases of non-smoothness. Sufficient conditions for the existence of global maxima and minima of concave-convex functions are obtained as well.     

关于ζ函数的积分表示

主要研究了ζ函数的积分表示形式;通过解析数论的研究方法,利用黎曼ζ函数方程,给出了关于赫尔维茨ζ函数的埃尔米特公式,利用埃尔米特公式得出关于Γ函数的比内第二表达式,通过ζ函数得出Γ函数一些性质.     

On the Ni(x) integral function and its application to the Airy’s non-homogeneous equation

In this article, we discuss a recently introduced function, Ni(x), to which we will refer as the Nield-Kuznetsov function. This function is attractive in the solution of inhomogeneous Airy’s equation. We derive and document some elementary properties of this function and outline its application to Airy’s equation subject to initial conditions. We introduce another function, Ki(x), that arises in connection with Ni(x) when solving Airy’s equation with a variable forcing function. In Appendix A, we derive a number of properties of both Ni(x) and Ki(x), their integral representation, ascending and asymptotic series representations. We develop iterative formulae for computing all derivatives of these functions, and formulae for computing the values of the derivatives at x = 0. An interesting finding is the type of differential equations Ni(x) satisfies. In particular, it poses itself as a solution to Langer’s comparison equation.     

A Green’s function formulation of nonlocal finite-difference schemes for reaction-diffusion equations

Reaction-diffusion equations are commonly used in different science and engineering fields to describe spatial patterns arising from the interaction of chemical or biochemical reactions and diffusive transport mechanisms. The aim of this work is to show that a Green’s function formulation of reaction-diffusion PDEs is a suitable framework to derive FD schemes incorporating both O(h²) accuracy and nonlocal approximations in the whole domain (including boundary nodes). By doing so, the approach departs from a Green’s function formulation of the boundary-value problem to pose an approximation problem based on a domain decomposition. Within each subdomain, the corresponding integral equation is forced to have zero residual at given grid points. Different FD schemes are obtained depending on the numerical scheme used for computing the Green’s integral over each subdomain. Dirichlet and Neumann boundary conditions are considered, showing that the FD scheme based on the Green’s function formulation incorporates, in a natural way, the effects of boundary nodes in the discretization approximation.     

Existence of almost periodic solutions for strongly stable nonlinear impulsive differential-difference equations

Sufficient conditions are established for the existence of almost periodic solutions for strongly stable nonlinear impulsive differential-difference equations. The investigations are carried out by means of piecewise continuous functions of Lyapunov type and by using Markoff’s sets. We provide an example to demonstrate the effectiveness of our results.     

Variational iteration method for elastodynamic Green’s functions

In this study, a new application of the variational iteration method is presented. We use this method to obtain approximations to 3D Green’s function for the dynamic system of anisotropic elasticity. The numerical results obtained from convolution of Green’s function and data of the Cauchy problem are compared with the exact solution for cubic media.     

A statistical analysis of measurement results obtained from nonlinear physical laws

Statistical properties of quantities obtained from measurements based on some fundamental physical laws are analyzed in this paper, using methods for expressing measurement uncertainty of indirectly measured quantities. Nonlinear laws are considered, with repeated measurements of input quantities providing identical readings on respective digital instruments. Under such conditions, input quantities are assigned uniform distributions. It is shown that in addition to the asymmetry arising in the probability density function (PDF) of the output quantity, its mean and nominal value also differ. Resistance obtained from Ohm’s law and power measured using three alternative forms of Joule’s law are investigated in detail. Some characteristic shapes of PDFs are obtained by a Monte Carlo method (MCM). It is demonstrated that the mean value of the measured resistance is greater than its nominal value. It is also proved that for two forms of Joule’s law the mean value of the measured power is larger than its nominal value, while the third variant of the law renders the mean and the nominal power equal. Analytical expressions for the deviations of mean from nominal values are derived. It is suggested that the presented analysis can readily be adapted to many other nonlinear physical laws.