z-logo
open-access-imgOpen Access
Verification and validation of COBRA-SFS transient analysis capability
Author(s) -
David R. Rector,
T.E. Michener,
Judith M. Cuta
Publication year - 1998
Language(s) - English
Resource type - Reports
DOI - 10.2172/335183
Subject(s) - documentation , transient (computer programming) , code (set theory) , computer science , cobra , source code , set (abstract data type) , simulation , programming language
This report provides documentation of the verification and validation testing of the transient capability in the COBRA-SFS code, and is organized into three main sections. The primary documentation of the code was published in September 1995, with the release of COBRA-SFS, Cycle 2. The validation and verification supporting the release and licensing of COBRA-SFS was based solely on steady-state applications, even though the appropriate transient terms have been included in the conservation equations from the first cycle. Section 2.0, COBRA-SFS Code Description, presents a capsule description of the code, and a summary of the conservation equations solved to obtain the flow and temperature fields within a cask or assembly model. This section repeats in abbreviated form the code description presented in the primary documentation (Michener et al. 1995), and is meant to serve as a quick reference, rather than independent documentation of all code features and capabilities. Section 3.0, Transient Capability Verification, presents a set of comparisons between code calculations and analytical solutions for selected heat transfer and fluid flow problems. Section 4.0, Transient Capability Validation, presents comparisons between code calculations and experimental data obtained in spent fuel storage cask tests. Based on the comparisons presented in Sections 2.0 and 3.0, conclusions and recommendations for application of COBRA-SFS to transient analysis are presented in Section 5.0

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here