A posteriori error analysis of a quadratic finite volume method for nonlinear elliptic problems

In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results.     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

Surfaces of Constant Mean Curvature Bounded by Two Planar Curves

In this paper we study constant mean curvature compact surfaces with two Jordan curves in parallel planes as boundary and we investigate the point at which the surface inherits the symmetries of its boundary.     

有势场逆问题的边界元法

本文给出了位势方程逆问题的一种最小二乘边界元解法。控制方程为Ｌａｐｌａｃｅ方程，但一部分边界上未给出任何边值，而只在某些内点上给出了势函值。这一问题在数学上属不适定问题，但在一定条件下存在唯一解。本文同时给出了一种估计解的可靠性的方法。数值试验表明，这类逆问题采用边界元法是非常有效的。     

A likelihood-based method for haplotype association studies of case-control data with genotyping uncertainty

This paper discusses the associations between traits and haplotypes based on Fl (fluorescent intensity) data sets. We consider a clustering algorithm based on mixtures of t distributions to obtain all possible genotypes of each individual (i.e. "GenoSpec-trum"). We then propose a likelihood-based approach that incorporates the genotyping uncertainty to assessing the associations between traits and haplotypes through a haplotype-based logistic regression model. Simulation studies show that our likelihood-based method can reduce the impact induced by genotyping errors.     

Mean Field Behaviour of Spin Systems with Orthogonal Interaction Matrix

For the long-range deterministic spin models with glassy behaviour of Marinari, Parisi and Ritort we prove weighted factorization properties of the correlation functions which represent the natural generalization of the factorization rules valid for the Curie–Weiss case.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

关于AOR迭代法的研究

本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω（0≤γ≤ω0）的最小值是h1,1.     

混沌实验数据处理及仿真

大学物理实验中混沌实验大多采用观察现象的方法进行,本实验采用蔡氏电路(Chua s circuit)产生混沌行为.在观察不同初始值条件下出现的倍周期分岔、阵发混沌、奇异吸引子等相图及现象的基础上,通过对采集数据进行处理,对负电阻伏安特性进行分段线性拟合,用功率频谱法、计算机仿真方法(龙格-库塔数值积分法)对混沌现象进行描绘,将实验数据与非线性方程组的数值解相结合,呈现出混沌现象的本质.