• Login
    View Item 
    •   Home
    • Theses & Dissertations
    • 2018 - Mines Theses & Dissertations
    • View Item
    •   Home
    • Theses & Dissertations
    • 2018 - 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

    Kernel-based Lagrangian method for imperfectly-mixed chemical reactions, A

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Schmidt_mines_0052N_11535.pdf
    Size:
    1.035Mb
    Format:
    PDF
    Download
    Author
    Schmidt, Michael J.
    Advisor
    Pankavich, Stephen
    Benson, David A.
    Date issued
    2018
    Keywords
    imperfect mixing
    diffusion-reaction equation
    particle methods
    
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/11124/172365
    Abstract
    Current Lagrangian (particle-tracking) algorithms used to simulate diffusion-reaction equations must employ a certain number of particles to properly emulate the system dynamics---particularly for imperfectly-mixed systems. The number of particles is tied to the statistics of the initial concentration fields of the system at hand. Systems with shorter-range correlation and/or smaller concentration variance require more particles, potentially limiting the computational feasibility of the method. For the well-known problem of bimolecular reaction, we show that using kernel-based, rather than Dirac delta, particles can significantly reduce the required number of particles. We derive the fixed half-width of a Gaussian kernel for a given reduced number of particles that analytically eliminates the error between kernel and Dirac solutions at any specified time. We also show how to solve for the fixed kernel size by minimizing the squared differences between solutions over any given time interval. Numerical results show that the half-width of the kernel should be kept below about 12% of the domain size, and that the analytic equations used to derive kernel size suffer significantly from the neglect of higher-order moments. The simulations with a kernel half-width given by least squares minimization perform better than those made to match at one specific time. A heuristic time-variable kernel size, based on the previous results, performs on par with the least squares fixed kernel size.
    Rights
    Copyright of the original work is retained by the author.
    Collections
    2018 - Mines Theses & Dissertations

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  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.