The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2014
DOI: 10.1016/j.cpc.2014.01.002
|View full text |Cite
|
Sign up to set email alerts
|

An efficient numerical technique for the solution of nonlinear singular boundary value problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
75
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 90 publications
(79 citation statements)
references
References 39 publications
4
75
0
Order By: Relevance
“…The maximum absolute error in the DDHPM result is given in Table 2 along with comparisons with the results obtained by the standard HPM 14 and the MADM. 20 We see that the DDHPM shows its superiority over these 2 methods as expected. The results of errors for n = 6, 8 are also plotted in Figure 2.…”
Section: Examplesupporting
confidence: 77%
“…The maximum absolute error in the DDHPM result is given in Table 2 along with comparisons with the results obtained by the standard HPM 14 and the MADM. 20 We see that the DDHPM shows its superiority over these 2 methods as expected. The results of errors for n = 6, 8 are also plotted in Figure 2.…”
Section: Examplesupporting
confidence: 77%
“…The numerical study of singular boundary value problems arising in various physical models has been done by many authors [1][2][3][4][5][6][7][8][9][10][11] and a variety of methods have been introduced to solve such singular boundary B G. Hariharan hariharang2011@gmail.com 1 Department of Mathematics, School of Humanities and Sciences, SASTRA University, Thanjavur, Tamilnadu 613 401, India value problems [2,3,5,[8][9][10]. Although, these numerical methods have many advantages, but a huge amount of computational work is needed.…”
Section: Introductionmentioning
confidence: 99%
“…is the .i, j/th component of the n C 1 by n C 1 matrix D, which is called the differentiation matrix [32]. According to (8), the entries of differentiation matrix D are computed by taking the analytical derivative of ' i .t/ and evaluating it in collocation points j for i, j D 0, : : : , n. However, more computationally practical methods for deriving these entries, in an accurate and stable manner, can be found in [33]. It is noted that the round-off error of the kth derivative is almost of order O. n 2k / [34,35], where is the machine precision and n is the number of discretization points.…”
Section: The Proposed Pseudospectral Methodsmentioning
confidence: 99%