一些组合地图新算法的实现

本文主要讨论组合地图列举问题.刘的一部专著中提出了一个判定两个地图是否同构的算法.该算法的时间复杂度为O(m2),其中m为下图的规模.在此基础上,本文给出一个用于地图列举以及进而计算任意连通下图的地图亏格分布的通用算法.本文所得结果比之前文献中所给结果更优.     

Propagation of traveling wave solutions for nonlinear evolution equation through the implementation of the extended modi ed direct algebraic method

In this work,di erent kinds of traveling wave solutions and uncategorized soliton wave solutions are obtained in a three dimensional(3-D)nonlinear evolution equations(NEEs)through the implementation of the modi ed extended direct algebraic method.Bright-singular and dark-singular combo solitons,Jacobi's elliptic functions,Weierstrass elliptic functions,constant wave solutions and so on are attained beside their existing conditions.Physical interpretation of the solutions to the 3-D modi ed KdV-Zakharov-Kuznetsov equation are also given.     

Sign-based Test for Mean Vector in High-dimensional and Sparse Settings

In this article, we introduce a robust sparse test statistic which is based on the maximum type statistic. Both the limiting null distribution of the test statistic and the power of the test are analysed. It is shown that the test is particularly powerful against sparse alternatives. Numerical studies are carried out to examine the numerical performance of the test and to compare it with other tests available in the literature. The numerical results show that the test proposed significantly outperforms those tests in a range of settings, especially for sparse alternatives.     

Multiple Positive Solutions for One Dimensional Third Order p-Laplacian Equations with Integral Boundary Conditions

In this paper,we consider the one dimensional third order p-Laplacian equation■u^′′(0)=0.By using kernel functions and the Avery-Peterson fixed point theorem,we establish the existence of at least three positive solutions.     

中国数学会举行第十次全国代表大会

中国数学会第十次全国代表大会暨2007学术年会11月2日在北京航空航天大学开幕,这是中国数学会历史上规模最大的一次全国代表大会.教育部副部长吴启迪、中国科协书记处书记冯长根、北京航空航天大学校长李未及中科院、科技部等单位的相关领导、嘉宾出席开幕式.     

Bayesian Approach for Recovering Piecewise Constant Viscoelasticity from MRE Data

This paper deals with an inverse problem for recovering the piecewise constant viscoelasticity of a living body from MRE(Magnetic Resonance Elastography)data.Based on a scalar partial differential equation whose solution can approximately simulate MRE data,our inverse coefficient problem is considered as a statistical inverse problem of reconstructing the posterior distribution of unknown viscoelastic modulus.For sampling this distribution,one usually can use the Metropolis-Hastings Markov chain Monte Carlo(MHMCMC)algorithm.However,without an appropriate"proposal"distribution given artificially,the MH-MCMC algorithm is hard to draw samples efficiently.To avoid this,a so-called slice sampling algorithm is introduced in this paper and applied for solving our problem.The performance of these statistical inversion algorithms is numerically tested basing on simulated data.     

Solitary Wave Solutions of Delayed Coupled Higgs Field Equation

This paper is devoted to the study of the solitary wave solutions for the delayed coupled Higgs field equation{vtt-uxx-αu+βf*u|u|²-2uv-τu(|u|²)x=0 vtt+vxx-β(|u|^x)xx=0.We first establish the existence of solitary wave solutions for the corresponding equation without delay and perturbation by using the Hamiltonian system method.Then we consider the persistence of solitary wave solutions of the delayed coupled Higgs field equation by using the method of dynamical system,especially the geometric singular perturbation theory,invariant manifold theory and Fredholm theory.According to the relationship between solitary wave and homoclinic orbit,the coupled Higgs field equation is transformed into the ordinary differential equations with fast variables by using the variable substitution.It is proved that the equations with perturbation also possess homoclinic orbit,and thus we obtain the existence of solitary wave solutions of the delayed coupled Higgs field equation.     

RIEMANN-HILBERT PROBLEMS AND SOLITON SOLUTIONS OF NONLOCAL REVERSE-TIME NLS HIERARCHIES

The paper aims at establishing Riemann-Hilbert problems and presenting soliton solutions for nonlocal reverse-time nonlinear Schrodinger(NLS) hierarchies associated with higher-order matrix spectral problems.The Sokhotski-Plemelj formula is used to transform the Riemann-Hilbert problems into Gelfand-Levitan-Marchenko type integral equations.A new formulation of solutions to special Riemann-Hilbert problems with the identity jump matrix,corresponding to the reflectionless inverse scattering transforms,is proposed and applied to construction of soliton solutions to each system in the considered nonlocal reversetime NLS hierarchies.     

RIEMANN-HILBERT PROBLEMS AND SOLITON SOLUTIONS OF NONLOCAL REVERSE-TIME NLS HIERARCHIES

The paper aims at establishing Riemann-Hilbert problems and presenting soliton solutions for nonlocal reverse-time nonlinear Schrodinger(NLS) hierarchies associated with higher-order matrix spectral problems.The Sokhotski-Plemelj formula is used to transform the Riemann-Hilbert problems into Gelfand-Levitan-Marchenko type integral equations.A new formulation of solutions to special Riemann-Hilbert problems with the identity jump matrix,corresponding to the reflectionless inverse scattering transforms,is proposed and applied to construction of soliton solutions to each system in the considered nonlocal reversetime NLS hierarchies.     

针对一维空间分数阶扩散方程的一个新的最大模近似公式

Based on the maximum principle,the difference formula defined on a non-integral node is given to approximate the fractional Riemann-Liouville derivative and the finite difference scheme for solving one-dimensional space fractional diffusion equations(FDEs) with variable coefficients is presented.Furthermore,using the maximum principle the scheme is proved unconditionally stable and secondorder accuracy in spatial grid size.Several numerical examples are given to verify the efficiency of the scheme.     

非线性特征值问题的二次近似方法

本文研究求解非线性特征值问题的数值方法.基于矩阵值函数的二次近似,将非线性特征值问题转化为二次特征值问题,提出了求解非线性特征值问题的逐次二次近似方法,分析了该方法的收敛性.结合求解二次特征值问题的Arnoldi方法和Jacobi-Davidson方法,给出求解非线性特征值问题的一些二次近似方法.数值结果表明本文所给算法是有效的.     

Convergence and optimal complexity of adaptive finite element eigenvalue computations

In this paper, an adaptive finite element method for elliptic eigenvalue problems is studied. Both uniform convergence and optimal complexity of the adaptive finite element eigenvalue approximation are proved. The analysis is based on a certain relationship between the finite element eigenvalue approximation and the associated finite element boundary value approximation which is also established in the paper. This work was partially supported by the National Science Foundation of China under grant 10425105 and the National Basic Research Program under grant 2005CB321704.     

A Two-Level Method for Nonsymmetric Eigenvalue Problems

A two-level discretization method for eigenvalue problems is studied. Compared to the standard Galerkin finite element discretization technique performed on a fine grid this method discretizes the eigenvalue problem on a coarse grid and obtains an improved eigenvector (eigenvalue) approximation by solving only a linear problem on the fine grid (or two linear problems for the case of eigenvalue approximation of nonsymmetric problems). The improved solution has the asymptotic accuracy of the Galerkin discretization solution. The link between the method and the iterated Galerkin method is established. Error estimates for the general nonsymmetric case are derived.     

The constrained inverse eigenvalue problem and its approximation for normal matrices

In this paper, the constrained inverse eigenvalue problem and associated approximation problem for normal matrices are considered. The solvability conditions and general solutions of the constrained inverse eigenvalue problem are presented, and the expression of the solution for the optimal approximation problem is obtained.     

Calculating the minimal/maximal eigenvalue of symmetric parameterized matrices using projection

In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters ω and we are interested in the minimal eigenvalue of a matrix pencil ( A , B ) with A , B symmetric and B positive definite. If ω can be interpreted as the realization of random variables, one may be interested in statistical moments of the minimal eigenvalue. In order to obtain statistical moments, we need a fast evaluation of the eigenvalue as a function of ω . Because this is costly for large matrices, we are looking for a small parameterized eigenvalue problem whose minimal eigenvalue makes a small error with the minimal eigenvalue of the large eigenvalue problem. The advantage, in comparison with a global polynomial approximation (on which, e.g., the polynomial chaos approximation relies), is that we do not suffer from the possible nonsmoothness of the minimal eigenvalue. The small‐scale eigenvalue problem is obtained by projection of the large‐scale problem. Our main contribution is that, for constructing the subspace, we use multiple eigenvectors and derivatives of eigenvectors. We provide theoretical results and document numerical experiments regarding the beneficial effect of adding multiple eigenvectors and derivatives.     

Convergence of the modified discrete ordinates method for the anisotropic scattering transport equation

Criticality problem of nuclear tractors generally refers to an eigenvalue problem for the transport equations. In this paper, we deal with the eigenvalue of the anisotropic scattering transport equation in slab geometry. We propose a new discrete method which was called modified discrete ordinates method. It is constructed by redeveloping and improving discrete ordinates method in the space of L¹(X). Different from traditional methods, norm convergence of operator approximation is proved theoretically. Furthermore, convergence of eigenvalue approximation and the corresponding error estimation are obtained by analytical tools.     

反中心对称矩阵的广义特征值反问题

Given matrix X and diagonal matrix A , the anti-centrosymmetric solutions (A, B) and its optimal approximation of inverse generalized eigenvalue problem AX = BXA have been considered. The general form of such solutions is given and the expression of the optimal approximation solution to a given matrix is derived. The algorithm and one numerical example for solving optimal approximation solution are included.     

Eigenvalue approximation of the biharmonic eigenvalue problem by Ciarlet‐Raviart scheme

Using the technique of eigenvalue error expansion and the technique of integral identities, we derive higher order convergence rate of the eigenvalue approximation for the biharmonic eigenvalue problem based on the Ciarlet‐Raviart discretization. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Superconvergence and a posteriori error estimates for the Stokes eigenvalue problems

In this paper we consider the finite element approximation of the Stokes eigenvalue problems based on projection method, and derive some superconvergence results and the related recovery type a posteriori error estimators. The projection method is a postprocessing procedure that constructs a new approximation by using the least squares strategy. The results are based on some regularity assumptions for the Stokes equations, and are applicable to the finite element approximations of the Stokes eigenvalue problems with general quasi-regular partitions. Numerical results are presented to verify the superconvergence results and the efficiency of the recovery type a posteriori error estimators.     

First eigenvalue of birth-death processes with killing

In this paper, we present an explicit and computable lower bound for the first eigenvalue of birth-death processes with killing. This estimate is qualitatively sharp for birth-death processes without killing. We also establish an approximation procedure for the first eigenvalue of the birth-death process with killing by an increasing principal eigenvalue sequence of some birth-death processes without killing. Some applications of our results are illustrated by many examples.