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

詳細記述

保存先:
書誌詳細
主要な著者: 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/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!