From 1eca1fb41583933022cc4d5c8474fcbdfc6884bb Mon Sep 17 00:00:00 2001 From: pearce8 Date: Mon, 1 Jul 2024 20:00:04 -0600 Subject: [PATCH] Update umt.rst --- doc/sphinx/06_umt/umt.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/sphinx/06_umt/umt.rst b/doc/sphinx/06_umt/umt.rst index 8cd64789..d52e233d 100644 --- a/doc/sphinx/06_umt/umt.rst +++ b/doc/sphinx/06_umt/umt.rst @@ -29,11 +29,11 @@ The benchmark problem is a single node sweep performance problem (SPP) on a 3D u Figure of Merit --------------- -The Figure of Merit is defined as the number of unknowns solved per second, which is calculated by: +The Figure of Merit is defined as the number of unknowns solved per second, normalized by the number of iterations, which is calculated by: .. code-block:: - number of unknowns = <# mesh cells * 8> * <# directions> * + number of unknowns = <# mesh cells * 8> * <# directions> * / Explanation on the '# mesh cells * 8': UMT further decomposes a mesh cell into 'corner' sub-cell spatial elements. There are 8 'corners' per cell in a 3D mesh.