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

    Browse

    All of TUScholarShareCommunitiesDateAuthorsTitlesSubjectsGenresThis CollectionDateAuthorsTitlesSubjectsGenres

    My Account

    LoginRegister

    Help

    AboutPeoplePoliciesHelp for DepositorsData DepositFAQs

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    STRUCTURE-OPTIMIZED AND ORDER-PRESERVING METHODS FOR ADVECTION AND TIME STEPPING

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Biswas_temple_0225E_14414.pdf
    Size:
    4.236Mb
    Format:
    PDF
    Download
    Genre
    Thesis/Dissertation
    Date
    2021
    Author
    Biswas, Abhijit
    Advisor
    Seibold, Benjamin
    Committee member
    Queisser, Gillian
    Klapper, Isaac
    Shirokoff, David
    Department
    Mathematics
    Subject
    Mathematics
    Permanent link to this record
    http://hdl.handle.net/20.500.12613/6517
    
    Metadata
    Show full item record
    DOI
    http://dx.doi.org/10.34944/dspace/6499
    Abstract
    This dissertation addresses some of the existing fundamental shortcomings in computational methods for differential equations by developing novel high-order accurate numerical schemes that can apply to multi-physics or multi-scale problems. Motivated by the need for numerical methods with long-time accurate solutions in complex advection-dominated problems, we first address whether there are numerical schemes for constant-coefficient advection problems that can yield convergent solutions for an infinite time horizon. After establishing a new notion of convergence in an infinite time limit of numerical methods, we first show that linear methods on a fixed-grid cannot meet this convergence criterion. Also, numerical studies demonstrate that some widely used traditional nonlinear methods fail to produce accurate long-time solutions. Then we present a new numerical methodology based on a nonlinear jet scheme framework. We show that these methods satisfy the new convergence criterion, establishing that such numerical methods exist that converge on an infinite time horizon and demonstrate the long-time accuracy gains incurred by this property. Secondly, we develop finite volume methods with optimal limiter functions based on the class of WENO type methods. Limiter functions are applied to finite volume methods to avoid oscillations near discontinuities and sharp transitions for hyperbolic equations. Many limiter functions have been introduced in the literature.The general approach is first to devise a limiter function and then demonstrate that it performs well on some test problems. Here, we solve the inverse problem instead: given a portfolio of representative test cases, and a cost functional, determine the optimal limiter function that is then designed to do well. Lastly, we address the question of whether diagonally implicit Runge-Kutta (DIRK) schemes with weak stage order (WSO) four or higher and order at least four exist. The concept of WSO, which manifests in algebraic conditions on the Runge-Kutta Butcher tableau, can relax the stage order conditions so that it becomes compatible with the DIRK structure. Thus, DIRK schemes with high WSO can rectify order reduction. DIRK schemes up to order four with WSO up to three have already been constructed, based on a simplified theory. In this part of the dissertation, we develop a general theory of WSO and a methodology that can yield stiffly accurate, A-stable DIRK schemes up to order five with WSO up to five.
    ADA compliance
    For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
    Collections
    Theses and Dissertations

    entitlement

     
    DSpace software (copyright © 2002 - 2022)  DuraSpace
    Temple University Libraries | 1900 N. 13th Street | Philadelphia, PA 19122
    (215) 204-8212 | scholarshare@temple.edu
    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.