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...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | 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/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|