MULTIVARIATE FOURIER TRANSFORM METHODS OVER SIMPLEX AND SUPER-SIMPLEX DOMAINS

In this paper we propose the well-known Fourier method on some non-tensor productdomains in R~d, inclding simplex and so-called super-simplex which consists of (d 1)!simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a parallelhexagon and a parallel quadrilateral dodecahedron, respectively. We have extended mostof concepts and results of the traditional Fourier methods on multivariate cases, such asFourier basis system, Fourier series, discrete Fourier transform (DFT) and its fast algorithm(FFT) on the super-simplex, as well as generalized sine and cosine transforms (DST, DCT)and related fast algorithms over a simplex. The relationship between the basic orthogonalsystem and eigen-functions of a Laplacian-like operator over these domains is explored.     

基于傅里叶级数展开式的有效期权定价方法

A novel option pricing method based on Fourier-cosine series expansion was proposed by Fang and Oosterlee. Developing their idea, three new option pricing methods based on Fourier, Fourier-cosine and Fourier-sine series expansions are presented in this paper, which are more efficient when the option prices are calculated with many strike prices. A series of numerical experiments under different exp-L~vy models are also given to compare these new methods with the Fang and Oosterlee＇s method and other methods.     

A survey on Fourier analysis methods for solving the compressible Navier-Stokes equations

Fourier analysis methods and in particular techniques based on Littlewood-Paley decomposition and paraproduct have known a growing interest recently for the study of nonlinear evolutionary equations.In this survey paper,we explain how these methods may be implemented so as to study the compresible Navier-Stokes equations in the whole space.We shall investigate both the initial value problem in critical Besov spaces and the low Mach number asymptotics.     

A MPI PARALLEL PRECONDITIONED SPECTRAL ELEMENT METHOD FOR THE HELMHOLTZ EQUATION

Spectral element method is well known as high-order method, and has potential better parallel feature as compared with low order methods. In this paper, a parallel preconditioned conjugate gradient iterative method is proposed to solving the spectral element approximation of the Helmholtz equation. The parallel algorithm is shown to have good performance as compared to non parallel cases, especially when the stiffness matrix is not memorized. A series of numerical experiments in one dimensional case is carried out to demonstrate the efficiency of the proposed method.     

L~p Estimates for Bi-parameter and Bilinear Fourier Integral Operators

Fourier integral operators play an important role in Fourier analysis and partial differential equations. In this paper, we deal with the boundedness of the bilinear and bi-parameter Fourier integral operators, which are motivated by the study of one-parameter FIOs and bilinear and bi-parameter Fourier multipliers and pseudo-differential operators. We consider such FIOs when they have compact support in spatial variables. If they contain a real-valued phase φ(x, ξ, η) which is jointly homogeneous in the frequency variables ξ, η, and amplitudes of order zero supported away from the axes and the antidiagonal, we can show that the boundedness holds in the local-L~2 case. Some stronger boundedness results are also obtained under more restricted conditions on the phase functions. Thus our results extend the boundedness results for bilinear and one-parameter FIOs and bilinear and bi-parameter pseudo-differential operators to the case of bilinear and bi-parameter FIOs.     

LARGE TIME ASYMPTOTIC BEHAVIOR OF THE COMPRESSIBLE NAVIER-STOKES EQUATIONS IN PARTIAL SPACE-PERIODIC DOMAINS

In this article, we study the large time behavior of the 3-D isentropic compressible Navier-Stokes equation in the partial space-periodic domains, and simultaneously show that the related profile systems can be described by like Navier-Stokes equations with suitable"pressure" functions in lower dimensions. Our proofs are based on the energy methods together with some delicate analysis on the corresponding linearized problems.     

Convergence and complexity of arbitrary order adaptive mixed element methods for the Poisson equation

This paper discusses convergence and complexity of arbitrary,but fixed,order adaptive mixed element methods for the Poisson equation in two and three dimensions.The two main ingredients in the analysis,namely the quasi-orthogonality and the discrete reliability,are achieved by use of a discrete Helmholtz decomposition and a discrete inf-sup condition.The adaptive algorithms are shown to be contractive for the sum of the error of flux in L2-norm and the scaled error estimator after each step of mesh refinement and to be quasi-optimal with respect to the number of elements of underlying partitions.The methods do not require a separate treatment for the data oscillation.     

BIVARIATE INTERPOLATING POLYNOMIALS AND SPLINES (I)

The multivariate splines which were first presented by deBooor as a complete theoreticalsystem have intrigued many mathematicians who have devoted many works in this field whichis still in the process of development.The author of this paper is interested in the area of inter-polation with special emphasis on the interpolation methods and their approximation orders.But such B-splines(both univariate and multivariate)do not interpolated directly,so I ap-proached this problem in another way which is to extend my interpolating spline of degree2n-1 in univariate case(See[7])to multivariate case.I selected triangulated region which isinspired by other mathematicians'works(e.g.[2]and[3])and extend the interpolatingpolynomials from univariate to m-variate case(See[10])In this paper some results in thecase m=2 are discussed and proved in more concrete details.Based on these polynomials,theinterpolating splines(it is defined by me as piecewise polynomials in which the unknown par-tial derivatives are determined under certain continuous conditions)are also discussed.Theapproximation orders of interpolating polynomials and of cubic interpolating splines areinverstigated.We lunited our discussion on the rectangular domain which is partitioned intoequal right triangles.As to the case in which the rectangular domain is partitioned into unequalright triangles as well as the case of more complicated domains,we will discuss in the next pa-per.     

Factorizations of Finite Groups and Related Topics

This is a survey on the recent progress in the theory of finite groups with factorizations and around it,done by the author and his coauthors,and this has no pretensions to cover all topics in this wide area of research.In particular,we only touch the great consequences of the fundamental paper of Liebeck,Praeger and Saxl on maximal factorizations of almost simple finite groups for the theory of groups with factorizations.In each case the reader can find additional references at the end of Section 1.Some of the methods of investigation can be used to obtain information about finite groups in general,nilpotent algebras and related nearrings.     

Interpolation of Morrey-Campanato and related smoothness spaces

We study the interpolation of Morrey-Campanato spaces and some smoothness spaces based on Morrey spaces, e. g., Besov-type and Triebel-Lizorkin-type spaces. Various interpolation methods, including the complex method, the ±-method and the Peetre-Gagliardo method, are studied in such a framework. Special emphasis is given to the quasi-Banach case and to the interpolation property.     

一类六边形网格上拉普拉斯4点差分格式及其预条件子

本文提出平面上拉普拉斯算子在一类平行六边形网格上的成对4点差分格式.这种差分格式虽然只有一阶的局部截断误差,但实际具有二阶的收敛性.基于平行六边形网格可以被分解为两套三向三角形网格,我们给出成对4点格式的二阶收敛性的证明,并且提出相应的预条件子快速解法.文末给出的数值算例符合我们的结论.     

Semiparametric Bayesian Regression via Potts Model

We consider Bayesian nonparametric regression through random partition models. Our approach involves the construction of a covariate-dependent prior distribution on partitions of individuals. Our goal is to use covariate information to improve predictive inference. To do so, we propose a prior on partitions based on the Potts clustering model associated with the observed covariates. This drives by covariate proximity both the formation of clusters, and the prior predictive distribution. The resulting prior model is flexible enough to support many different types of likelihood models. We focus the discussion on nonparametric regression. Implementation details are discussed for the specific case of multivariate multiple linear regression. The proposed model performs well in terms of model fitting and prediction when compared to other alternative nonparametric regression approaches. We illustrate the methodology with an application to the health status of nations at the turn of the 21st century. Supplementary materials are available online.     

Convergence Properties of Generalized Fourier Series on a Parallel Hexagon Domain

A new Rogosinski-type kernel function is constructed using kernel function of partial sums Sn（f; t） of generalized Fourier series on a parallel hexagon domain Ω associating with threedirection partition. We prove that an operator Wn（f; t） with the new kernel function converges uniformly to any continuous function f（t） ∈ Cn（Ω） （the space of all continuous functions with period Ω） on Ω. Moreover, the convergence order of the operator is presented for the smooth approached function.     

张量积二次长方体有限元梯度最大模的超逼近

对于某种三维椭圆边值问题，本文给出了长方体剖分下张量积二次长方体有限元的第一型弱估计以及离散导数Green函数的W^1，1半范估计，利用这两个估计本文获得了张量积二次长方体有限元梯度最大模的超逼近．进而，由超逼近也可以得到这种有限元梯度最大模的超收敛．     

A partial theta identity of Ramanujan and its number-theoretic interpretation

We will interpret a partial theta identity in Ramanujan’s Lost Notebook as a weighted partition theorem involving partitions into distinct parts with smallest part odd. A special case of this yields a new result on the parity of the number of parts in such partitions, comparable to Euler’s pentagonal numbers theorem. We will provide simple and novel proofs of the weighted partition theorem and the special case. Our proof leads to a companion to Ramanujan’s partial theta identity which we will explain combinatorially.     

Preface

We will interpret a partial theta identity in Ramanujan’s Lost Notebook as a weighted partition theorem involving partitions into distinct parts with smallest part odd. A special case of this yields a new result on the parity of the number of parts in such partitions, comparable to Euler’s pentagonal numbers theorem. We will provide simple and novel proofs of the weighted partition theorem and the special case. Our proof leads to a companion to Ramanujan’s partial theta identity which we will explain combinatorially.     

Cardinal interpolation,submodules and the 4-direction mesh

This paper introduces the idea of cardinal interpolation on submodules of Z^d by translates of box splines if the condition of global linear independence fails to hold. In particular, the special case of the 4-direction box splines is discussed, where the pertinent submodule is given by the pairs (k, l) of integersk, l withk+l even. For this case, one obtains results that parallel the known results for the 3-direction box splines.     

Amalgamation of partitions from multiple segmentation bases: A comparison of non-model-based and model-based methods

The segmentation of customers on multiple bases is a pervasive problem in marketing research. For example, segmentation service providers partition customers using a variety of demographic and psychographic characteristics, as well as an array of consumption attributes such as brand loyalty, switching behavior, and product/service satisfaction. Unfortunately, the partitions obtained from multiple bases are often not in good agreement with one another, making effective segmentation a difficult managerial task. Therefore, the construction of segments using multiple independent bases often results in a need to establish a partition that represents an amalgamation or consensus of the individual partitions. In this paper, we compare three methods for finding a consensus partition. The first two methods are deterministic, do not use a statistical model in the development of the consensus partition, and are representative of methods used in commercial settings, whereas the third method is based on finite mixture modeling. In a large-scale simulation experiment the finite mixture model yielded better average recovery of holdout (validation) partitions than its non-model-based competitors. This result calls for important changes in the current practice of segmentation service providers that group customers for a variety of managerial goals related to the design and marketing of products and services.     

B-splines on 3-D tetrahedron partition in four-directional mesh

It is more difficult to construct 3-D splines than in 2-D case. Some results in the three directional meshes of bivariate case have been extended to 3-D case and corresponding tetrahedron partition has been constructed. The support of related B-splines and their recurrent formulas on integration and differentiation-difference are obtained. The results of this paper can be extended into higher dimension spaces, and can be also used in wavelet analysis, because of the relationship between spline and wavelets.