多圆柱上Bloch型空间之间加权复合算子的本性范数

设φ(z)=(φ1(z),…,φ_n(z))是D~n到自身的一个全纯映射,ψ(z)是D~n上的全纯函数,其中D~n是C~n中的单位多圆柱.研究了单位多圆柱上Bloch型空阊之间的加权复合算子ψC_φ的本性范数,并给出了其上下界估计.     

一类新的求解P_*(κ)阵线性互补问题的多项式内点算法

利用核函数及其性质,对P_*(k)阵线性互补问题提出了一种新的宽邻域不可行内点算法.对核函数作了一些适当的改进,所以是不同于Peng等人介绍的自正则障碍函数.最后证明了算法具有近似O((1+2k)n3/4log(nμ~0)/ε)多项式复杂性,是优于传统的基于对数障碍函数求解宽邻域内点算法的复杂性.     

加权p-Laplace方程解的整体分叉问题

该文利用指标理论，谱理论以及标准分叉定理，研究了加权索伯列夫空间中的p Laplace方程初值问题的解的整体分叉现象。     

Dirichlet空间上的超循环复合算子

设Bn是复平面C中的单位圆盘(n=1)或复空间Cn中的单位球.众所周知,在Hardy空间上存在丰富的符号在Aut(Bn)中的超循环复合算子.然而,在复平面中单位圆盘上的Dirichlet空间中, 任何复合算子都不能是超循环的.本文则证明,当n>1时,Bn上的Dirichlet空间中确有超循环复合算子.     

Extending the applicability of Secant methods and nondiscrete induction

We use nondiscrete mathematical induction to extend the applicability of the Secant methods for solving equations in a Banach setting. Our approach has the following advantages over earlier works under the same information: weaker sufficient convergence conditions; tighter error bounds on the distances involved and more information on the location of the solution. Numerical examples where our results apply but earlier ones fail to solve nonlinear equation as well as tighter error bounds are also provided in this study.     

A new method for solving a system of generalized nonlinear variational inequalities in Banach spaces

The purpose of this paper is by using the generalized projection approach to introduce an iterative scheme for finding a solution to a system of generalized nonlinear variational inequality problem. Under suitable conditions, some existence and strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces. The results presented in the paper improve and extend some recent results.     

Uncomplemented subspaces of Lorentz spaces

In the paper we construct a system of bounded functions which generates an uncomplemented subspace in the Lorentz space Λ(α) for all α∈(0,1). Lower bounds of the norms of the projector onto such subspaces are obtained. Translated fromMatematicheskie Zametki, Vol. 68, No. 1, pp. 57–65, July, 2000.     

Emittance measurement & optimization for the photocathode RF gun with laser profile shaping

The Laser Undulator Compact X-ray source(LUCX) is a test bench for a compact high brightness X-ray generator,based on inverse Compton Scattering at KEK,which requires high intensity multi-bunch trains with low transverse emittance.A photocathode RF gun with emittance compensation solenoid is used as an electron source.Much endeavor has been made to increase the beam intensity in the multi-bunch trains.The cavity of the RF gun is tuned into an unbalanced field in order to reduce space charge effects,so that the field gradient on the cathode surface is relatively higher when the forward RF power into gun cavity is not high enough.A laser profile shaper is employed to convert the driving laser profile from Gaussian into uniform.In this research we seek to find the optimized operational conditions for the decrease of the transverse emittance.With the uniform driving laser and the unbalanced RF gun,the RMS transverse emittance of a 1 nC bunch has been improved effectively from 5.46 πmm.mrad to 3.66 πmm.mrad.     

Polypeptide folding on a conformational‐space network: Dependence of network topology on the structural discretization procedure

Mapping the conformational space of a polypeptide onto a network of conformational states involves a number of subjective choices, mostly in relation to the definition of conformation and its discrete nature in a network framework. Here, we evaluate the robustness of the topology of conformational‐space networks derived from Molecular Dynamics (MD) simulations with respect to the use of different discretization (clustering) methods, variation of their parameters, simulation length and analysis time‐step, and removing high‐frequency motions from the coordinate trajectories. In addition, we investigate the extent to which polypeptide dynamics can be reproduced on the resulting networks when assuming Markovian behavior. The analysis is based on eight 500 ns and eight 400 ns MD simulations in explicit water of two 10‐residue peptides. Three clustering algorithms were used, two of them based on the pair‐wise root‐mean‐square difference between structures and one on dihedral‐angle patterns. A short characteristic path length and a power‐law behavior of the probability distribution of the node degree are obtained irrespective of the clustering method or the value of any of the tested parameters. The average cliquishness is consistently one or two orders of magnitude larger than that of a random realization of a network of corresponding size and connectivity. The cliquishness as function of node degree and the kinetic properties of the networks are found to be most dependent on clustering method and/or parameters. Although Markovian simulations on the networks reproduce cluster populations accurately, their kinetic properties most often differ from those observed in the MD simulations. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010