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/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
On the solution of two point boundary value problems with two point direct method.
著者:: Phang, Pei See, 等
出版事項: (2012) -
New algorithm of two-point block method for solving boundary value problem with dirichlet and Neumann boundary conditions
著者:: Phang, Pei See, 等
出版事項: (2013) -
Solving nonlinear two point boundary value problem using two step direct method
著者:: Phang, Pei See, 等
出版事項: (2011) -
Study of a quadrupole ion trap with damping force by the two-point one block method
著者:: Chaharborj, Sarkhosh Seddighi, 等
出版事項: (2012) -
Solving second order delay differential equations by direct two and three point one-step block method
著者:: Rasdi, Nadzirah, 等
出版事項: (2013)