Generalized quasilinearization method for reaction-diffusion equations under nonlinear and nonlocal flux conditions

In this paper we consider an initial boundary value problem for a reaction-diffusion equation under nonlinear and nonlocal Robin type boundary condition. Assuming the existence of an ordered pair of upper and lower solutions we establish a generalized quasilinearization method for the problem under consideration whose characteristic feature consists in the construction of monotone sequences converging to the unique solution within the interval of upper and lower solutions, and whose convergence rate is quadratic. Thus this method provides an efficient iteration technique that produces not only improved approximations due to the monotonicity of its iterates, but yields also a measure of the convergence rate.     

The Analysis and Improving of the Microwave Exciter in the Lower Hybrid Wave System

When we carry out lower hybrid wave heating and current driving plasma experiment at tokamak, we need mega-watt order of microwave power. The microwave signal at frequency of 2450 MHz is generated by a microwave exciter. According to the experiment＇s demands, the microwave exciter must provide output power of 1.5～ 2. 5 W with stabilized frequency and amplitude tobe used as the klystron input. Being amplified by the klystron, the microwave signal is transmitted through the transmitting system to the antenna and is emitted into the HL-2A tokamak. So we can see that the microwave exciter＇s function is very important to the lower hybrid wave heating and current driving plasma experiment.     

On fixed point and almost fixed point problems of lower semicontinuous type multivalued mappings

In the present paper, some new almost fixed point theorems and fixed point theorems for lower semicontinuous type multivalued mappings are obtained in metrizable H-spaces.     

四阶非线性边值问题解的存在性与上下解方法

该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈［0,1］,u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):［0,1］×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性.     

Orbitals that minimize the variance

A MCSCF-method for minimization of the variance yielding an optimal basisset of variance minimizing orbitals in analogy to Löwdin's natural orbitals for minimal energy is developed.     

Involutions for upper triangular matrix algebras

In this paper we describe completely the involutions of the first kind of the algebra UT_n(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UT_n(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT₂(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT₃(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UT_n(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.