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

全面介绍

Saved in:
书目详细资料
Main Authors: Phang, Pei See, Abdul Majid, Zanariah
格式: Conference or Workshop Item
语言:English
出版: AIP Publishing LLC 2014
在线阅读: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/
标签: 添加标签
没有标签, 成为第一个标记此记录!

相似书籍