Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/7349
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Furter, JE | - |
dc.contributor.author | McKee, Alex Clive Seymoore | - |
dc.date.accessioned | 2013-04-15T09:57:10Z | - |
dc.date.available | 2013-04-15T09:57:10Z | - |
dc.date.issued | 2011 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/7349 | - |
dc.description | This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University. | en_US |
dc.description.abstract | In this work we apply the Adomian decomposition method to an orientation aggregation problem modelling the time distribution of filaments. We find analytical solutions under certain specific criteria and programmatically implement the Adomian method to two variants of the orientation aggregation model. We extend the utility of the Adomian decomposition method beyond its original capability to enable it to converge to more than one solution of a nonlinear problem and further to be used as a corrector in path following bifurcation problems. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Brunel University, School of Information Systems, Computing and Mathematics | - |
dc.relation.ispartof | School of Information Systems, Computing and Mathematics | - |
dc.relation.uri | http://bura.brunel.ac.uk/bitstream/2438/7349/1/FulltextThesis.pdf | - |
dc.subject | Sigmoid | en_US |
dc.subject | Filaments | en_US |
dc.subject | Singularity | en_US |
dc.subject | Residues | en_US |
dc.subject | Convergence | en_US |
dc.title | Analytical solutions of orientation aggregation models, multiple solutions and path following with the Adomian decomposition method | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | Dept of Mathematics Theses Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FulltextThesis.pdf | 1.64 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.