IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-0348-0667-1_53.html
   My bibliography  Save this book chapter

Synchronization Problems for Spatially Invariant Infinite Dimensional Linear Systems

In: Operator Theory

Author

Listed:
  • Avraham Feintuch

    (Department of Mathematics, Ben-Gurion University of the Negev)

Abstract

This paper presents an overview of my work with Bruce Francis on asymptotic behavior of linear systems of countably many kinematic points with “nearest neighbor” dynamics. Both first and second order systems are considered. The novelty of the results considered here is that, unlike previous work in this area where the state space was a Hilbert sequence (or function) space, the state space is the Banach sequence space of bounded doubly infinite scalar sequences with the standard supremum norm. The basic problem lying at the heart of the theory for first order systems is the “serial pursuit and rendezvous problem.” Unlike the case of finitely many points where the asymptotic behavior of the system is straightforward, for infinitely many points the asymptotic behavior of the system connects with the classical study of Borel summability of sequences. The symmetric synchronizations problems are dependent on determining the subspace of initial configurations which give convergence in the serial pursuit problem. The finite dimensional version of the infinite second order system we study arises in physics in the theory of phonons, in the simplest case of one-dimensional lattice dynamics. We compare the asymptotic behavior of the finite system case to the infinite system one, both for undamped and damped systems. The results are quite unexpected. Despite the fact that the system is unbounded there are many cases where, asymptotically, synchronization takes place both in the damped and undamped case.

Suggested Citation

  • Avraham Feintuch, 2015. "Synchronization Problems for Spatially Invariant Infinite Dimensional Linear Systems," Springer Books, in: Daniel Alpay (ed.), Operator Theory, edition 127, chapter 32, pages 811-832, Springer.
  • Handle: RePEc:spr:sprchp:978-3-0348-0667-1_53
    DOI: 10.1007/978-3-0348-0667-1_53
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-0348-0667-1_53. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.