IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i12p1333-d571749.html
   My bibliography  Save this article

k -Version of Finite Element Method for BVPs and IVPs

Author

Listed:
  • Karan S. Surana

    (Mechanical Engineering, University of Kansas, Lawrence, KS 66045, USA)

  • Celso H. Carranza

    (Mechanical Engineering, University of Kansas, Lawrence, KS 66045, USA)

  • Sri Sai Charan Mathi

    (Mechanical Engineering, University of Kansas, Lawrence, KS 66045, USA)

Abstract

The paper presents k -version of the finite element method for boundary value problems (BVPs) and initial value problems (IVPs) in which global differentiability of approximations is always the result of the union of local approximations. The higher order global differentiability approximations (HGDA/DG) are always p -version hierarchical that permit use of any desired p -level without effecting global differentiability. HGDA/DG are true C i , C i j , C i j k , hence the dofs at the nonhierarchical nodes of the elements are transformable between natural and physical coordinate spaces using calculus. This is not the case with tensor product higher order continuity elements discussed in this paper, thus confirming that the tensor product approximations are not true C i , C i j k , C i j k approximations. It is shown that isogeometric analysis for a domain with more than one patch can only yield solutions of class C 0 . This method has no concept of finite elements and local approximations, just patches. It is shown that compariso of this method with k -version of the finite element method is meaningless. Model problem studies in R 2 establish accuracy and superior convergence characteristics of true C i j p -version hierarchical local approximations presented in this paper over tensor product approximations. Convergence characteristics of p -convergence, k -convergence and p k -convergence are illustrated for self adjoint, non-self adjoint and non-linear differential operators in BVPs. It is demonstrated that h , p and k are three independent parameters in all finite element computations. Tensor product local approximations and other published works on k -version and their limitations are discussed in the paper and are compared with present work.

Suggested Citation

  • Karan S. Surana & Celso H. Carranza & Sri Sai Charan Mathi, 2021. "k -Version of Finite Element Method for BVPs and IVPs," Mathematics, MDPI, vol. 9(12), pages 1-43, June.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1333-:d:571749
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/12/1333/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/12/1333/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:9:y:2021:i:12:p:1333-:d:571749. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.