Othman, Khairil Iskandar (2007) Partitioning Techniques and Their Parallelization for Stiff System of Ordinary Differential Equations. PhD thesis, Universiti Putra Malaysia.
A new code based on variable order and variable stepsize component wise partitioning is introduced to solve a system of equations dynamically. In previous partitioning technique researches, once an equation is identified as stiff, it will remain in stiff subsystem until the integration is completed. In this current technique, the system is treated as nonstiff and any equation that caused stiffness will be treated as stiff equation. However, should the characteristics showed the elements of nonstiffness, and then it will be treated again with Adam method. This process will continue switching from stiff to nonstiff vice versa whenever it is necessary until the interval of integration is completed.Next, a block method with R-points generate R new approximate solution values;is a strategy for solving a system and also for parallelizing ODEs. Partitioning this block method to solve stiff differential equations is a new strategy; it is more efficient and takes less computational time compared to the sequential methods. Two partitioning techniques are constructed, Intervalwise Block Partitioning (IBP) and Componentwise Block Partitioning (CBP). Numerical results are compared as validation of its effectiveness. Intervalwise block partitioning will initially treat the systems of equations as nonstiff and solve them using Adams method, by switching to the Backward Differentiation formula when there is a step failure and indication of stiffness. Componentwise block partitioning will place the necessary equations that cause instability and stiffness into the stiff subsystem and solve using Backward Differentiation Formula, while all other equations will still be treated as non-stiff and solved using Adams formula. Parallelizing the partitioning strategies using Message Passing Interface (MPI) is the most appropriate method to solve large system of equations. Parallelizing the right algorithm in the partitioning code will give a better perfonnance with shorter execution times. The graphs of its performance and execution time, visualize the advantages of parallelizing.
|Item Type:||Thesis (PhD)|
|Subject:||Stiff computation (Differential equations)|
|Chairman Supervisor:||Professor Madya Fudziah bt Ismail, PhD|
|Call Number:||FS 2007 39|
|Faculty or Institute:||Faculty of Science|
|Deposited By:||Nurul Hayatie Hashim|
|Deposited On:||26 Nov 2010 07:26|
|Last Modified:||17 Dec 2012 03:05|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 26 Nov 2010 07:26.