Citation
Abstract
Most methods for solving stiff systems of ordinary differential equations (ODEs) are based on backward differentiation formulas (BDFs) which normally require repeated solution of systems of linear equations with coefficient matrix, IhbJ,where J is the Jacobian matrix as part of a Newton-like iteration on each time step. The matrix operations in the iteration scheme consumes a considerable amount of computational effort. Therefore, in this paper, our objective is to reduce the cost of the iteration scheme by technique of partitioning. The strategy adopted for partitioning is based on block Adams method and block BDF method. Numerical results demonstrates the efficiency of the proposed partitioning in improving both the accuracy and CPU time over traditional stiff methods.
Download File
Full text not available from this repository.
Official URL or Download Paper: http://dx.doi.org/10.1016/j.amc.2006.11.020
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Faculty of Science |
DOI Number: | https://doi.org/10.1016/j.amc.2006.11.020 |
Publisher: | Elsevier |
Keywords: | Block,Ordinary differential equations,Partitioning |
Depositing User: | Najwani Amir Sariffudin |
Date Deposited: | 10 Aug 2010 06:03 |
Last Modified: | 18 Apr 2014 05:11 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.amc.2006.11.020 |
URI: | http://psasir.upm.edu.my/id/eprint/7668 |
Statistic Details: | View Download Statistic |
Actions (login required)
![]() |
View Item |