2002
DOI: 10.1201/9781420035421
|View full text |Cite
|
Sign up to set email alerts
|

Verification of Computer Codes in Computational Science and Engineering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
138
0
5

Year Published

2004
2004
2014
2014

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 125 publications
(144 citation statements)
references
References 0 publications
1
138
0
5
Order By: Relevance
“…The results show that the model was asymptotically convergent given that the global numerical error was tending to zero as x was reduced. Also, we can say that the first term in the truncation error dominated the higher order terms, given that value for p was shown to be converging [2]. The global numerical error converged by a factor of approximately two during successive grid refinements.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…The results show that the model was asymptotically convergent given that the global numerical error was tending to zero as x was reduced. Also, we can say that the first term in the truncation error dominated the higher order terms, given that value for p was shown to be converging [2]. The global numerical error converged by a factor of approximately two during successive grid refinements.…”
Section: Discussionmentioning
confidence: 99%
“…The formal procedure that we will use for model verification was first implemented by Steinberg and Roache [16] and is summarised by Knupp and Salari [2]. The method focuses on order of accuracy.…”
Section: Background Theorymentioning
confidence: 99%
See 2 more Smart Citations
“…[16][17][18][19][20][21][22][23][24][25] Consistent with this importance, a procedure for verifying the conceptual development and numerical implementation of integration algorithms used to determine pF with temperature-dependent delays is now described. This procedure also provides the basis for an alternative approach to the numerical approximation of pF.…”
Section: Verification Of Numerical Proceduresmentioning
confidence: 99%