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: Phang, Pei See, Abdul Majid, Zanariah
Format: Conference or Workshop Item
Language:English
Published: AIP Publishing LLC 2014
Online Access:http://psasir.upm.edu.my/id/eprint/57350/1/Computational%20complexity%20for%20the%20two-point%20block%20method.pdf
http://psasir.upm.edu.my/id/eprint/57350/
Tags: Add Tag
No Tags, Be the first to tag this record!