Computation of limit periodic continued fractions. A survey

Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.     

固体力学有限元体系的结构拓扑变化理论

本文是文[1]的继续.文[1]提出了杆件系统的结构拓扑变化理论和拓扑变化法本文将这一理论和方法推进到连续体有限元体系;且在此基础上揭示出有限元体系的一个新性质,称为基本位移之梯度的正交性定理,从而给出一套设计敏度的显式表达式,可直接用于计算.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Replica Symmetry Breaking in an Axial Model of Quadrupolar Glass

We investigate the replica symmetry breaking (RSB) in a neighborhood of the instability point of the replica-symmetric solution in the axial quadrupolar glass model. We show that the solution with the first-stage RSB is stable against the subsequent RSB. Although there is no reflection symmetry, the first-stage RSB solution continuously bifurcates from the replica-symmetric one. This implies that our model does not belong to either of the two classes into which spin glasses are usually divided.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.     

P schl-Teller势阱中线性与非线性光学折射率变化

利用量子力学中的密度矩阵算符理论导出了P schl-Teller势阱中的线性与三阶非线性光学折射率的解析表达式。P schl-Teller势阱中有两个可调参数κ和λ,势阱的形状及其非对称性会随势阱参数的取值不同而明显不同,从而其线性与非线性光学折射率变化的大小也会随势阱参数和入射光强的变化而呈规律性的变化。文章以典型的GaAs/AlGaAs势阱为例作了数值计算,数值计算结果表明,势阱的形状和入射光强对光学折射率有着重要的影响。     

Focusing and diffraction by an optical lens and a small circular aperture

Based on the vectorial Rayleigh–Sommerfeld diffraction integrals, analytical expressions for the transversal and axial field distribution of plane waves propagating through a thin lens followed by a small circular aperture are derived and used to study the focusing and diffraction properties of plane waves. Some special cases of our general result are discussed, and illustrative numerical calculation results are given. It is found that the vectorial nonparaxial approach should be applied if the aperture dimension is comparable with the wavelength or the focusing is strong.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.