Building PDE Codes to be Verifiable and Validatable

Authors:
Patrick J. Roache
Affiliations:
Consultant
Venue:
Computing in Science and Engineering
Year:
2004

Citing 1
Cited 2

The Physical Basis of Computability

Computing in Science and Engineering

Testing for trustworthiness in scientific software

SECSE '09 Proceedings of the 2009 ICSE Workshop on Software Engineering for Computational Science and Engineering
A learning-based approach to unit testing of numerical software

ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems

Quantified Score

Hi-index	0.00

Visualization

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.