Algorithms for approximation of invariant measures for IFS

We prove convergence of two algorithms approximating invariant measures to iterated function systems numerically. We consider IFSs with finitely many continuous and injective non-overlapping maps on the unit interval. The first algorithm is a version of the Ulam algorithm for IFSs introduced by Strichartz et al. [16]. We obtain convergence in the supremum metric for distribution functions of the approximating eigen-measures to a unique invariant measure for the IFS. We have to make some modifications of the usual way of treating the Ulam algorithm due to a problem concerning approximate eigenvalues, which is part of our more general situation with weights not necessarily being related to the maps of the IFS. The second algorithm is a new recursive algorithm which is an analogue of forward step algorithms in the approximation theory of ODEs. It produces a sequence of approximating measures that converges to a unique invariant measure with geometric rate in the supremum metric. The main advantage of the recursive algorithm is that it runs much faster on a computer (using Maple) than the Ulam algorithm.Mathematics Subject Classification (2000): 37A30, 37C30, 37M25, 47A58Acknowledgement I would like to express my deep gratitude to Andreas Strömbergsson and to the anonymous referee. The referee had several very enlightening comments, which Andreas helped me to deal with. Section 4 is essentially due to Andreas and he also came up with the new Proposition 3 and helped me to improve Lemma 1. Thanks also to Svante Janson, Anders Johansson, Sten Kaijser, Robert Strichartz and Hans Wallin.     

Some Complexity Results for Zero Finding for Univariate Functions

This paper gives a survey of complexity results for zero finding. We focus on zero finding for univariate, at least continuous functions with a change of sign on some interval. One section, however, deals with zero finding for complex polynomials. We present asymptotic, worst case, and average case results.     

A framework for decision support systems for scheduling problems

Considering a decision support system as a tool where executive's judgment can be included along with the mathematical tool kit of the management scientist, this paper shows the need to include problem management as an integral component of the decision support system for scheduling problems. A methodology based on the resolution of conflicts among various constraints in scheduling problems is proposed to implement the problem management system in a decision support system for these problems. The paper concludes with some guidelines to create a workable framework for providing effective decision support to solve scheduling problems and the identification of some fruitful directions for future research.     

Convergence analysis for an iterative method for solving nonlinear parabolic systems

In a recent work, we have proposed a new iterative method based on the eigenfunction expansion to integrate nonlinear parabolic systems sequentially. In this paper, we prove that the method is convergent and give analytical rate for its convergence. Moreover, we determine the number of iterations needed to obtain a solution with a pre-determined level of accuracy. We then illustrate the convergence analysis with a problem in combustion theory. It is expected that the convergence analysis can be used for similar systems with time dependence.     

Symmetric excited states for a mean-field model for a nucleon

In this paper, we consider a stationary model for a nucleon interacting with the ω and σ mesons in the atomic nucleus. The model is relativistic, and we study it in a nuclear physics nonrelativistic limit. By a shooting method, we prove the existence of infinitely many solutions with a given angular momentum. These solutions are ordered by the number of nodes of each component.     

多产品公司创建平台邀请竞争对手进行联合销售的策略研究

由于资金分配或生产规模的限制,多产品公司的某类产品与专门销售此类产品的专业产品公司相比,会有一定的不足.以两个产品公司为对象,研究了两个竞争性公司的联合销售模式,即多产品公司投资建设平台,邀请销售单一产品的专业公司在平台上共同销售某类产品.运用主从博弈建立联合销售的基础模型,探讨不同销售模式下的相关投资,并利用数值计算进行决策分析.研究表明,通过创建平台进行联合销售,一方面,消除了消费者的额外购物成本;另一方面,在平台进行联合销售使得两个公司由单纯的竞争关系转化为相互补充,不仅能够吸引更多有不同产品需求的客户,而且能够在一定程度上提高两个产品公司的利润.     

A Sequent Calculus for Propositional Dynamic Logic for Agents

We consider propositional dynamic logic for agents. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.     

An Algorithm for Robust Inference for the Cox Model with Frailties

Abstract

This article proposes a robust method of statistical inference for the Cox's proportional hazards model with frailties. We use the Metropolis—Hastings algorithm and the bootstrap method. We present a computationally efficient algorithm with a customized data structure to implement this method and demonstrate this technique with real data.     

A constant-factor approximation algorithm for multi-vehicle collection for processing problem

We define the multiple-vehicle collection for processing problem (mCfPP) as a vehicle routing and scheduling problem in which items that accumulate at customer sites over time should be transferred by a series of tours to a processing facility. We show that this problem with the makespan objective (mCfPP( $C_{\max }$ )) is NP-hard using an approximation preserving reduction from a two-stage, hybrid flowshop scheduling problem. We develop a polynomial-time, constant-factor approximation algorithm to solve mCfPP( $C_{\max }$ ). The problem with a single site is analyzed as a special case with two purposes. First, we identify the minimum number of vehicles required to achieve a lower bound on the makespan, and second, we characterize the optimal makespan when a single vehicle is utilized.     

Computational experience with methods for estimating sparse hessians for nonlinear optimization

The paper compares a factorized sparse quasi-Newton update of Goldfarb with a nonfactorized BFGS sparse update of Shanno on a series of test problems, with numerical results strongly favoring the unfactorized update. Analysis of Goldfarb's method is done to explain the poor numerical performance. Two specific conjugate gradient methods for solving the required systems of linear equations with the unfactorized update are described and tested.This research was supported by the National Science Foundation under Grant No. MCS-77-07327     

A new stabilized finite element method for optimal control for a Ladyzhenskaya model for unsteady flows

This article considers the time‐dependent optimal control problem of tracking the velocity for the viscous incompressible flows which is governed by a Ladyzhenskaya equations with distributed control. The existence of the optimal solution is shown and the first‐order optimality condition is established. The semidiscrete‐in‐time approximation of the optimal control problem is also given. The spatial discretization of the optimal control problem is accomplished by using a new stabilized finite element method which does not need a stabilization parameter or calculation of high order derivatives. Finally a gradient algorithm for the fully discrete optimal control problem is effectively proposed and implemented with some numerical examples. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 263–287, 2012     

Converse Theorems for Final-stability

This paper deals with the converse theory for some aspects offinal-stability, for which a general qualitative theory wasfirst presented by the author in 1970. The theory of final-stabilityis concerned with the behaviour of the trajectories of a systemof differential equations with respect to two arbitrary setsand a finite interval of time.     

Graphical Diagnostics for Markov Models for Categorical Data

Markov models are widely used as a method for describing categorical data that exhibit stationary and nonstationary autocorrelation. However, diagnostic methods are a largely overlooked topic for Markov models. We introduce two types of residuals for this purpose: one for assessing the length of runs between state changes, and the other for assessing the frequency with which the process moves from any given state to the other states. Methods for calculating the sampling distribution of both types of residuals are presented, enabling objective interpretation through graphical summaries. The graphical summaries are formed using a modification of the probability integral transformation that is applicable for discrete data. Residuals from simulated datasets are presented to demonstrate when the model is, and is not, adequate for the data. The two types of residuals are used to highlight inadequacies of a model posed for real data on seabed fauna from the marine environment.

Supplemental materials, including an R-package RMC with functions to perform the diagnostic measures on the class of models considered in this article, are at the journal’s website. The R-package is also available at CRAN.     

Perfection for pomonoids

A pomonoid S is a monoid equipped with a partial order that is compatible with the binary operation. In the same way that M-acts over a monoid M correspond to the representation of M by transformations of sets, S-posets correspond to the representation of a pomonoid S by order preserving transformations of posets.     

A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions

We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 261–269, April–June, 2005.     

Matheuristics for solving a multi-attribute collection problem for a charity organisation

This paper studies a real-life multi-attribute profit collecting vehicle routing problem, arising in the collection operations of a charity organisation in the United Kingdom. The problem involves a heterogeneous fleet of vehicles of different capacities, mandatory visits to a subset of vertices, time windows, rest requirements associated with maximum driving and working times, and partial collection. A mixed integer programming formulation of the problem is described, along with three matheuristics based on Tabu Search and Large Neighbourhood Search. Computational results on instances derived from the case study are presented, and insights are given from a practical implementation.     

Conditions for Optimal Scheduling for the Three-machine Problem

This note proposes a simpler formulation for the conditionssuggested by Eltman & Townsend for the three-machine problem,which if satisfied must result in one job preceding anotherin an optimal sequence. These are compared with Johnson's conditions.     

Polytope Lyapunov Functions for Stable and for Stabilizable LSS

We present a new approach for constructing polytope Lyapunov functions for continuous-time linear switching systems (LSS). This allows us to decide the stability of LSS and to compute the Lyapunov exponent with a good precision in relatively high dimensions. The same technique is also extended for stabilizability of positive systems by evaluating a polytope concave Lyapunov function (“antinorm”) in the cone. The method is based on a suitable discretization of the underlying continuous system and provides both a lower and an upper bound for the Lyapunov exponent. The absolute error in the Lyapunov exponent computation is estimated from above and proved to be linear in the dwell time. The practical efficiency of the new method is demonstrated in several examples and in the list of numerical experiments with randomly generated matrices of dimensions up to 10 (for general linear systems) and up to 100 (for positive systems). The development of the method is based on several theoretical results proved in the paper: the existence of monotone invariant norms and antinorms for positively irreducible systems, the equivalence of all contractive norms for stable systems and the linear convergence theorem.     

Criteria for virtual fibering

We prove that an irreducible 3-manifold with fundamental groupthat satisfies a certain group-theoretic property called RFRSis virtually fibered. As a corollary, we show that 3-dimensionalreflection orbifolds and arithmetic hyperbolic orbifolds definedby a quadratic form virtually fiber. These include the SeifertWeber dodecahedral space and the Bianchi groups. Moreover, weshow that a taut-sutured compression body has a finite-sheetedcover with a depth one taut-oriented foliation. Received July 29, 2007.     

Hilbert spaces for estimating errors of quadratures for analytic functions

For estimating the error of a Gaussian quadrature by Davis' method, we investigate here the possibility of using a Hilbert space resulting from the weighted line integral inner product with the weight used in the quadrature formula itself.