kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Turing's Model for Pattern Formation and Network Controllability
KTH, School of Engineering Sciences (SCI).
KTH, School of Engineering Sciences (SCI).
2024 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This thesis explores the Turing model for pattern formation and its applicationin controlling reaction-diffusion systems. The goal is to simulate both linear andnonlinear reaction-diffusion models, to understand how patterns emerge and toinvestigate the controllability of these systems with boundary controls. Using thefinite difference method (FDM) and other numerical methods on a discretizedgrid, we generated patterns with nonlinear reaction functions, validating Turing’shypothesis that nonlinear models are more applicable for pattern formation. Thenonlinear models produced stable, organized patterns, whereas linear models re-sulted in divergence, creating unrealistic patterns. In the controllability study, wediscovered that full controllability is achieved when all control inputs are active.Our findings suggest that the placement of minimal control inputs, derived fromspecific patterns, ensures full controllability in small systems, though further re-search is needed to generalize this method to larger grids. This work underscoresthe potential of simplified models like Turing’s to provide insights into the com-plex mechanisms governing natural pattern formation.

Place, publisher, year, edition, pages
2024.
Series
TRITA-SCI-GRU ; 2024:132
Keywords [en]
Pattern formation, Turing’s model, network controllability, control placement
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-348995OAI: oai:DiVA.org:kth-348995DiVA, id: diva2:1879339
Supervisors
Examiners
Available from: 2024-06-28 Created: 2024-06-28 Last updated: 2024-06-28Bibliographically approved

Open Access in DiVA

fulltext(2441 kB)114 downloads
File information
File name FULLTEXT01.pdfFile size 2441 kBChecksum SHA-512
fb26f923d0564cf391166d76bf45daea12b3e6c1aff830e60c7c5202053eb5c83eecbfd4fec95c85e2f768631dc2ea29aef4c768d35a85d439db4ce32e0fd081
Type fulltextMimetype application/pdf

By organisation
School of Engineering Sciences (SCI)
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 114 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 296 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf