This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Building PDE Codes to be Verifiable and Validatable
September/October 2004 (vol. 6 no. 5)
pp. 30-38
Patrick J. Roache, Consultant
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.
Index Terms:
verification, validation, manufactured solutions, MMS, grid convergence, GCI
Citation:
Patrick J. Roache, "Building PDE Codes to be Verifiable and Validatable," Computing in Science and Engineering, vol. 6, no. 5, pp. 30-38, Sept.-Oct. 2004, doi:10.1109/MCSE.2004.33
Usage of this product signifies your acceptance of the Terms of Use.