Constructing cubature formulae of degree 5 with few points

This paper is devoted to construct a family of fifth degree cubature formulae for n$n$-cube with symmetric measure and n$n$-dimensional spherically symmetrical region. The formula forn$n$-cube contains at most n²+5n+3$n^2+5n+3$ points and for n$n$-dimensional spherically symmetrical region contains only n²+3n+3$n^2+3n+3$ points. Moreover, the numbers can be reduced to n²+3n+1$n^2+3n+1$ and n²+n+1$n^2+n+1$ if n=7$n=7$ respectively, the latter of which is minimal.     

Cubature over the sphere in Sobolev spaces of arbitrary order

This paper studies numerical integration (or cubature) over the unit sphere for functions in arbitrary Sobolev spaces H^s(S²), s>1. We discuss sequences of cubature rules, where (i) the rule Q_m(n) uses m(n) points and is assumed to integrate exactly all (spherical) polynomials of degree ≤n and (ii) the sequence (Q_m(n)) satisfies a certain local regularity property. This local regularity property is automatically satisfied if each Q_m(n) has positive weights. It is shown that for functions in the unit ball of the Sobolev space H^s(S²), s>1, the worst-case cubature error has the order of convergence O(n^-s), a result previously known only for the particular case . The crucial step in the extension to general s>1 is a novel representation of , where P_ℓ is the Legendre polynomial of degree ℓ, in which the dominant term is a polynomial of degree n, which is therefore integrated exactly by the rule Q_m(n). The order of convergence O(n^-s) is optimal for sequences (Q_m(n)) of cubature rules with properties (i) and (ii) if Q_m(n) uses m(n)=O(n²) points.     

Numerical treatment of a twisted tail using extrapolation methods

Highly oscillatory integral, called a twisted tail, is proposed as a challenge in The SIAM 100-digit challenge. A Study in High-Accuracy Numerical Computing, where Drik Laurie developed numerical algorithms based on the use of Aitken’s Δ²-method, complex integration and transformation to a Fourier integral. Another algorithm is developed by Walter Gautschi based on Longman’s method; Newton’s method for solving a nonlinear equation; Gaussian quadrature; and the epsilon algorithm of Wynn for accelerating the convergence of infinite series. In the present work, nonlinear transformations for improving the convergence of oscillatory integrals are applied to the integration of this wildly oscillating function. Specifically, the transformation and its companion the W algorithm, and the G transformation are all used in the analysis of the integral. A Fortran program is developed employing each of the methods, and accuracies of up to 15 correct digits are reached in double precision.     

The index of merit of kth-copy integration lattices

r2d2lri   is an automatic two-dimensional cubature algorithm that demonstrates the practical value of using an augmentation sequence consisting of (2^k)²$(2^k{)}^2$-copy lattices as a basis for numerical integration. This paper investigates use of similar embedded augmentation sequences in higher dimensions by developing theoretical results relating to the index of merit of s  -dimensional (2^k)^s$(2^k{)}^s$-copy lattices generated from rank-1 simple lattices. The theoretical results can be used to guide the search for good augmentation sequences in s dimensions in the sense of high index of merit.     

Integration over a fractal curve and the jump problem

A definition of integration, i.e., a generalization of a functional of the form

On the number of flats spanned by a set of points in PG(d, q)

It is shown that for fixed 1 r s < d and > 0, if X PG(d, q) contains (1 + )q^s points, then the number of r-flats spanned by X is at least c()q^{(r+1)(s+1−r)}, i.e. a positive fraction of the number of r-flats in PG(s + 1,q).     

DECUHR: an algorithm for automatic integration of singular functions over a hyperrectangular region

We describe an automatic cubature algorithm for functions that have a singularity on the surface of the integration region. The algorithm combines an adaptive subdivision strategy with extrapolation. The extrapolation uses a non-uniform subdivision that can be directly incorporated into the subdivision strategy used for the adaptive algorithm. The algorithm is designed to integrate a vector function over ann-dimensional rectangular region and a FORTRAN implementation is included.Supported by the Norwegian Research Council for Science and the Humanities.     

On the Cauchy problem for a class of iterated Fuchsian partial differential equations

In this paper, we consider the Cauchy problem with ramified data for a class of iterated Fuchsian partial differential equations. We give an explicit representation of the solution in terms of Gauss hypergeometric functions. Our results are illustrated through some examples.     

一类二元函数连续性的等价刻画及在三角模上的应用

关于二元函数的连续,经典数学分析中有熟知的结果,即"如果二元函数连续,则必关于每个单变量连续。反之,则未必"。本文证明对于单调且对称的二元函数而言,其二元连续等价于单变量连续,并重新定义了三角模的连续。     

Triple-deck analysis of formation of supersonic and local separation regions in transonic steady flow over a roughness element on the surface of a body of revolution

Transonic axisymmetric flow over a body of rotation with a small roughness element located on its surface is considered. The body is manly cylindrical. The roughness height is assumed to be much smaller than the radius of the cylinder and such that a triple-deck flow is induced in its neighborhood. The goal of the work is to study the effect of the cylinder radius and the roughness shape on the triple-deck flow when the cylinder radius is of the same order as the transverse size of the triple-deck interaction region. In this case, the effect of three-dimensionality of the flow is exhibited even in the first approximation. Special attention is given to the structure of supersonic regions and closing shock waves arising in the outer potential region, as well as to local separation regions if they develop in the lower viscous boundary sublayer. Specifically, it is shown that, as the radius of the cylinder increases at a fixed roughness height, the shock intensity grows considerably, whereas the position of the main shock varies little.     

Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves

We present an efficient algorithm for finding the shortest path joining two points in a sequence of triangles in three-dimensional space without planar unfolding. The concept of a funnel associated with a common edge along a sequence of triangles is introduced, that is similar to Lee and Preparata’s one in a simple polygon. The sequence of funnels associated with all common edges of the sequence is constructed and then the shortest path is determined by cusps of these funnels. Such funnels are determined iteratively to their associated edges by the Method of Orienting Curves, which was introduced by Phu [Ein konstruktives Lösungsverfahren für das Problem des Inpolygons kleinsten Umfangs von J. Steiner. Optimization. 1987;18:349–359]. The method consists of the concepts of final curves and orienting curves (the special cases of straightest geodesics). We then show that the shortest path from the cusp of a given funnel to the direct destination in the processed region of the funnel is determined by parts of orienting curves and a final curve. A numerical example for finding the shortest path joining two points in the sequence of triangles is presented and visualized by JavaView software.     

Steady state numerical simulation of the particle collection efficiency of a new urban sustainable gravity settler using design of experiments by FVM

The aim of this work is to analyze the efficiency of a new sustainable urban gravity settler to avoid the solid particle transport, to improve the water waste quality and to prevent pollution problems due to rain water harvesting in areas with no drainage pavement. In order to get this objective, it is necessary to solve particle transport equations along with the turbulent fluid flow equations since there are two phases: solid phase (sand particles) and fluid phase (water). In the first place, the turbulent flow is modelled by solving the Reynolds-averaged Navier-Stokes (RANS) equations for incompressible viscous flows through the finite volume method (FVM) and then, once the flow velocity field has been determined, representative particles are tracked using the Lagrangian approach. Within the particle transport models, a particle transport model termed as Lagrangian particle tracking model is used, where particulates are tracked through the flow in a Lagrangian way. The full particulate phase is modelled by just a sample of about 2,000 individual particles. The tracking is carried out by forming a set of ordinary differential equations in time for each particle, consisting of equations for position and velocity. These equations are then integrated using a simple integration method to calculate the behaviour of the particles as they traverse the flow domain. The entire FVM model is built and the design of experiments (DOE) method was used to limit the number of simulations required, saving on the computational time significantly needed to arrive at the optimum configuration of the settler. Finally, conclusions of this work are exposed.     

Spaces of continuous functions over a Ψ-space

The Lindelöf property of the space of continuous real-valued continuous functions is studied. A consistent example of an uncountable Ψ-like space is constructed for which the space of continuous real-valued functions with the pointwise convergence topology is Lindelöf.     

C*代数l上的左模的半双线性型的稳定性

本文分别研究了 C^*-代数l上的单位左模和具有实阶零性质的CC^*代数l上的单位左模的半双线性型的 Hyers-Ulam 稳定性.     

Generalised twists, , and the p-energy over a space of measure preserving maps

Let be a bounded Lipschitz domain and consider the energy functional

with p]1,∞[ over the space of measure preserving maps

In this paper we introduce a class of maps referred to as generalised twists and examine them in connection with the Euler–Lagrange equations associated with over . The main result is a surprising discrepancy between even and odd dimensions. Here we show that in even dimensions the latter system of equations admit infinitely many smooth solutions, modulo isometries, amongst such maps. In odd dimensions this number reduces to one. The result relies on a careful analysis of the full versus the restricted Euler–Lagrange equations where a key ingredient is a necessary and sufficient condition for an associated vector field to be a gradient.     

A hybrid approach for the integration of a rational function

A hybrid integration algorithm obtaining an indefinite integral of a rational function (say q/r, q and r are polynomials) with floating-point but real coefficients is proposed. The algorithm consists of four steps and is based on combinations of symbolic and numeric computations (hybrid computation). The first step is a hybrid preprocessing stage. An integrand is decomposed into rational and logarithmic parts by using an approximate Horowitz' method which allows floating-point coefficients. Here, we replace the Euclidean GCD algorithm with an approximate-GCD algorithm which was proposed by Sasaki and Noda recently. It is easy to integrate the rational part. The logarithmic part is integrated numerically in the second step. Zeros of a denominator of it are computed by the numerical Durand-Kerner method which computes all zeros of a polynomial equation simultaneously. The integrand is then decomposed into partial fractions in the third step. Coefficients of partial fractions are determined by residue theory. Finally, in the fourth step, partial fractions are transformed into the resulting indefinite integral by using well-known rules of integrals. The hybrid algorithm proposed here gives both indefinite integrals and accurate values of definite integrals. Numerical errors in the hybrid algorithm depend only on errors in the second step. The algorithm evaluates some problems where numerical methods are inefficient or incapable, or a pure symbolic method is theoretically insufficient.     

Numerical solution of the Poisson equation over hypercubes using reduced Chebyshev polynomial bases

We describe how to use new reduced size polynomial approximations for the numerical solution of the Poisson equation over hypercubes. Our method is based on a non-standard Galerkin method which allows test functions which do not verify the boundary conditions. Numerical examples are given in dimensions up to 8 on solutions with different smoothness using the same approximation basis for both situations. A special attention is paid on conditioning problems.