16 research outputs found

    Stability and convergence in discrete convex monotone dynamical systems

    Full text link
    We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is weaker than Lyapunov stability. Among others we show that the set of tangentially stable fixed points is isomorphic to a convex inf-semilattice, and a criterion is given for the existence of a unique tangentially stable fixed point. We also show that periods of tangentially stable periodic points are orders of permutations on nn letters, where nn is the dimension of the underlying space, and a sufficient condition for global convergence to periodic orbits is presented.Comment: 36 pages, 1 fugur

    The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix

    Full text link
    In the coordination/consensus problem for multi-agent systems, a well-known condition of achieving consensus is the presence of a spanning arborescence in the communication digraph. The paper deals with the discrete consensus problem in the case where this condition is not satisfied. A characterization of the subspace TPT_P of initial opinions (where PP is the influence matrix) that \emph{ensure} consensus in the DeGroot model is given. We propose a method of coordination that consists of: (1) the transformation of the vector of initial opinions into a vector belonging to TPT_P by orthogonal projection and (2) subsequent iterations of the transformation P.P. The properties of this method are studied. It is shown that for any non-periodic stochastic matrix P,P, the resulting matrix of the orthogonal projection method can be treated as a regularized power limit of P.P.Comment: 19 pages, 2 figure

    Coordination in multiagent systems and Laplacian spectra of digraphs

    Full text link
    Constructing and studying distributed control systems requires the analysis of the Laplacian spectra and the forest structure of directed graphs. In this paper, we present some basic results of this analysis partially obtained by the present authors. We also discuss the application of these results to decentralized control and touch upon some problems of spectral graph theory.Comment: 15 pages, 2 figures, 40 references. To appear in Automation and Remote Control, Vol.70, No.3, 200

    Sortability of vector partitions

    No full text

    Chemical fibers international : CFI ; fiber polymers, fibers, texturing, and spunbonds

    Get PDF
    Abstract. We recently proposed an iterative procedure which asymptotically scales the rows and columns of a given matrix to one in a given norm. In this work, we briefly mention some of the properties of that algorithm and discuss its efficient parallelization. We report on a parallel performance study of our implementation on a few computing environments. Key words. sparse matrices; matrix scaling; equilibration; parallel computing AMS subject classifications. 05C50, 65F35, 65F50, 65Y0

    XPS and Auger study of the radial variations of diamond thin films grown by the oxy-acetylene flame method

    Get PDF
    Free standing diamond thin films grown by the oxy-acetylene flame method have been investigated by X-ray photoelectron spectroscopy (XPS) and Auger electron spectroscopy (AES), The radial distribution of the sp2-hybridized carbon species on the films and, consequently, the film quality, have been determined. While XPS does not seem to be an appropriate technique to distinguish between very small variations in firm quality, an analysis of the Auger widths can explain the differences observed by scanning electron microscopy (SEM) and optical microscopy in the different regions of the samples.Peer Reviewe
    corecore