带分数阶Robin边界条件的时间-空间分数阶扩散方程的有限差分方法（英文）

In this paper, an efficient numerical method is proposed to solve the Caputo-Riesz fractional diffusion equation with fractional Robin boundary conditions. We approximate the Riesz space fractional derivatives using the fractional central difference scheme with second-order accurate. A priori estimation of the solution of the numerical scheme is given, and the stability and convergence of the numerical scheme are analyzed.Finally, a numerical example is used to verify the accuracy and efficiency...     

A COMPACT UPWIND SECOND ORDER SCHEME FOR THE EIKONAL EQUATION

We present a compact upwind second order scheme for computing the viscosity solution of the Eikonal equation. This new scheme is based on： 1. the numerical observation that classical first order monotone upwind schemes for the Eikonal equation yield numerical upwind gradient which is also first order accurate up to singularities; 2. a remark that partial information on the second derivatives of the solution is known and given in the structure of the Eikonal equation and can be used to reduce the size of the stencil. We implement the second order scheme as a correction to the well known sweeping method but it should be applicable to any first order monotone upwind scheme. Care is needed to choose the appropriate stencils to avoid instabilities.     

A Generalized Lyapunov-Sylvester Computational Method for Numerical Solutions of NLS Equation with Singular Potential

In the present paper a numerical method is developed to approximate the solution of two-dimensional Nonlinear Schrdinger equation in the presence of a singular potential. The method leads to generalized Lyapunov-Sylvester algebraic operators that are shown to be invertible using original topological and differential calculus issued methods. The numerical scheme is proved to be consistent, convergent and stable using the Lyapunov criterion, lax equivalence theorem and the properties of the generalized Lyapunov-Sylvester operators.     

Hamilton-Jacobi方程的单调有限元格式

A monotone finite element scheme is obtained by applying the finite element method to the viscosity equation of the Hamilton-Jacobi equation on unstructured meshes. Under some constraints, we show that this scheme is monotone and its numerical solution converges to the viscosity solution of the Hamilton-Jacobi equa-tion. Numerical examples test the stability and the convergence of this scheme.     

MIXED FINITE ELEMENT METHODS FOR FRACTIONAL NAVIER-STOKES EQUATIONS

This paper gives the detailed numerical analysis of mixed finite element method for fractional Navier-Stokes equations.The proposed method is based on the mixed finite element method in space and a finite difference scheme in time.The stability analyses of semi-discretization scheme and fully discrete scheme are discussed in detail.Furthermore,We give the convergence analysis for both semidiscrete and flly discrete schemes and then prove that the numerical solution converges the exact one with order O(h2+k),where h and k:respectively denote the space step size and the time step size.Finally,numerical examples are presented to demonstrate the effectiveness of our numerical methods.     

MIXED INTERIOR PENALTY DISCONTINUOUS GALERKIN METHODS FOR ONE-DIMENSIONAL FULLY NONLINEAR SECOND ORDER ELLIPTIC AND PARABOLIC EQUATIONS

This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations （PDEs）. In the paper we present a general framework for constructing high order interior penalty discontinuous Galerkin （IP-DG） methods for approximating viscosity solutions of these fully nonlinear PDEs. In order to capture discontinuities of the second order derivative uxx of the solution u, three independent functions p1,p2 and p3 are introduced to represent numerical derivatives using various one-sided limits. The proposed DG frame- work, which is based on a nonstandard mixed formulation of the underlying PDE, embeds a nonlinear problem into a mostly linear system of equations where the nonlinearity has been modified to include multiple values of the second order derivative uxz. The proposed framework extends a companion finite difference framework developed by the authors in [9] and allows for the approximation of fully nonlinear PDEs using high order polynomials and non-uniform meshes. In addition to the nonstandard mixed formulation setting, another main idea is to replace the fully nonlinear differential operator by a numerical operator which is consistent with the differential operator and satisfies certain monotonicity （called g-monotonicity） properties. To ensure such a g-monotonicity, the crux of the construction is to introduce the numerical moment, which plays a critical role in the proposed DG frame- work. The g-monotonicity gives the DG methods the ability to select the mathematically ＂correct＂ solution （i.e., the viscosity solution） among all possible solutions. Moreover, the g-monotonicity allows for the possible development of more efficient nonlinear solvers as the special nonlinearity of the algebraic systems can be explored to decouple the equations. This paper also presents and analyzes numerical results for several numerical test problems which are used to guage the accuracy and efficiency of the proposed DG methods.     

A numerical algorithm for determination of a control parameter in two-dimensional parabolic inverse problems

Numerical solution of the parabolic partial differential equations with an unknown parameter play a very important role in engineering applications. In this study we present a high order scheme for determining unknown control parameter and unknown solution of two-dimensional parabolic inverse problem with overspecialization at a point in the spatial domain. In this approach, a compact fourth-order scheme is used to discretize spatial derivatives of equation and reduces the problem to a system of ordinary differential equations(ODEs).Then we apply a fourth order boundary value method to the solution of resulting system of ODEs. So the proposed method has fourth order of accuracy in both space and time components and is unconditionally stable due to the favorable stability property of boundary value methods. The results of numerical experiments are presented and some comparisons are made with several well-known finite difference schemes in the literature.Also we will investigate the effect of noise in data on the approximate solutions.     

ALTERNATELY LINEARIZED IMPLICIT ITERATION METHODS FOR SOLVING QUADRATIC MATRIX EQUATIONS

A numerical solution of the quadratic matrix equations associated with a nonsingular M-matrix by using the alternately linearized implicit iteration method is considered. An iteration method for computing a nonsingular M-matrix solution of the quadratic matrix equations is developed, and its corresponding theory is given. Some numerical examples are provided to show the efficiency of the new method.     

AN EXPANDED CHARACTERISTIC-MIXED FINITE ELEMENT METHOD FOR A CONVECTION-DOMINATED TRANSPORT PROBLEM

In this paper, we propose an Expanded Characteristic-mixed Finite Element Method for approximating the solution to a convection dominated transport problem. The method is a combination of characteristic approximation to handle the convection part in time and an expanded mixed finite element spatial approximation to deal with the diffusion part. The scheme is stable since fluid is transported along the approximate characteristics on the discrete level. At the same time it expands the standard mixed finite element method in the sense that three variables are explicitly treated： the scalar unknown, its gradient, and its flux. Our analysis shows the method approximates the scalar unknown, its gradient, and its flux optimally and simultaneously. We also show this scheme has much smaller time-truncation errors than those of standard methods. A numerical example is presented to show that the scheme is of high performance.     

Finite Difference Method for Reaction-Diffusion Equation with Nonlocal Boundary Conditions

In this paper, we present a numerical approach to a class of nonlinear reaction-diffusion equations with nonlocal Robin type boundary conditions by finite difference methods. A second-order accurate difference scheme is derived by the method of reduction of order. Moreover, we prove that the scheme is uniquely solvable and convergent with the convergence rate of order two in a discrete L2-norm. A simple numerical example is given to illustrate the efficiency of the proposed method.     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Subspaces and quotients of Banach spaces with shrinking unconditional bases

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well as a quotient of a Banach space with a shrinking unconditional basis. A consequence of this is that a Banach space is isomorphic to a subspace of a space with a shrinking unconditional basis if and only if it is isomorphic to a quotient of a space with a shrinking unconditional basis, which solves a problem dating to the 1970s. The proof of the main result also yields that a uniformly convex space with the unconditional tree property is isomorphic to a subspace as well as a quotient of a uniformly convex space with an unconditional finite dimensional decomposition.     

Two questions on semi-clean group rings

It was proved in [4] that every group ring of a torsion abelian group over a commutative local ring is a semi-clean ring. It was asked in [4] whether every group ring of a torsion abelian group over a commutative clean ring is a semi-clean ring and whether every group ring of a torsion abelian group over a commutative semi-clean ring is a semi-clean ring. In this paper, we give a positive answer to question 1 and a negative answer to question 2.     

A generalized duality and applications

The aim of this paper is to present a nonconvex duality with a zero gap and its connection with convex duality. Since a convex program can be regarded as a particular case of convex maximization over a convex set, a nonconvex duality can be regarded as a generalization of convex duality. The generalized duality can be obtained on the basis of convex duality and minimax theorems. The duality with a zero gap can be extended to a more general nonconvex problems such as a quasiconvex maximization over a general nonconvex set or a general minimization over the complement of a convex set. Several applications are given.On leave from the Institute of Mathematics, Hanoi, Vietnam.     

图的分数k-因子

给定图G=(V,E).设a和b是两个非负整数.fE→［0,1］是一个函数.如果     

Toader型平均与几种经典平均的确界

给出了最佳参数α_1,α_2,α_3,β_1,β_2,β_3∈R,使得双向不等式α_1Q(a,b)+(1-α_1)G(a,b)0且a≠b成立.其中A(a,b)=(a+b)/2,H(a,b)=2ab/(a+b),G(a,b)=(ab)~(1/2),Q(a,b)=((a~2+b~2)/2)~(1/2),C(a,b)=(a~2+b~2)/(a+b),T(a,b)=2/π∫_0~(π/2)(a~2cos~2t+b~2sin~2)~(1/2)tdt分别是两个正数a和b的算术平均,调和平均,几何平均,二次平均,反调和平均和Toader平均.     

Inventory replenishment model: lot sizing versus just-in-time delivery

Motivated by a practical industrial problem where a manufacturer stipulates a minimum order from each buyer but where a local dealer promises the buyer a just-in-time delivery with a slightly higher unit cost, this paper uses a dynamic lot-sizing model with a stepwise cargo cost function and a minimum order amount constraint to help the buyer select the supplier with minimum total cost.     

A recognition algorithm for the intersection graphs of directed paths in directed trees

Consider a finite family of non-empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of directed paths in a directed tree is called a directed path graph. In this paper we present an efficient algorithm which constructs to a given graph a representation by a family of directed paths on a directed tree, if one exists. Also, we prove that a graph is a proper directed path graph if and only if it is a directed path graph.     

Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

A splitting theorem for groups acting on quasi-trees

It is well known that a group is free if and only if it acts freely without inversions on a tree. We prove a generalisation of this fact by defining a quasi-tree to be a graph with a bound on the size of its simple loops. It is shown that a finitely generated group acting freely on such a graph is isomorphic to a free product of free groups and finite groups.