IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-010-0698-9_6.html
   My bibliography  Save this book chapter

Fast computation of limit cycles in an industrial application

In: Practical Asymptotics

Author

Listed:
  • Shay Gueron

    (University of Haifa, Department of Mathematics)

  • Nadav Liron

    (Technion — I.I.T, Department of Mathematics)

Abstract

A model problem is described that requires the study of a system of the form $$ \dot v $$ = ɛF P (v(t), t) which depends on a set of parameters P, and where ɛ ≪ 1. The problem comes from an industrial application where it is a kernel of an optimization procedure. The optimization depends on computing the limit cycle, and the problem needs to be solved repeatedly. Short computation time is therefore essential. The naive approach is to integrate the equation forward in time, starting from an arbitrary initial condition, until the transients disappear and the limit cycle is approximated within a given tolerance. This approach is too slow and thus impractical in the context of the optimization procedure. The problem involves two types of asymptotic considerations: long-time asymptotic s and small-parameter asymptotics. Here a simple approach is demonstrated, based on implementing the averaging method. This reduces the solution time to the point that the optimization procedure becomes feasible.

Suggested Citation

  • Shay Gueron & Nadav Liron, 2001. "Fast computation of limit cycles in an industrial application," Springer Books, in: H. K. Kuiken (ed.), Practical Asymptotics, pages 79-86, Springer.
    • Handle: RePEc:spr:sprchp:978-94-010-0698-9_6
    DOI: 10.1007/978-94-010-0698-9_6
    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-94-010-0698-9_6. 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.