{"id":{"repo_id":"colo-mines","oai_identifier":"oai:repository.mines.edu:11124/237"},"canonical_url":"https://search.dev.ndltd.org/etd/colo-mines/oai:repository.mines.edu:11124/237","repository":{"repo_id":"colo-mines","name":"Colorado School of Mines","base_url":"https://repository.mines.edu/server/oai/request"},"display":{"title":"Efficient computational models for pattern formation in fixed and evolving domains","abstract":"We efficiently model spatial patterns formed by nonlinear reaction-diffusion equations for benchmark reaction kinetics. Computational methods for modeling reaction-diffusion equations have been presented extensively in literature. Efficiency in these computational methods, either higher convergence or reduced computation time, is desired. We use a moving finite element method presented in literature and adapt it to include a second order convergence discretization and linearization. An algorithm is presented that utilizes these higher convergence methods. Numerical results demonstrate the order of convergence and reduced computational times required to model pattern formation on stationary and time dependent spatial domains. Mode isolation using manipulation of the Turing parameter space is conducted for validation. Pattern evolution on time dependent spatial domains is demonstrated.","abstract_html":"We efficiently model spatial patterns formed by nonlinear reaction-diffusion equations for benchmark reaction kinetics. Computational methods for modeling reaction-diffusion equations have been presented extensively in literature. Efficiency in these computational methods, either higher convergence or reduced computation time, is desired. We use a moving finite element method presented in literature and adapt it to include a second order convergence discretization and linearization. An algorithm is presented that utilizes these higher convergence methods. Numerical results demonstrate the order of convergence and reduced computational times required to model pattern formation on stationary and time dependent spatial domains. Mode isolation using manipulation of the Turing parameter space is conducted for validation. Pattern evolution on time dependent spatial domains is demonstrated.","abstract_has_math":false,"creators":["Jeavons, Peter"],"institution":"Colorado School of Mines. Arthur Lakes Library","degree_name":"Master of Science (M.S.)","degree_level":"Masters","degree_discipline":"Applied Mathematics and Statistics","degree_department":null,"school":null,"contributors":[],"advisors":["Ganesh, Mahadevan"],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-07-24T01:43:54Z","subjects":[],"languages":["eng","English"],"rights":["Copyright of the original work is retained by the author."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["T 7405"],"render_values":[{"text":"T 7405","href":null,"code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/11124/237","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Ganesh, Mahadevan"]},{"key":"dc:creator","label":"Author","values":["Jeavons, Peter"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2007-01-03T06:04:20Z","2022-02-09T09:04:07Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2007-01-03T06:04:20Z","2022-02-09T09:04:07Z"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["Colorado School of Mines. Arthur Lakes Library"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Applied Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (M.S.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Colorado School of Mines"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright of the original work is retained by the author."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["T 7405"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/11124/237"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["2014 Spring.","Includes illustrations (some color).","Includes bibliographical references (pages 61-62)."]},{"key":"dc:description.abstract","label":"Abstract","values":["We efficiently model spatial patterns formed by nonlinear reaction-diffusion equations for benchmark reaction kinetics. Computational methods for modeling reaction-diffusion equations have been presented extensively in literature. Efficiency in these computational methods, either higher convergence or reduced computation time, is desired. We use a moving finite element method presented in literature and adapt it to include a second order convergence discretization and linearization. An algorithm is presented that utilizes these higher convergence methods. Numerical results demonstrate the order of convergence and reduced computational times required to model pattern formation on stationary and time dependent spatial domains. Mode isolation using manipulation of the Turing parameter space is conducted for validation. Pattern evolution on time dependent spatial domains is demonstrated."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["born digital","masters theses"]},{"key":"dc:title","label":"Title","values":["Efficient computational models for pattern formation in fixed and evolving domains"]}]}],"canonical_facts":{"dc:contributor.advisor":["Ganesh, Mahadevan"],"dc:creator":["Jeavons, Peter"],"dc:date.accessioned":["2007-01-03T06:04:20Z","2022-02-09T09:04:07Z"],"dc:date.available":["2007-01-03T06:04:20Z","2022-02-09T09:04:07Z"],"dc:date.issued":["2014"],"dc:description":["2014 Spring.","Includes illustrations (some color).","Includes bibliographical references (pages 61-62)."],"dc:description.abstract":["We efficiently model spatial patterns formed by nonlinear reaction-diffusion equations for benchmark reaction kinetics. Computational methods for modeling reaction-diffusion equations have been presented extensively in literature. Efficiency in these computational methods, either higher convergence or reduced computation time, is desired. We use a moving finite element method presented in literature and adapt it to include a second order convergence discretization and linearization. An algorithm is presented that utilizes these higher convergence methods. Numerical results demonstrate the order of convergence and reduced computational times required to model pattern formation on stationary and time dependent spatial domains. Mode isolation using manipulation of the Turing parameter space is conducted for validation. Pattern evolution on time dependent spatial domains is demonstrated."],"dc:format.medium":["born digital","masters theses"],"dc:identifier":["T 7405"],"dc:identifier.uri":["https://hdl.handle.net/11124/237"],"dc:language":["English"],"dc:language.iso":["eng"],"dc:publisher":["Colorado School of Mines. Arthur Lakes Library"],"dc:rights":["Copyright of the original work is retained by the author."],"dc:title":["Efficient computational models for pattern formation in fixed and evolving domains"],"dc:type":["Text"],"thesis:degree_discipline":["Applied Mathematics and Statistics"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science (M.S.)"],"thesis:institution_name":["Colorado School of Mines"]},"updated_at":"2026-07-24T01:43:54Z"}