Economical cascadic multigrid method (ECMG)

In this paper,an economical cascadic multigrid method is proposed.Compared with the usual cascadic multigrid method developed by Bornemann and Deuflhard,the new one requires less iterations on each level,especially on the coarser grids.Many operations can be saved in the new cascadic multigrid algorithms.The main ingredient is the control of the iteration numbers on the each level to preserve the accuracy without over iterations.The theoretical justification is based on the observations that the error reduction rate of an iteration scheme in terms of the smoothing property is no longer accurate while the iteration number is big enough.A new formulae of the error reduction rate is employed in our new algorithm.Numerical experiments are reported to support our theory.     

FORMAL GROUPS AND LOCAL CLASS FIELD THEORY

The purpose of this paper is to prove that every abelian extenison of a local field can be embedded into certain generalized Lubin-Tate extensions. As a consequence of the embedding theorem, a new proof of local class field theory is given, which looks more intuitive than Galois cohomology. Also the author gets a necessary and sufficient condition for a totally ramified extension of degree p to be normal in terms of the coefficients of its definition equation.     

A structural theorem on embedded graphs and its application to colorings

In this paper, a Lebesgue type theorem on the structure of graphs embedded in the surface of characteristic σ≤ 0 is given, that generalizes a result of Borodin on plane graphs. As a consequence, it is proved that every such graph without i-circuits for 4 ≤ i ≤ 11 - 3σ is 3-choosable, that offers a new upper bound to a question of Y. Zhao.     

New Monotonicity Formulae for Semi-linear Elliptic and Parabolic Systems

The authors establish a general monotonicity formula for the following elliptic system
△ui＋fi（x,ui,…,um）=0 in Ω,
where Ω belong to belong to R^n is a regular domain, （fi（x, u1,... ,um）） = △↓F（x,→↑u）, F（x,→↑u ） is a given smooth function of x ∈ R^n and →↑u = （u1,…,um） ∈ R^m. The system comes from understanding the stationary case of Ginzburg-Landau model. A new monotonicity formula is also set up for the following parabolic system
δtui-△ui-fi（x,ui,…,um）=0 in（ti,t2）×R^n,
where t1 〈 t2 are two constants, （fi（x,→↑u ） is given as above. The new monotonicity formulae are focused more attention on the monotonicity of nonlinear terms. The new point of the results is that an index β is introduced to measure the monotonicity of the nonlinear terms in the problems. The index β in the study of monotonieity formulae is useful in understanding the behavior of blow-up sequences of solutions. Another new feature is that the previous monotonicity formulae are extended to nonhomogeneous nonlinearities. As applications, the Ginzburg-Landau model and some different generalizations to the free boundary problems are studied.     

Dynamic optimal strategy for monitoring disease recurrence

Surveillance to detect cancer recurrence is an important part of care for cancer survivors.In this paper we discuss the design of optimal strategies for early detection of disease recurrence based on each patient’s distinct biomarker trajectory and periodically updated risk estimated in the setting of a prospective cohort study.We adopt a latent class joint model which considers a longitudinal biomarker process and an event process jointly,to address heterogeneity of patients and disease,to discover distinct biomarker trajectory patterns,to classify patients into different risk groups,and to predict the risk of disease recurrence.The model is used to develop a monitoring strategy that dynamically modifies the monitoring intervals according to patients’ current risk derived from periodically updated biomarker measurements and other indicators of disease spread.The optimal biomarker assessment time is derived using a utility function.We develop an algorithm to apply the proposed strategy to monitoring of new patients after initial treatment.We illustrate the models and the derivation of the optimal strategy using simulated data from monitoring prostate cancer recurrence over a 5-year period.     

Hybrid Mean Value of the Hyper Cochrane Sums

The main purpose of this paper is to use the analytic methods to study the hybrid mean value involving the hyper Cochrane sums, and give several sharp asymptotic formulae.     

混合约束下广义几何规划的一种全局收敛算法

In this paper, we develop a rapidly convergent algorithm for mixed constrained signomial geometric programming. The algorithm makes use of the characteristics of signomial geometric programming, and establishes a new active-set strategy on the basis of trust region method. The global convergence is proved, and some numerical tests are given to illustrate the effectiveness.     

New Calderón reproducing formulae with exponential decay on spaces of homogeneous type

Assume that(X,d,μ) is a space of homogeneous type in the sense of Coifman and Weiss(1971,1977). In this article, motivated by the breakthrough work of Auscher and Hyt(o|¨)nen(2013) on orthonormal bases of regular wavelets on spaces of homogeneous type, we introduce a new kind of approximations of the identity with exponential decay(for short, exp-ATI). Via such an exp-ATI, motivated by another creative idea of Han et al.(2018) to merge the aforementioned orthonormal bases of regular wavelets into the frame of the existed distributional theory on spaces of homogeneous type, we establish the homogeneous continuous/discrete Calderón reproducing formulae on(X, d,μ), as well as their inhomogeneous counterparts. The novelty of this article exists in that d is only assumed to be a quasi-metric and the underlying measure μ a doubling measure,not necessary to satisfy the reverse doubling condition. It is well known that Calderón reproducing formulae are the cornerstone to develop analysis and, especially, harmonic analysis on spaces of homogeneous type.     

The First Power Mean of the Inversion of L-Functions Weighted by Quadratic Gauss Sums

The main purpose of this paper is to use estimates for character sums and analytic methods to study the first power mean of the inversion of Dirichlet L-functions with the weight of general quadratic Gauss sums, and three asymptotic formulae are obtained.     

Mathematical stencil and its application in finite difference approximation to the poisson equation

The concept of mathematical stencil and the strategy of stencil elimination for solving the finite difference equation is presented,and then a new type of the iteration algo- rithm is established for the Poisson equation.The new algorithm has not only the obvious property of parallelism,but also faster convergence rate than that of the classical Jacobi iteration.Numerical experiments show that the time for the new algorithm is less than that of Jacobi and Gauss-Seidel methods to obtain the same precision,and the computational velocity increases obviously when the new iterative method,instead of Jacobi method,is applied to polish operation in multi-grid method,furthermore,the polynomial acceleration method is still applicable to the new iterative method.     

On generalized invariant cubature formulae

An important quality criterion of cubature formulae is their algebraic or trigonometric degree of exactness. The invariant theory is a powerful tool to construct cubature formulae of a given degree. In this paper, a quantitative expression is established for the classical invariant cubature formulas (ICFs). Motivated by this expression (or structure), we generalize the concept of ICFs and extend the famous Sobolev's Theorem on ICFs. The transformations allowed are no longer just orthogonal transformations. We illustrate the concepts and the constructions of the generalized ICFs by several examples.     

Simple Fourth-Degree Cubature Formulae with Few Nodes over General Product Regions

A simple method is proposed for constructing fourth-degree cubature formulae over general product regions with no symmetric assumptions. The cubature formulae that are constructed contain at most $n^2+7n+3$ nodes and they are likely the first kind of fourth-degree cubature formulae with roughly $n^2$ nodes for non-symmetric integrations. Moreover, two special cases are given to reduce the number of nodes further. A theoretical upper bound for minimal number of cubature nodes is also obtained.     

基于连分式与Newton-Padé逼近的数值积分

首先利用Newton-Pade表中部分序列推导出连分式,提出逆差商算法,算出关于高阶导数与高阶差商的连分式插值余项.接着,构造基于此类连分式的有理求积公式与相应的复化求积公式,算出相应的求积余项,研究表明,在一定条件下,求积公式序列一致收敛于积分真值.然后,为保证连分式计算顺利进行,研究连分式分母非0的充分条件.最后,若干数值算例表明,对某些函数采用新提出的复化有理求积公式计算数值积分,所得结果优于采用Simpson公式.     

Boundary layer approximate approximations and cubature of potentials in domains

In this article we present a new approach to the computation of volume potentials over bounded domains, which is based on the quasi‐interpolation of the density by almost locally supported basis functions for which the corresponding volume potentials are known. The quasi‐interpolant is a linear combination of the basis function with shifted and scaled arguments and with coefficients explicitly given by the point values of the density. Thus, the approach results in semi‐analytic cubature formulae for volume potentials, which prove to be high order approximations of the integrals. It is based on multi‐resolution schemes for accurate approximations up to the boundary by applying approximate refinement equations of the basis functions and iterative approximations on finer grids. We obtain asymptotic error estimates for the quasi‐interpolation and corresponding cubature formulae and provide some numerical examples. This revised version was published online in June 2006 with corrections to the Cover Date.     

Polynomial interpolation in several variables,cubature formulae,and ideals[*]Supported by the National Science Foundation under Grant DMS-9802265.

We discuss polynomial interpolation in several variables from a polynomial ideal point of view. One of the results states that if I is a real polynomial ideal with real variety and if its codimension is equal to the cardinality of its variety, then for each monomial order there is a unique polynomial that interpolates on the points in the variety. The result is motivated by the problem of constructing cubature formulae, and it leads to a theorem on cubature formulae which can be considered an extension of Gaussian quadrature formulae to several variables. This revised version was published online in June 2006 with corrections to the Cover Date.     

Minimal cubature formulae for a family of radial weight functions

For each fixed n a radial weight function on is given in closed form which admits minimal cubature formulae of both even and odd degree. The connection between the cubature formula and the polynomial interpolation is discussed in detail. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the construction of multi-dimensional embedded cubature formulae

Summary In order to compute an integralI[f], one needs at least two cubature formulaeQ _j ,j{1, 2}. |Q ₁[f]–Q ₂[f]| can be used as an error estimate for the less precise cubature formula. In order to reduce the amount of work, one can try to reuse some of the function evaluations needed forQ ₁, inQ ₂. The easiest way to construct embedded cubature formulae is: start with a high degree formulaQ ₁, drop (at least) one knot and calculate the weights such that the new formulaQ ₂ is exact for as much monomials as possible. We describe how such embedded formulae with positive weights can be found. The disadvantage of such embedded cubature formulae is that there is in general a large difference in the degree of exactness of the two formulae. In this paper we will explain how the high degree formula can be chosen to obtain an embedded pair of cubature formulae of degrees 2m+1/2m–1. The method works for all regions ⁿ ,n2. We will also show the influence of structure on the cubature formulae.     

Construction of cubature formulae with preassigned nodes§

In this article, a technique for developing cubature rules with preassigned nodes is presented to avoid wasting of information in scientific computation. The corresponding constructive method of the cubature rule is also given. As an application of the rules, a cubature formula on disk, which was derived via the method of reproducing kernel in (Xu, Y., 2000, Constructing cubature formulae by the method of reproducing kernel. Numerische Mathematik, 85, 155–173), is reconstructed by using our technique. When the preassigned nodes are selected as the nodes of a cubature formula of lower degree, an embedded cubature formula can be easily obtained by the presented method. Furthermore, some examples are included in the article.     

基于Thiele型连分式的数值积分

基于Thiele型连分式构造求积公式,这类求积公式能再生由Thiele型连分式前三项渐近式的线性组合所表示的任意有理函数,接着算出求积余项,并推导出分母在给定区间上无零点的充分条件.更进一步,通过等分给定区间,构造相应的复化求积公式,并算出求积余项.研究表明,在若干条件满足的前提下,复化求积公式序列能一致收敛于积分真值,一些数值算例说明了这一点.     

Symbolic-numeric Gaussian cubature rules

It is well known that Gaussian cubature rules are related to multivariate orthogonal polynomials. The cubature rules found in the literature use common zeroes of some linearly independent set of products of basically univariate polynomials. We show how a new family of multivariate orthogonal polynomials, so-called spherical orthogonal polynomials, leads to symbolic-numeric Gaussian cubature rules in a very natural way. They can be used for the integration of multivariate functions that in addition may depend on a vector of parameters and they are exact for multivariate parameterized polynomials. Purely numeric Gaussian cubature rules for the exact integration of multivariate polynomials can also be obtained.We illustrate their use for the symbolic-numeric solution of the partial differential equations satisfied by the Appell function F₂, which arises frequently in various physical and chemical applications. The advantage of a symbolic-numeric formula over a purely numeric one is that one obtains a continuous extension, in terms of the parameters, of the numeric solution. The number of symbolic-numeric nodes in our Gaussian cubature rules is minimal, namely m for the exact integration of a polynomial of homogeneous degree 2m−1.In Section 1 we describe how the symbolic-numeric rules are constructed, in any dimension and for any order. In Sections 2, 3 and 4 we explicit them on different domains and for different weight functions. An illustration of the new formulas is given in Section 5 and we show in Section 6 how numeric cubature rules can be derived for the exact integration of multivariate polynomials. From Section 7 it is clear that there is a connection between our symbolic-numeric cubature rules and numeric cubature formulae with a minimal (or small) number of nodes.