Scribd Logo
Upload

Welcome to Scribd!

  • Discretisation & Basisc

    Uploaded by

    vivek garad
    7 views2 pages
    The document discusses discretization for numerical solutions in finite element analysis. It explains that finite element problems, like finite difference methods, require knowing functional values at discrete points. The key idea of finite element analysis is to approximate all functions as a sum of basis functions multiplied by coefficients, where the coefficients are equivalent to the actual function values at node points. This allows representing unknown fields as a linear combination of basis functions, in a similar way as representing functions in terms of their values at discrete points.

    Original Description:

    discretisation & Basics of FEM

    Original Title

    discretisation & Basisc

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses discretization for numerical solutions in finite element analysis. It explains that finite element problems, like finite difference methods, require knowing functional values at discrete points. The key idea of finite element analysis is to approximate all functions as a sum of basis functions multiplied by coefficients, where the coefficients are equivalent to the actual function values at node points. This allows representing unknown fields as a linear combination of basis functions, in a similar way as representing functions in terms of their values at discrete points.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    Discretisation & Basisc

    Uploaded by

    vivek garad
    The document discusses discretization for numerical solutions in finite element analysis. It explains that finite element problems, like finite difference methods, require knowing functional values at discrete points. The key idea of finite element analysis is to approximate all functions as a sum of basis functions multiplied by coefficients, where the coefficients are equivalent to the actual function values at node points. This allows representing unknown fields as a linear combination of basis functions, in a similar way as representing functions in terms of their values at discrete points.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Discretization

    As we are aiming to find a numerical solution to our problem it is


    clear we have to discretize the problem somehow. In FE problems
    similar to FD the functional values are known at a discrete set
    of points.
    ... regular grid ...

    ... irregular grid ...

    Domain D

    The key idea in FE analysis is to approximate all functions in


    terms of basis functions j, so that

    u u~ cij i
    N

    Finite element method

    i 1

    Basis function
    u u~

    cj
    N

    i 1

    where N is the number nodes in our physical domain and ci are real
    constants.

    With an appropriate choice of basis functions ji, the coefficients ci


    are equivalent to the actual function values at node point i. This of
    course means, that ji=1 at node i and 0 at all other nodes ...
    Doesnt that ring a bell?
    Before we look at the basis functions, let us ...
    Finite element method

    You might also like