Comment on “A Hierarchy of Integrable Nonlinear Lattice Equations and New Integrable Symplectic Map“

Comment on a recent paper on Commun. Theor. Phys. (Beijing, China) 38 (2002) pp. 523-528.     

THE COUPLING OF NATURAL BOUNDARY ELEMENT AND FINITE ELEMENT METHOD FOR 2D HYPERBOLIC EQUATIONS

In this paper, we investigate the coupling of natural boundary element and finite element methods of exterior initial boundary value problems for hyperbolic equations. The governing equation is first discretized in time, leading to a time-step scheme, where an exterior elliptic problem has to be solved in each time step. Second, a circular artificial boundary FR consisting of a circle of radius R is introduced, the original problem in an unbounded domain is transformed into the nonlocal boundary value problem in abounded subdomain. And the natural integral equation and the Poisson integral formula are obtained in the infinite domainΩ2 outside circle of radius R. The coupled variational formulation is given. Only the function itself, not its normal derivative at artificial boundary ΓR, appears in the variational equation, so that the unknown numbers are reducedand the boundary element stiffness matrix has a few different elements. Such a coupled method is superior to the one based on direct boundary element method. This paper discusses finite element discretization for variational problem and its corresponding numerical technique, and the convergence for the numerical solutions. Finally, the numerical example is presented to illustrate feasibility and efficiency of this method.     

求解非线性规划问题的光滑路径跟踪方法

通过对非线性规划问题的K-T点的光滑路径跟踪方法研究，得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法，证明了光滑跟踪路径的存在性。     

Analysis of Two-Dimensional Optical Fields Using an Additional Shift

A solution to the phase problem in optics is considered within the context of registration and analysis of two-dimensional stationary optical fields transformed by the object under study or fields forming an image. To obtain information on amplitude and phase distributions of the light field analyzed, a method of registration of two intensity distributions is used. The first distribution corresponds directly to the amplitude distribution. The other is formed for the sum of the initial field and the field shifted along a certain direction. The intensity distributions obtained allow one to calculate the two-dimensional structure of the field under study. It is noteworthy that the method requires no iteration procedures in solving the problem. This leads to speeding up of the processing and analysis of the information. Two variants of optical schemes for the analysis of light fields are considered. The first one corresponds to registration of the image of the analyzed plane and the second to registration of the spectrum of the spatial frequencies.     

UPWIND FINITE VOLUME SCHEMES FOR SEMICONDUCTOR DEVICE

The mathematical model of semiconductor devices is described by the initial boundary value problem of a system of three nonlinear partial differential equations. One equation in elliptic form is for the electrostatic potential; two equations of convection-dominated diffusion type are for the electron and hole concentrations. Finite volume element procedure are put forward for the electrostatic potential, while upwind     

不等式组与变分不等式的极大熵函数方法

利用极大熵函数方法将不等式组及变分不等式的求解问题转化为近似可微优化问题，给出了不等式组及变分不等式问题近似解的可微优化方法，得到了不等式组和变分不等式问题的解集合的示性函数．     

基于增广Lagrange函数的RQP方法

Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported.     

Constructing Solutions of an Ill-Posed Nonlinear Singularly Perturbed Problem for an Equation of Elliptic Type

Mathematical Notes -     

Steepest Descent, CG, and Iterative Regularization of Ill-Posed Problems

The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date.     

A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces

In this paper, we introduce two iterative schemes by the general iterative method for finding a common element of the set of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. Then, we prove two strong convergence theorems for nonexpansive mappings to solve a unique solution of the variational inequality which is the optimality condition for the minimization problem. These results extended and improved the corresponding results of Marino and Xu [G. Marino, H.K. Xu, A general iterative method for nonexpansive mapping in Hilbert spaces, J. Math. Anal. Appl. 318 (2006) 43-52], S. Takahashi and W. Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (1) (2007) 506-515], and many others.