Computational complexity for the two-point block method

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 use...

Full description

Saved in:
Bibliographic Details
Main Authors: See Phang Pei, Majid, Zanariah Abdul
Format: Conference Proceeding
Language:English
Subjects:
Boundary value problems
Complexity
Computation
Goal programming
Iterative methods
Methods
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.4903582