IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-18775-9_19.html
   My bibliography  Save this book chapter

Discontinuous Galerkin Methods for Timoshenko Beams

In: Numerical Mathematics and Advanced Applications

Author

Listed:
  • Fatila Celiker

    (University of Minnesota, School of Mathematics)

  • Bernardo Cockburn

    (University of Minnesota, School of Mathematics)

  • Sukru Güzey

    (University of Minnesota, Department of Civil Engineering)

  • Ramdev Kanapady

    (University of Minnesota, Department of Mechanical Engineering)

  • Sew-Chew Soon

    (University of Minnesota, Department of Civil Engineering)

  • Henrik K. Stolarski

    (University of Minnesota, Department of Civil Engineering)

  • Kummar Tamma

    (University of Minnesota, Department of Mechanical Engineering)

Abstract

Summary We devise a family of discontinuous Galerkin methods for the Timoshenko beam problem. Sufficient conditions for the existence and uniqueness of the approximation are given. The method allows arbitrary meshes and arbitrary polynomial degrees within the mesh, and hence is suitable for hp adaptivity. Numerical results showing optimal and exponential convergence are provided. These features of the method render it appealing for other problems in structure mechanics such as, plates, shells etc.

Suggested Citation

  • Fatila Celiker & Bernardo Cockburn & Sukru Güzey & Ramdev Kanapady & Sew-Chew Soon & Henrik K. Stolarski & Kummar Tamma, 2004. "Discontinuous Galerkin Methods for Timoshenko Beams," Springer Books, in: Miloslav Feistauer & Vít Dolejší & Petr Knobloch & Karel Najzar (ed.), Numerical Mathematics and Advanced Applications, pages 221-231, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-18775-9_19
    DOI: 10.1007/978-3-642-18775-9_19
    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

    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-642-18775-9_19. 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.