• Login
    View Item 
    •   Home
    • Theses & Dissertations
    • 2014 - Mines Theses & Dissertations
    • View Item
    •   Home
    • Theses & Dissertations
    • 2014 - Mines Theses & Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Mines RepositoryCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjects

    My Account

    Login

    Mines Links

    Arthur Lakes LibraryColorado School of Mines

    Statistics

    Display Statistics

    Cubic spline finite element method for solving Poisson's equation on a square

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Beck_mines_0052N_10391.pdf
    Size:
    369.3Kb
    Format:
    PDF
    Description:
    Cubic spline finite element ...
    Download
    Author
    Beck, Stephanie
    Advisor
    Bialecki, Bernard
    Date issued
    2014
    Date submitted
    2014
    Keywords
    matrix decomposition algorithm
    alternating direction implicit method
    finite element method
    cubic spline
    Poisson's equation
    Finite element method
    Poisson's equation
    Matrices
    Differential equations, Elliptic
    Algorithms
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/11124/12269
    Abstract
    We solve a simple 2-point boundary value problem with Dirichlet boundary conditions on [0,1] using a finite element method with cubic splines. We obtain explicit forms for the mass and stiffness matrices that arise from the method. We then solve Poisson's equation with zero Dirichlet boundary conditions in the unit square using a finite element method with basis functions that are tensor products of cubic splines. The resulting linear systems are solved in Matlab using Gauss elimination without pivoting, and then more efficiently using a Matrix Decomposition Algorithm. Cost of the matrix decomposition algorithm is O(N[superscript 3]), where N+1 is the number of subintervals in each coordinate direction. We improve the method still by using an Alternating Direction Implicit Method that reduces the cost of solving the resulting linear systems to O(N[superscript 2]ln[superscript 2]N).
    Rights
    Copyright of the original work is retained by the author.
    Collections
    2014 - Mines Theses & Dissertations

    entitlement

     
    DSpace software (copyright © 2002 - 2022)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.