模态框(Modal)标题

在这里添加一些文本

模态框(Modal)标题

在这里添加一些文本

Please choose a citation manager

Content to export

ISSN 0168-9673 CN 11-2041/O1
AMAS
  • Home
  • About
  • Editorial Board
  • Instruction
  • Subscription
  • Download
  • Contact

15 January 2001, Volume 17 Issue 1
    

  • Select all
    |
  • Original Articles
    The existence,uniqueness and stability of positive periodic solution for periodic reaction-diffusion system
    Ying Dong LIU, Zheng Yuan LI, Qi Xiao YE
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 1-13.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    The existence of periodic solutions for periodic reaction-diffusion systems with time delay by the periodic upper-lower solution method is investigated.Some methods for proving the uniqueness and the stability of the periodic solution are also given.Two examples are used to show how to use our methods.
  • 论文
    The existence,uniqueness and stability of positive periodic solution for periodic reaction-diffusion system
    Ying Dong LIU, Zheng Yuan LI, Qi Xiao YE
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 1-13.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    The existence of periodic solutions for periodic reaction-diffusion systems with time delay by the periodic upper-lower solution method is investigated.Some methods for proving the uniqueness and the stability of the periodic solution are also given.Two examples are used to show how to use our methods.
  • Original Articles
    Some inverse M-matrix problems
    Shu Huang XIANG, Zhao Yong YOU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 14-19.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    An upper bound and a lower bound for α_0 are given such that αI+B∈M~(-1) for α>α_0 and αI+BM~(-1) for α<α_0,where B is a nonnegative matrix and satisfies that for any positive constant β,βI+B is a power invariant zero pattern matrix.
  • 论文
    Some inverse M-matrix problems
    Shu Huang XIANG, Zhao Yong YOU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 14-19.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    An upper bound and a lower bound for α_0 are given such that αI+B∈M~(-1) for α>α_0 and αI+BM~(-1) for α<α_0,where B is a nonnegative matrix and satisfies that for any positive constant β,βI+B is a power invariant zero pattern matrix.
  • 论文
    A decomposition method for convex minimization problems and its application
    Yi Fan XU , Fang WU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 20-28.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure.We prove that these methods are globally and linearly convergent and discuss the application of the bundle variant in parallel computations
  • Original Articles
    A decomposition method for convex minimization problems and its application
    Yi Fan XU , Fang WU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 20-28.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure.We prove that these methods are globally and linearly convergent and discuss the application of the bundle variant in parallel computations
  • Original Articles
    The number of rooted nearly cubic C-nets
    Jun Liang CAI, Yan Pei LIU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 29-37.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    This paper provides the parametric expressions satisfied by the enumerating functions for rooted nearly cubic C-nets with the size and/or the root-vertex valency of the maps as the parameters via nonseparable neraly cubic maps.On this basis,two explicit expressions of the functions can be derived by employing Lagrangian inversion.
  • 论文
    The number of rooted nearly cubic C-nets
    Jun Liang CAI, Yan Pei LIU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 29-37.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    This paper provides the parametric expressions satisfied by the enumerating functions for rooted nearly cubic C-nets with the size and/or the root-vertex valency of the maps as the parameters via nonseparable neraly cubic maps.On this basis,two explicit expressions of the functions can be derived by employing Lagrangian inversion.
  • Original Articles
    Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
    Ji Ye HAN, Guang Hui LIU, De Feng SUN, Hong Xia YIN(4)
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 38-46.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    Two fundametal convergence theorems are given for nonlinear conjugate gradient methods only under the descent condition.As a result,methods related to the Fletcher-Reeves algorithm still converge for parameters in a slightly wider range,in particular,for a parameter in its upper bound.For methods related to the Polak-Ribiere algorithm,it is shown that some negative values of the conjugate parameter do not prevent convergence.If the objective function is convex,some convergence results hold for the Hestenes-Stiefel algorithm.
  • 论文
    Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
    Ji Ye HAN, Guang Hui LIU, De Feng SUN, Hong Xia YIN(4)
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 38-46.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    Two fundametal convergence theorems are given for nonlinear conjugate gradient methods only under the descent condition.As a result,methods related to the Fletcher-Reeves algorithm still converge for parameters in a slightly wider range,in particular,for a parameter in its upper bound.For methods related to the Polak-Ribiere algorithm,it is shown that some negative values of the conjugate parameter do not prevent convergence.If the objective function is convex,some convergence results hold for the Hestenes-Stiefel algorithm.
  • Original Articles
    Multiple solutions of nonhomogeneous Chouquard's equations
    Zheng Jie ZHANG
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 47-52.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,we consider the existence of solution for the following equations:-Δu+u=(|u|)~2*1/|x|)u+g(x),x∈R~3,where g(x)≥0,g(x)0,and g(x)∈H~(-1)(R~3).We prove that there exists a constant C,if ‖g(x)‖_(H~(-1))≤C,there are at least two solutions of the equation.
  • 论文
    Multiple solutions of nonhomogeneous Chouquard's equations
    Zheng Jie ZHANG
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 47-52.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,we consider the existence of solution for the following equations:-Δu+u=(|u|)~2*1/|x|)u+g(x),x∈R~3,where g(x)≥0,g(x)0,and g(x)∈H~(-1)(R~3).We prove that there exists a constant C,if ‖g(x)‖_(H~(-1))≤C,there are at least two solutions of the equation.
  • Original Articles
    Geometric structure in stochastic approximation
    Dai Zhan CHENG, Hong DU , Han Fu CHEN
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 53-59.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    Let J be the zero set of the gradient f_x of a function f:R~n→R.Under fairly general conditions the stochastic approximation algorithm ensures d(f(x_k),f(J))→0,as k→∞.First of all,the paper considers this problem:Under what conditions the convergence d(f(x_k),f(J))→〖DD(X〗k→∞〖DD)〗0 implies d(x_k,J)→〖DD(X〗k→∞〖DD)〗0.It is shown that such implication takes place if f_x is continuous and f(J) is nowhere dense.Secondly,an intensified version of Sard's theorem has been proved,which itself is interesting.As a particular case,it provides two independent sufficient conditions as answers to the previous question:If f is a C~1 function and either i)J is a compact set or ii) for any bounded set B,f~(-1)(B) is bounded,then f(J) is nowhere dense.Finally,some tools in algebraic geometry are used to prove that f(J) is a finite set if f is a polynomial.Hence f(J) is nowhere dense in the polynomial case.
  • 论文
    Geometric structure in stochastic approximation
    Dai Zhan CHENG, Hong DU , Han Fu CHEN
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 53-59.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    Let J be the zero set of the gradient f_x of a function f:R~n→R.Under fairly general conditions the stochastic approximation algorithm ensures d(f(x_k),f(J))→0,as k→∞.First of all,the paper considers this problem:Under what conditions the convergence d(f(x_k),f(J))→〖DD(X〗k→∞〖DD)〗0 implies d(x_k,J)→〖DD(X〗k→∞〖DD)〗0.It is shown that such implication takes place if f_x is continuous and f(J) is nowhere dense.Secondly,an intensified version of Sard's theorem has been proved,which itself is interesting.As a particular case,it provides two independent sufficient conditions as answers to the previous question:If f is a C~1 function and either i)J is a compact set or ii) for any bounded set B,f~(-1)(B) is bounded,then f(J) is nowhere dense.Finally,some tools in algebraic geometry are used to prove that f(J) is a finite set if f is a polynomial.Hence f(J) is nowhere dense in the polynomial case.
  • 论文
    An improvement on the concentration-compactness principle
    Xing QIU, Yi HONG, Yao Tian SHEN
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 60-67.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    该文首先通过证明消没情形是特殊的对分情形,改进了集中紧性引理.然后,应用该引理限制典型极小化问题,得到了一些新的结果.
  • Original Articles
    An improvement on the concentration-compactness principle
    Xing QIU, Yi HONG, Yao Tian SHEN
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 60-67.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    该文首先通过证明消没情形是特殊的对分情形,改进了集中紧性引理.然后,应用该引理限制典型极小化问题,得到了一些新的结果.
  • Original Articles
    Hopf bifurcation and analysis of equilibrium for a third-order differential equation in a model of competition
    Almocera L. S., Zhu Jun JING, Polly W. S.
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 68-80.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,a mathematical model of competition between plasmid-bearing and plasmidfree organisms in a chemostat with an inhibitor is investigated.The model is in the form of a system of nonlinear differential equations.By using qualitative methods,the conditions for the existence and local stability of the equilibria are obtained.The existence and stability of periodic solutions of the Hopf type are studied.Numerical simulations about the Hopf bifurcation value and Hopf limit cycle are also given.
  • 论文
    Hopf bifurcation and analysis of equilibrium for a third-order differential equation in a model of competition
    Almocera L. S., Zhu Jun JING, Polly W. S.
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 68-80.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,a mathematical model of competition between plasmid-bearing and plasmidfree organisms in a chemostat with an inhibitor is investigated.The model is in the form of a system of nonlinear differential equations.By using qualitative methods,the conditions for the existence and local stability of the equilibria are obtained.The existence and stability of periodic solutions of the Hopf type are studied.Numerical simulations about the Hopf bifurcation value and Hopf limit cycle are also given.
  • Original Articles
    Absolute stability of general Lurie type indirect control systems
    Zuo Xin GAN, Wei Gao GE, Su Xia ZHAO, Yong Xian WU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 81-85.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,by introducing a new concept of absolute stability for a certain argument,necessary and sufficient conditions for absolute stability of general Lurie indirect control systems are obtained,and some practical sufficient conditions are also given
  • 论文
    Absolute stability of general Lurie type indirect control systems
    Zuo Xin GAN, Wei Gao GE, Su Xia ZHAO, Yong Xian WU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 81-85.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,by introducing a new concept of absolute stability for a certain argument,necessary and sufficient conditions for absolute stability of general Lurie indirect control systems are obtained,and some practical sufficient conditions are also given
  • 论文
    Long time behavior of solutions of Davey-Stewartson equations
    Bo Ling GUO, Yong Sheng LI
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 86-97.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In the present paper we study the long time behavior of solutions to the Davey-Stewartson system possesses a compact global attractor A_p in L~p(Ω).Furthermore,one show that the attractor is in fact independent of p and prove the attractor has finite Hausdorff and fractal dimensions.
  • Original Articles
    Long time behavior of solutions of Davey-Stewartson equations
    Bo Ling GUO, Yong Sheng LI
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 86-97.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In the present paper we study the long time behavior of solutions to the Davey-Stewartson system possesses a compact global attractor A_p in L~p(Ω).Furthermore,one show that the attractor is in fact independent of p and prove the attractor has finite Hausdorff and fractal dimensions.
  • 论文
    Convergence rates in the law of logarithm of random elements
    Han Ying LIANG, Chun SU, Yue Bao WAANG
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 98-106.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    We discuss the convergence rates in the law of logarithm for partial sums and randomly indexed partial sums of independent random variables in Banach space,and find the necessary and sufficient conditions on the convergence rates.The results of [1-3] for sums of i.i.d. real valued r.v.'s are extended;Yang's result is generalized and the necessity part of Yang's result is also discussed;a conjecture for the i.i.d. real-valued r.v.'s of [5] is answered in Banach space.
  • Original Articles
    Convergence rates in the law of logarithm of random elements
    Han Ying LIANG, Chun SU, Yue Bao WAANG
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 98-106.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    We discuss the convergence rates in the law of logarithm for partial sums and randomly indexed partial sums of independent random variables in Banach space,and find the necessary and sufficient conditions on the convergence rates.The results of [1-3] for sums of i.i.d. real valued r.v.'s are extended;Yang's result is generalized and the necessity part of Yang's result is also discussed;a conjecture for the i.i.d. real-valued r.v.'s of [5] is answered in Banach space.
  • 论文
    Semi-on-line scheduling problems for maximizing the minimum machine completion time
    Yong HE
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 107-113.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time.For each problem,we propose a best possible algorithm.
  • Original Articles
    Semi-on-line scheduling problems for maximizing the minimum machine completion time
    Yong HE
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 107-113.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time.For each problem,we propose a best possible algorithm.
  • 论文
    Operator and matrix representation for the generalized inverse A~((2))_(T,S)
    Yong Lin CHEN
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 114-120.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    This paper presents the matrix representation for extension of inverse of restriction of a linear operator to a subspace,on the basis of which we establish useful representations in operator and matrix form for the generalized inverse A~((2))_(T,S) and give some of their applications.
  • Original Articles
    Operator and matrix representation for the generalized inverse A~((2))_(T,S)
    Yong Lin CHEN
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 114-120.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    This paper presents the matrix representation for extension of inverse of restriction of a linear operator to a subspace,on the basis of which we establish useful representations in operator and matrix form for the generalized inverse A~((2))_(T,S) and give some of their applications.
  • Original Articles
    How good is a dense shop schedule?
    Bo CHEN, Wen Ci YU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 121-128.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,we study a class of simple and easy-to-construct shop schedules,known as dense schedules.We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones.For dense open-shop schedules,we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.
  • 论文
    How good is a dense shop schedule?
    Bo CHEN, Wen Ci YU
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 121-128.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    In this paper,we study a class of simple and easy-to-construct shop schedules,known as dense schedules.We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones.For dense open-shop schedules,we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.
  • 论文
    On the elusiveness of Hamiltonian property
    Sui Xiang GAO
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 129-138.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    Decision tree complexity is an important measure of computational complexity.A graph property is a set of graphs such that if some graph G is in the set then each isomorphic graph to G is also in the set.Let P be a graph property on n vertices,if every decision tree algorithm recognizing P must examine at least k pairs of vertices in the worst case,then it is said that the decision tree complexity of P is k.If every decision tree algorithm recognizing P must examine all n(n-1)/2 pairs of vertices in the worst case,then P is said to be elusive.Karp conjectured that every nontrivial monotone graph property is elusive.This paper concerns the elusiveness of Hamiltonian property.It is proved that if n=p+1,pq or pq+1,(where p,q are distinct primes),then Hamiltonian property on n vertices is elusive.
  • Original Articles
    On the elusiveness of Hamiltonian property
    Sui Xiang GAO
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 129-138.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    Decision tree complexity is an important measure of computational complexity.A graph property is a set of graphs such that if some graph G is in the set then each isomorphic graph to G is also in the set.Let P be a graph property on n vertices,if every decision tree algorithm recognizing P must examine at least k pairs of vertices in the worst case,then it is said that the decision tree complexity of P is k.If every decision tree algorithm recognizing P must examine all n(n-1)/2 pairs of vertices in the worst case,then P is said to be elusive.Karp conjectured that every nontrivial monotone graph property is elusive.This paper concerns the elusiveness of Hamiltonian property.It is proved that if n=p+1,pq or pq+1,(where p,q are distinct primes),then Hamiltonian property on n vertices is elusive.
  • 论文
    (The weak concentration of the SK-model)
    Chuan Zhong CHEN, Kai Nan XIANG
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 140-144.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    When a natural number N is large enough,a weak concentration property of the N-spin SK-models is obtained for cylindrical sets.
  • Original Articles
    (The weak concentration of the SK-model)
    Chuan Zhong CHEN, Kai Nan XIANG
    Acta Mathematicae Applicatae Sinica(English Series). 2001, 17(1): 140-144.
    Abstract ( )    Download PDF ( )   Knowledge map   Save
    When a natural number N is large enough,a weak concentration property of the N-spin SK-models is obtained for cylindrical sets.
Journal Online
  • Highlights
  • Current Issue
  • Collections
  • Volumn List
  • Archive
  • Most Accessed
  • Most Download
  • Most Cited
  • E-mail Alert
News More
Quarterly,Started in 1984
ISSN 0168-9673 
CN 11-2041/O1
Add: No.55 East Road Zhongguancun, Beijing 100190,P.R. China
Tel: 010-82541435
E-mail: amas@amt.ac.cn
×

Share

京公网安备11010802040193号      京ICP备05002806号-9  Copyright © Acta Mathematicae Applicatae Sinica(English Series), All Rights Reserved.