An approximation of the surfaces areas using the classical Bernstein quadrature formula

In this article, we try to assign a place on the map of the closed Newton–Cotés quadrature formulas to a new approximation formula based on the classical Bernstein polynomials. We create a procedure for a computer implementation that allows us to verify the accuracy of the new approximation formula. In order to get a complete image of this kind of approximation, we compare some well‐known quadrature formulas. Although effective in most situations, there are instances when the composite quadrature formulas cannot be applied, as they use equally‐spaced nodes. We present also an adaptive method that is used to obtain better approximations and to minimize the number of function evaluations. Numerical examples are given to increase the validity of the theoretical aspects.     

Higher order spectral shift

We construct higher order spectral shift functions, extending the perturbation theory results of M.G. Krein [M.G. Krein, On a trace formula in perturbation theory, Mat. Sb. 33 (1953) 597-626 (in Russian)] and L.S. Koplienko [L.S. Koplienko, Trace formula for perturbations of nonnuclear type, Sibirsk. Mat. Zh. 25 (1984) 62-71 (in Russian); translation in: Trace formula for nontrace-class perturbations, Siberian Math. J. 25 (1984) 735-743] on representations for the remainders of the first and second order Taylor-type approximations of operator functions. The higher order spectral shift functions represent the remainders of higher order Taylor-type approximations; they can be expressed recursively via the lower order (in particular, Krein's and Koplienko's) ones. We also obtain higher order spectral averaging formulas generalizing the Birman-Solomyak spectral averaging formula. The results are obtained in the semi-finite von Neumann algebra setting, with the perturbation taken in the Hilbert-Schmidt class of the algebra.     

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.     

A tighter variant of Jensen’s lower bound for stochastic programs and separable approximations to recourse functions

In this paper, we propose a new method to compute lower bounds on the optimal objective value of a stochastic program and show how this method can be used to construct separable approximations to the recourse functions. We show that our method yields tighter lower bounds than Jensen’s lower bound and it requires a reasonable amount of computational effort even for large problems. The fundamental idea behind our method is to relax certain constraints by associating dual multipliers with them. This yields a smaller stochastic program that is easier to solve. We particularly focus on the special case where we relax all but one of the constraints. In this case, the recourse functions of the smaller stochastic program are one dimensional functions. We use these one dimensional recourse functions to construct separable approximations to the original recourse functions. Computational experiments indicate that our lower bounds can significantly improve Jensen’s lower bound and our recourse function approximations can provide good solutions.     

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 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.     

Numerical solution of the one-dimensional time-independent Schrödinger’s equation by recursive evaluation of derivatives

We develop a simple numerical method for solving the one-dimensional time-independent Schrödinger’s equation. Our method computes the desired solutions as Taylor series expansions of arbitrarily large orders. Instead of using approximations such as difference quotients for the derivatives needed in the Taylor series expansions, we use recursive formulas obtained using the governing differential equation itself to calculate exact derivatives. Since our approach does not use difference formulas or symbolic manipulation, it requires much less computational effort when compared to the techniques previously reported in the literature. We illustrate the effectiveness of our method by obtaining numerical solutions of the one-dimensional harmonic oscillator, the hydrogen atom, and the one-dimensional double-well anharmonic oscillator.     

Quadrature formulas for oscillatory integral transforms

Summary Quadrature formulas are obtained for the Fourier and Bessel transforms which correspond to the well-known Gauss-Laguerre formula for the Laplace transform. These formulas provide effective asymptotic approximations, complete with error bounds. Comparison is also made between the quadrature formulas and the asymptotic expansions of these transforms.This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under Contract A7359     

Torsion formulas for signed graphs

Following our recent exposition on the algebraic foundations of signed graphs, we introduce bond (circuit) basis matrices for the tension (flow) lattices of signed graphs, and compute the torsions of such matrices and Laplacians. We present closed formulas for the torsions of the incidence matrix, the Laplacian, bond basis matrices, and circuit basis matrices. These formulas show that the torsions of all such matrices are powers of 2, and so imply that the matroids of signed graphs are representable over any field of characteristic not 2. A notable feature of using torsion is that the Matrix-Tree formula for ordinary graphs and Zaslavsky’s formula for unbalanced signed graphs are unified into one Matrix-Basis formula in terms of the torsion of its Laplacian matrix, rather than in terms of its determinant, which vanishes for an ordinary graph unless one row is deleted from the incidence matrix.     

Gaussian quadrature in Ramanujan’s Second Notebook

Ramanujan’s notebooks contain many approximations, usually without explanations. Some of his approximations to series are explained as quadrature formulas, usually of Gaussian type. Dedicated to the memory of Professor K G Ramanathan     

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.     

An Explicit Formula for the Coefficients in Laplace’s Method

Laplace’s method is one of the fundamental techniques in the asymptotic approximation of integrals. The coefficients appearing in the resulting asymptotic expansion arise as the coefficients of a convergent or asymptotic series of a function defined in an implicit form. Due to the tedious computation of these coefficients, most standard textbooks on asymptotic approximations of integrals do not give explicit formulas for them. Nevertheless, we can find some more or less explicit representations for the coefficients in the literature: Perron’s formula gives them in terms of derivatives of an explicit function; Campbell, Fröman and Walles simplified Perron’s method by computing these derivatives using an explicit recurrence relation. The most recent contribution is due to Wojdylo, who rediscovered the Campbell, Fröman and Walles formula and rewrote it in terms of partial ordinary Bell polynomials. In this paper, we provide an alternative representation for the coefficients that contains ordinary potential polynomials. The proof is based on Perron’s formula and a theorem of Comtet. The asymptotic expansions of the gamma function and the incomplete gamma function are given as illustrations.     

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.     

q-Hypergeometric Series and Macdonald Functions

We derive a duality formula for two-row Macdonald functions by studying their relation with basic hypergeometric functions. We introduce two parameter vertex operators to construct a family of symmetric functions generalizing Hall-Littlewood functions. Their relation with Macdonald functions is governed by a very well-poised q-hypergeometric functions of type ₄₃, for which we obtain linear transformation formulas in terms of the Jacobi theta function and the q-Gamma function. The transformation formulas are then used to give the duality formula and a new formula for two-row Macdonald functions in terms of the vertex operators. The Jack polynomials are also treated accordingly.     

Green's function of two-dimensional time-fractional diffusion equation using addition formula of Wright function

In this paper, using the Mellin transform of Wright function we derive an addition formula for the Wright function. In some special cases, addition formulas for the Hermite, Bessel and Mittag-Leffler functions are also given and the Green's function of two-dimensional time-fractional diffusion equation is presented in the whole plane.     

Certain summation and transformation formulas for generalized hypergeometric series

We derive summation formulas for generalized hypergeometric series of unit argument, one of which upon specialization reduces to Minton’s summation theorem. As an application we deduce a reduction formula for a certain Kampé de Fériet function that in turn provides a Kummer-type transformation formula for the generalized hypergeometric function _pF_p(x).     

C半群的概率逼近问题

借助Pettis积分、随机过程、矩生成函数及算子值数学期望,给出了一般形式的C半群概率逼近指数公式、生成定理及其收敛速度的估计式,也从另一个角度得出C半群概率表示的Vonorovskaya型渐近公式.     

一种新的修正SR1更新公式及其算法收敛性

SR1更新公式对比其他的拟牛顿更新公式,会更加简单且每次迭代需要更少的计算量。但是一般SR1更新公式的收敛性质是在一致线性无关这一很强的条件下证明的。基于前人的研究成果,提出了一种新的修正SR1公式,并分别证明了其在一致线性无关和没有一致线性无关这两个条件下的局部收敛性,最后通过数值实验验证了提出的更新公式的有效性,以及所作出假设的合理性。根据实验数据显示,在某些条件下基于所提出更新公式的拟牛顿算法会比基于传统的SR1更新公式的算法收敛效果更好一些。     

Multiple extensions of a finite Euler's pentagonal number theorem and the Lucas formulas

Motivated by the resemblance of a multivariate series identity and a finite analogue of Euler's pentagonal number theorem, we study multiple extensions of the latter formula. In a different direction we derive a common extension of this multivariate series identity and two formulas of Lucas. Finally we give a combinatorial proof of Lucas’ formulas.