DocumentCode
1065284
Title
Building PDE codes to be verifiable and validatable
Author
Roache, Patrick J.
Volume
6
Issue
5
fYear
2004
Firstpage
30
Lastpage
38
Abstract
For codes that solve nonlinear partial differential equations (PDEs), powerful methodologies already exist for verification of codes, verification of calculations, and validation (V2V). If computational scientists and engineers are serious about these issues, they will take the responsibility and the relatively little extra effort to design (or modify) their codes so that independent users can confirm V2V.
Keywords
codes; formal verification; partial differential equations; PDE codes; V2V; calculation verification; code verification; nonlinear PDE; partial differential equations; Code standards; Computer errors; Design engineering; Mathematical model; Mathematics; Partial differential equations; Power engineering and energy; Power engineering computing; Software standards; Uncertainty; 65; GCI; MMS; grid convergence; manufactured solutions; validation; verification;
fLanguage
English
Journal_Title
Computing in Science & Engineering
Publisher
ieee
ISSN
1521-9615
Type
jour
DOI
10.1109/MCSE.2004.33
Filename
1324548
Link To Document