ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

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.     

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.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Uniform bounds under increment conditions

We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.

     

On an Application of Newton's Method to Nonlinear Operators with w-Conditioned Second Derivative

We present a new approach to study the convergence of Newton's method in Banach spaces, which relax the conditions appearing in the usual studies. The approach is based on the bound required for the second derivative of the operator involved. An application to a nonlinear integral equation is presented.     

THE QUALITATIVE CONTENT OF RENEWABLE RESOURCE MODELS

This paper analyzes the extent to which standard dynamic renewable resource models possess refutable implications. Both the steady state comparative static and local comparative dynamic properties of the standard model are studied. A unified framework is developed which enables one to analyze the qualitative properties of any standard renewable resource model. This is achieved by explicitly linking the local stability, steady state comparative static, and local comparative dynamic properties of the model.     

Kthe-Bochner空间的凸性(英文)

本文利用Kothe函数空间的性质以及Kothe函数空间与Kothe-Bochner空间的关系,讨论了Kothe-Bochner空间E(X)的凸性,主要结果如下: (a)给出E(X)的端点的充分条件,得到了E(X)严格凸的判据,相应地推广了Lp(μ,X) 以及Lφ(X)的结果; (b)讨论了E(X)的弱局部一致凸和局部完全k-凸; (c)刻画了E(X)的强凸,给出了F(X)强凸的充要条件．     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002