Abstract

Widespread recent interest in techniques for demonstrating that computer simulation programs are correct (‘verification’) has been motivated by evidence that traditional development and testing procedures are disturbingly ineffective. Reproducing an exact solution of the relevant model equations is generally accepted as the strongest available verification procedure, but this technique depends on the availability of suitable exact solutions. In this paper we consider verification of a particle-in-cell simulation with Monte Carlo collisions. We know of no exact solutions that simultaneously exercise all of the functions of this code. However, we show here that there can be found in the literature a number of non-trivial exact solutions, each of which exercises a substantial subset of these functions, and which in combination exercise all of the functions of the code. That the code is able to reproduce these solutions is correctness evidence of a stronger kind than has hitherto been elucidated.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.