{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_1922"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_1922","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Development of a fast and accurate time stepping scheme for the functionalized Cahn-Hilliard equation and application to a graphics processing unit","abstract":"\"This dissertation explores and develops time-stepping schemes for computing solutions to the Functionalized Cahn-Hilliard (FCH) model. It is important to find a scheme that is both fast enough to compute evolution to the long-time states and to give enough accuracy to capture important geometric events. The FCH model is relatively new, and very little work has been done to develop efficient numerical schemes for its simulation, so much of this work is based on the extensive work done on the Cahn-Hilliard (CH) model. For each of the methods, the spatial approximation is computed with a Fourier spectral method. All of the schemes are adapted to be computed on a graphics processing unit (GPU) which gives significant improvements in the speed of the simulation.--From abstract.","abstract_html":"&quot;This dissertation explores and develops time-stepping schemes for computing solutions to the Functionalized Cahn-Hilliard (FCH) model. It is important to find a scheme that is both fast enough to compute evolution to the long-time states and to give enough accuracy to capture important geometric events. The FCH model is relatively new, and very little work has been done to develop efficient numerical schemes for its simulation, so much of this work is based on the extensive work done on the Cahn-Hilliard (CH) model. For each of the methods, the spatial approximation is computed with a Fourier spectral method. All of the schemes are adapted to be computed on a graphics processing unit (GPU) which gives significant improvements in the speed of the simulation.--From abstract.","abstract_has_math":false,"creators":["Jones, Jaylan Stuart"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Christlieb, Andrew J.","Promislow, Keith S.","Duxbury, Phillip M.","Mahanti, S D.","Cheng, Yingda"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-11-18T17:43:01Z","subjects":["Graphics processing units"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:1922","isbn:9781303341038","isbn:1303341034","oclc:931742838","umi:3592665","local:Jones_grad.msu_0128D_12337"],"render_values":[{"text":"etd:1922","href":null,"code":true},{"text":"isbn:9781303341038","href":null,"code":true},{"text":"isbn:1303341034","href":null,"code":true},{"text":"oclc:931742838","href":null,"code":true},{"text":"umi:3592665","href":null,"code":true},{"text":"local:Jones_grad.msu_0128D_12337","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/0by9-9n08","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/0by9-9n08","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_1922","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Christlieb, Andrew J.","Promislow, Keith S.","Duxbury, Phillip M.","Mahanti, S D.","Cheng, Yingda"]},{"key":"dc:creator","label":"Author","values":["Jones, Jaylan Stuart"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graphics processing units"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:1922","isbn:9781303341038","isbn:1303341034","oclc:931742838","umi:3592665","local:Jones_grad.msu_0128D_12337","https://doi.org/doi:10.25335/0by9-9n08"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["\"This dissertation explores and develops time-stepping schemes for computing solutions to the Functionalized Cahn-Hilliard (FCH) model. It is important to find a scheme that is both fast enough to compute evolution to the long-time states and to give enough accuracy to capture important geometric events. The FCH model is relatively new, and very little work has been done to develop efficient numerical schemes for its simulation, so much of this work is based on the extensive work done on the Cahn-Hilliard (CH) model. For each of the methods, the spatial approximation is computed with a Fourier spectral method. All of the schemes are adapted to be computed on a graphics processing unit (GPU) which gives significant improvements in the speed of the simulation.--From abstract.","Thesis (Ph. D.)--Michigan State University. Applied Mathematics and Physics, 2013","Includes bibliographical references (pages 227-235)"]},{"key":"dc:format","label":"Dc Format","values":["x, 235 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["Development of a fast and accurate time stepping scheme for the functionalized Cahn-Hilliard equation and application to a graphics processing unit"]}]}],"canonical_facts":{"dc:contributor":["Christlieb, Andrew J.","Promislow, Keith S.","Duxbury, Phillip M.","Mahanti, S D.","Cheng, Yingda"],"dc:creator":["Jones, Jaylan Stuart"],"dc:date":["2013"],"dc:description":["\"This dissertation explores and develops time-stepping schemes for computing solutions to the Functionalized Cahn-Hilliard (FCH) model. It is important to find a scheme that is both fast enough to compute evolution to the long-time states and to give enough accuracy to capture important geometric events. The FCH model is relatively new, and very little work has been done to develop efficient numerical schemes for its simulation, so much of this work is based on the extensive work done on the Cahn-Hilliard (CH) model. For each of the methods, the spatial approximation is computed with a Fourier spectral method. All of the schemes are adapted to be computed on a graphics processing unit (GPU) which gives significant improvements in the speed of the simulation.--From abstract.","Thesis (Ph. D.)--Michigan State University. Applied Mathematics and Physics, 2013","Includes bibliographical references (pages 227-235)"],"dc:format":["x, 235 pages","application/pdf"],"dc:identifier":["etd:1922","isbn:9781303341038","isbn:1303341034","oclc:931742838","umi:3592665","local:Jones_grad.msu_0128D_12337","https://doi.org/doi:10.25335/0by9-9n08"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Graphics processing units"],"dc:title":["Development of a fast and accurate time stepping scheme for the functionalized Cahn-Hilliard equation and application to a graphics processing unit"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T17:43:01Z"}