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/
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!

相似書籍