Computational complexity for the two-point block method

Citation

Phang, Pei See and Abdul Majid, Zanariah (2014) Computational complexity for the two-point block method. In: 3rd International Conference on Quantitative Sciences and Its Applications (ICOQSIA 2014), 12–14 Aug. 2014, Langkawi, Kedah. (pp. 187-194).

Abstract

In this paper, we discussed and compared the computational complexity for two-point block method and one-point method of Adams type. The computational complexity for both methods is determined based on the number of arithmetic operations performed and expressed in O(n). These two methods will be used to solve two-point second order boundary value problem directly and implemented using variable step size strategy adapted with the multiple shooting technique via three-step iterative method. Two numerical examples will be tested. The results show that the computational complexity of these methods is reliable to estimate the cost of these methods in term of the execution time. We conclude that the two-point block method has better computational performance compare to the one-point method as the total number of steps is larger.

Download File

Preview

PDF (Abstract)
Computational complexity for the two-point block method.pdf
Download (34kB) | Preview

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Science Institute for Mathematical Research
DOI Number:	https://doi.org/10.1063/1.4903582
Publisher:	AIP Publishing LLC
Keywords:	Block method; Boundary value problem; Computational complexity
Depositing User:	Nabilah Mustapa
Date Deposited:	26 Sep 2017 04:10
Last Modified:	26 Sep 2017 04:10
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1063/1.4903582
URI:	http://psasir.upm.edu.my/id/eprint/57350
Statistic Details:	View Download Statistic

Actions (login required)

View Item