Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,027 records · Page 57

Generalized quantum master equations can improve the accuracy of semiclassical predictions of multitime correlation functions

Multitime quantum correlation functions are central objects in physical science, offering a direct link between the experimental observables and the dynamics of an underlying model. While experiments such as 2D spectroscopy and quantum control can now measure such quantities, the accurate simulation of such responses remains computationally expensive and sometimes impossible, depending on the system’s complexity. A natural tool to employ is the generalized quantum master equation (GQME), which can offer computational savings by extending reference dynamics at a comparatively trivial cost. However, dynamical methods that can tackle chemical systems with atomistic resolution, such as those in the semiclassical hierarchy, often suffer from poor accuracy, limiting the credence one might lend to their results. By combining work on the accuracy-boosting formulation of semiclassical memory kernels with recent work on the multitime GQME, here we show for the first time that one can exploit a multitime semiclassical GQME to dramatically improve both the accuracy of coarse mean-field Ehrenfest dynamics and obtain orders of magnitude efficiency gains.

Chemistry↗

Meter-Scale 3-D Models of the Martian Surface from Combining MOC and MOLA Data

We have extended our previous efforts to derive through controlled photoclinometry, accurate, calibrated, high-resolution topographic models of the martian surface. The process involves combining MGS MOLA topographic profiles and MGS MOC Narrow Angle images. The earlier work utilized, along with a particular MOC NA image, the MOLA topographic profile that was acquired simultaneously, in order to derive photometric and scattering properties of the surface and atmosphere so as to force the low spatial frequencies of a one-dimensional MOC photoclinometric model to match the MOLA profile. Both that work and the new results reported here depend heavily on successful efforts to: 1) refine the radiometric calibration of MOC NA; 2) register the MOC to MOLA coordinate systems and refine the pointing; and 3) provide the ability to project into a common coordinate system, simultaneously acquired MOC and MOLA with a single set of SPICE kernels utilizing the USGS ISIS cartographic image processing tools. The approach described in this paper extends the MOC-MOLA integration and cross-calibration procedures from one-dimensional profiles to full two-dimensional photoclinometry and image simulations. Included are methods to account for low-frequency albedo variations within the scene.

Soderblom, Laurence A.↗

Virtual Sensors: Using Data Mining Techniques to Efficiently Estimate Remote Sensing Spectra

Various instruments are used to create images of the Earth and other objects in the universe in a diverse set of wavelength bands with the aim of understanding natural phenomena. These instruments are sometimes built in a phased approach, with some measurement capabilities being added in later phases. In other cases, there may not be a planned increase in measurement capability, but technology may mature to the point that it offers new measurement capabilities that were not available before. In still other cases, detailed spectral measurements may be too costly to perform on a large sample. Thus, lower resolution instruments with lower associated cost may be used to take the majority of measurements. Higher resolution instruments, with a higher associated cost may be used to take only a small fraction of the measurements in a given area. Many applied science questions that are relevant to the remote sensing community need to be addressed by analyzing enormous amounts of data that were generated from instruments with disparate measurement capability. This paper addresses this problem by demonstrating methods to produce high accuracy estimates of spectra with an associated measure of uncertainty from data that is perhaps nonlinearly correlated with the spectra. In particular, we demonstrate multi-layer perceptrons (MLPs), Support Vector Machines (SVMs) with Radial Basis Function (RBF) kernels, and SVMs with Mixture Density Mercer Kernels (MDMK). We call this type of an estimator a Virtual Sensor because it predicts, with a measure of uncertainty, unmeasured spectral phenomena.

Srivastava, Ashok N.↗

Continuum covariance propagation for understanding variance loss in advective systems

At the heart of modern data assimilation schemes is covariance propagation.Loss of variance experienced in large-scale applications such as numerical weather prediction is problematic, and the development of auxiliary methods to mitigate this issue is an active research area. The focus of this work is to understand the root causes of variance loss and show that for advective dynamics, the covariance propagation by itself typically causes significant, spurious loss of variance, even at full rank. To demonstrate this, we first study continuum covariance propagation by analyzing the covariance evolution equation for advective dynamics. The behavior of this evolution equation changes abruptly as the correlation length tends to zero, for example in the vicinity of sharp gradients in the advection field. This happens because the diagonal of the kernel of the covariance operator is a characteristic surface for advective dynamics. Our numerical experiments then confirm that the variance lost during numerical propagation greatly exceeds that due to numerical dissipation alone. The variance loss is driven primarily by inaccurate variance propagation resulting from standard, full-rank covariance propagation schemes, which have difficulty capturing the abrupt change in dynamics as the correlation length tends to zero. These results suggest that developing local covariance propagation methods may prove useful in ameliorating the variance loss observed in data assimilation schemes

Covariance Propagation↗

Improvement of Varian a-Si EPID dosimetry measurements using a lead-shielded support-arm

Dosimetry measurements with Varian amorphous silicon electronic portal imaging devices (a-Si EPIDs) are affected by the backscattered radiation from the EPID support arm. In this study, the nonuniform backscatter from an E-type support arm was reduced by fixing a thick (12.2 Multiplication-Sign 10.5 Multiplication-Sign 0.5 cm{sup 3}) piece of lead on top of the arm, and the remaining backscatter was modeled and included in an existing dose prediction algorithm. The applied backscatter kernel was the average of kernels on different regions of the EPID over the arm. The lead-shielded arm reduced the nonuniform backscatter component by about 50% for field sizes ranging from 3 Multiplication-Sign 3 to 30 Multiplication-Sign 30 cm{sup 2} and the field symmetry improved for medium to large fields up to 3%. Gamma evaluation of the measured and modeled doses (2%, 2-mm criteria) showed that using the lead-shielded arm in the model increased the number of points with Gamma index <1 by 5.7% and decreased the mean Gamma by 0.201. Even using the lead alone (no modeling) could increase the number of points with Gamma index <1 by 4.7% and decrease the mean Gamma by 0.153. This is a simple and easy method to decrease the nonuniform arm backscatter and improve the accuracy of dosimetry measurements with the existing EPIDs used for clinical applications.

61 RADIATION PROTECTION AND DOSIMETRY↗

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

97 MATHEMATICS AND COMPUTING↗

Efficient screening of rare large pit anomalies on polished surfaces using a minimalist sampling scheme

Lawrence Livermore National Laboratory (LLNL) has made significant strides in generating clean energy through its inertial confinement fusion (ICF) experiments. These experiments rely on high-density carbon (HDC) coated shells to encapsulate the fusion fuel. The success of these experiments is heavily dependent on the surface quality of these shells, as even minor imperfections, such as deep pits, can negatively impact fusion yield. Ensuring the required smoothness involves an extensive surface-finishing process that spans approximately 20 stages, making it both time-intensive and resource-demanding. A critical challenge in this process is the need for high-resolution scans to detect rare deep pits, which can be costly and impractical if performed on every shell. This highlights the necessity of developing more efficient scanning methods to optimize time and cost without compromising accuracy. To address these challenges, we introduce a novel approach that employs the multivariate Dvoretzky–Kiefer–Wolfowitz (DKW) inequality to provide a probabilistic upper bound on the error in estimating pit distribution characteristics via a Kernel Density Estimator (KDE). This error bound enables efficient and reliable estimation of pit distribution characteristics at a specified statistical confidence level using a minimal number of surface scans. The integrated DKW-KDE approach was validated through surface-finishing experiments across two batches of HDC-coated shells, demonstrating consistent and robust performance across multiple stages of the surface-finishing experiments. The validation studies suggest that the integrated DKW-KDE approach achieves comparable accuracy in estimating the risk of deleterious large pits with six scans, thus conserving time and resources. Further evaluations show that performance remains consistent across batches and over multiple polishing stages. In conclusion, based on these findings, one can leverage the minimal-scan insights to strategically improve the bottleneck inspection process, thus enhancing the productivity and quality of shell polishing and similar challenging manufacturing processes.

Inertial confinement fusion↗

Function space requirements for the single-electron functions within the multiparticle Schroedinger equation

Our previously described method to approximate the many-electron wavefunction in the multiparticle Schroedinger equation reduces this problem to operations on many single-electron functions. In this work, we analyze these operations to determine which function spaces are appropriate for various intermediate functions in order to bound the output. This knowledge then allows us to choose the function spaces in which to control the error of a numerical method for single-electron functions. We find that an efficient choice is to maintain the single-electron functions in L{sup 2} Intersection L{sup 4}, the product of these functions in L{sup 1} Intersection L{sup 2}, the Poisson kernel applied to the product in L{sup 4}, a function times the Poisson kernel applied to the product in L{sup 2}, and the nuclear potential times a function in L{sup 4/3}. Due to the integral operator formulation, we do not require differentiability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast computation of synthetic seismograms within a medium containing remote localized perturbations: a numerical solution to the scattering problem

We derive a fast discrete solution to the scattering problem. This solution allows us to compute accurate synthetic seismograms or waveforms for arbitrary locations of sources and receivers within a medium containing localized perturbations. The key to efficiency is that wave propagation modelling does not need to be carried out in the entire volume that encompasses the sources and the receivers but only within the subvolume containing the perturbations or scatterers. The proposed solution has important applications, for example, it permits the imaging of remote targets located in regions where no sources or receivers are present. Our solution relies on domain decomposition: within a small volume that contains the scatterers, wave propagation is modelled numerically, while in the surrounding volume, where the medium isn't perturbed, the response is obtained through wavefield extrapolation. The originality of this work is the derivation of discrete formulas for representation theorems and Kirchhof–Helmholtz integrals that naturally adapt to the numerical scheme employed for modelling wave propagation. Our solution applies, for example, to finite difference methods or finite/spectral elements methods. The synthetic seismograms obtained with our solution can be considered ‘exact’ as the total numerical error is comparable to that of the method employed for modelling wave propagation. We detail a basic implementation of our solution in the acoustic case using the finite difference method and present numerical examples that demonstrate the accuracy of the method. We show that ignoring some terms accounting for higher order scattering effects in our solution has a limited effect on the computed seismograms and significantly reduces the computational effort. Finally, we show that our solution can be used to compute localized sensitivity kernels and we discuss applications to target oriented imaging. Extension to the elastic case is straightforward and summarized in a dedicated section.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Estimates for Sonic-Boom Pressure Signatures and Loudness Carpets

A non-intrusive uncertainty quantification method is applied to computational analysis of supersonic, low-boom aircraft. The mean and standard deviation statistics of the pressure waveforms and loudness metrics are evaluated through use of numerical quadrature. The probability density function (p.d.f.) of these outputs is evaluated via kernel density estimation. The simulations use an inviscid, embedded-boundary Cartesian-mesh flow solver in the nearfield combined with an augmented Burgers’ equation solver for propagation in the farfield. The results show that the p.d.f. of the waveform is bimodal at shocks, which makes the mean and standard deviation statistics inappropriate. Despite this limitation, we show that the moment statistics can provide effective assessment of discrepancies when comparing with experimental data. This is demonstrated by presenting uncertainty analysis of a wind-tunnel test and showing that we significantly improve the predictions when we include the test uncertainties in the simulation. Normal distributions are obtained for the ground signature and loudness metrics, which is primarily due to the careful shaping of the low-boom waveform. Separation of variables and error control are used to reduce computational cost. We demonstrate that this is an efficient approach in the sense of balancing numerical errors in the statistics quadrature with discretization errors in the solvers.

ARMD↗

Porting the Nonlinear Optimization Library HiOp to Accelerator-Based Hardware Architectures

While interior point method has been the centerpiece of nonlinear programming tools used in science and engineering, its reliance on linear solvers that can tackle sparse symmetric indefinite and highly ill-conditioned problems made it difficult to implement it effectively on hardware accelerators. HiOp optimization package attempts to provide an implementation of the interior point method suitable for hardware accelerators by compressing the original sparse problem to produce an underlying linear problem that is dense and of manageable size. Implementations of dense linear solvers are more mature and utilize hardware accelerators better than their sparse counterparts. There is a number of important domain problems, such as optimal power flow analysis for power grids, where the sparse problem can be effectively compressed and deploying dense linear solver within the interior point method can improve performance. Here we describe a portable implementation of HiOp optimization engine, which uses a linear solver from Magma library and runs entirely on hardware accelerators. To compress the problem, HiOp uses customized mixed dense-sparse linear algebra. All HiOp kernels are implemented using Umpire and RAJA portability libraries. We describe details of the implementation and discuss trade-offs between performance, portability and development cost.

97 MATHEMATICS AND COMPUTING↗

SU-G-BRC-02: A Novel Multi-Criteria Optimization Approach to Generate Deliverable Intensity-Modulated Radiation Therapy (IMRT) Treatment Plans

Purpose: To present a novel multi-criteria optimization (MCO) solution approach that generates treatment plans with deliverable apertures using column generation. Methods: We demonstrate our method with 10 locally advanced head-and-neck cancer cases retrospectively. In our MCO formulation, we defined an objective function for each structure in the treatment volume. This resulted in 9 objective functions, including 3 distinct objectives for primary target volume, high-risk and low-risk target volumes, 5 objectives for each of the organs-at-risk (OARs) (two parotid glands, spinal cord, brain stem and oral cavity), and one for the non-target non-OAR normal tissue. Conditional value-at-risk (CVaR) constraints were utilized to ensure at least certain fraction of the target volumes receiving the prescription doses. To directly generate deliverable plans, column generation algorithm was embedded within our MCO approach for aperture shape generation. Final dose distributions for all plans were generated using a Monte Carlo kernel-superposition dose calculation. We compared the MCO plans with the clinical plans, which were created by clinicians. Results: At least 95% target coverage was achieved by both MCO plans and clinical plans. However, the average conformity indices of clinical plans and the MCO plans were 1.95 and 1.35, respectively (31% reduction, p<0.01). Compared to the conventional clinical plan, the proposed MCO method achieved average reductions in left parotid mean dose of 5% (p=0.06), right parotid mean dose of 18% (p<0.01), oral cavity mean dose of 21% (p=0.03), spinal cord maximum dose of 20% (p<0.01), brain stem maximum dose of 61% (p<0.01), and normal tissue maximum dose of 5% (p<0.01), respectively. Conclusion: We demonstrated that the proposed MCO method was able to obtain deliverable IMRT treatment plans while achieving significant improvements in dosimetric plan quality.

60 APPLIED LIFE SCIENCES↗

Automated Segmentation of the Parotid Gland Based on Atlas Registration and Machine Learning: A Longitudinal MRI Study in Head-and-Neck Radiation Therapy

Purpose: To develop an automated magnetic resonance imaging (MRI) parotid segmentation method to monitor radiation-induced parotid gland changes in patients after head and neck radiation therapy (RT). Methods and Materials: The proposed method combines the atlas registration method, which captures the global variation of anatomy, with a machine learning technology, which captures the local statistical features, to automatically segment the parotid glands from the MRIs. The segmentation method consists of 3 major steps. First, an atlas (pre-RT MRI and manually contoured parotid gland mask) is built for each patient. A hybrid deformable image registration is used to map the pre-RT MRI to the post-RT MRI, and the transformation is applied to the pre-RT parotid volume. Second, the kernel support vector machine (SVM) is trained with the subject-specific atlas pair consisting of multiple features (intensity, gradient, and others) from the aligned pre-RT MRI and the transformed parotid volume. Third, the well-trained kernel SVM is used to differentiate the parotid from surrounding tissues in the post-RT MRIs by statistically matching multiple texture features. A longitudinal study of 15 patients undergoing head and neck RT was conducted: baseline MRI was acquired prior to RT, and the post-RT MRIs were acquired at 3-, 6-, and 12-month follow-up examinations. The resulting segmentations were compared with the physicians' manual contours. Results: Successful parotid segmentation was achieved for all 15 patients (42 post-RT MRIs). The average percentage of volume differences between the automated segmentations and those of the physicians' manual contours were 7.98% for the left parotid and 8.12% for the right parotid. The average volume overlap was 91.1% ± 1.6% for the left parotid and 90.5% ± 2.4% for the right parotid. The parotid gland volume reduction at follow-up was 25% at 3 months, 27% at 6 months, and 16% at 12 months. Conclusions: We have validated our automated parotid segmentation algorithm in a longitudinal study. This segmentation method may be useful in future studies to address radiation-induced xerostomia in head and neck radiation therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Full-Height Axial P 3 Solver for the 2D/1D Method in MPACT

This report encompasses the efforts to complete L3:RTM.PRT.P15.04, which relates to improvements to the axial solvers in MPACT. Over the past few years, a number of convergence issues have been encountered throughout the 2D/1D calculation. While many of these were related to transport-corrected stability, which has been much improved through the development of multigroup MOC kernels, there are still some instabilities that are more directly related to the 1D axial nodal solvers. The primary focus of this milestone is on the development of a full-height P 3 solver, which solves for a single linear system for the entire rod, compared to the one- and two-node solvers previously available in MPACT. To provide an efficient full-height solver, the SuperLU direct linear solver was leveraged and an alternative rod decomposition scheme is used in favor over the typically employed axial decomposition. In addition to the full-height solver, a number of stability observations are discussed pertaining to (1) cases with thin planes in the axial reflectors, (2) quadratic radial leakage interpolation, (3) the reset sol capability, which reinitializes the solution before continuing the calculation, and (4) the flux threshold used in the radial transverse leakage splitting logic. The last of these was improved by identifying an acceptable threshold, which greatly help provide stability to the default one-node P 3 solver approach. Results demonstrating the full-height solver are presented for (1) a single assembly case from the AP1000 reactor design, (2) VERA Progression Problem 5a, and (3) a Watts Bar Unit 1, Cycle 1 case that demonstrated convergence issues due to thin planes in the axial reflector. In total, the full-height solver appears to be 3–5× slower for the nodal solve time, yield a roughly 10–20% increase in total problem run time, and requires ~5% more memory. However, these increases may be justifiable if the solver is proven to be more stable than the current default. Additionally, the VERA Progression Problem 4a case with the 252-group library is shown for the one-node P 3 solver with the updated threshold for radial transverse leakage splitting. This case also previous failed very early in the calculation, but is now able to run to completion. Brief details are also included related to the refactoring the nodal sweeper design. Previously, all nodal sweeper options were available in one large module, which was cumbersome and difficult to extend. Before the work here began, the design was refactored to include a number of abstract and extended types, which will help make future extensions easier. All-in-all, this milestone successfully implemented a new axial solver and improved the stability of the current default axial solver. However, additional testing will be necessary on new cases that demonstrate convergence issues before a decision can be made to change the current default in MPACT.

97 MATHEMATICS AND COMPUTING↗

Modeling fission product diffusion in TRISO fuel particles with BISON

Diffusion of fission products in intact TRISO particles depends on particle geometry, fission product source rates, time, temperature, and temperature-dependent diffusion coefficients. Simulating this diffusion process requires models for source rates and diffusion coefficients, plus computation of the temperature field if not prescribed. In addition, simulation quality depends on discretization of the geometry, appropriate time stepping, and the accuracy of the solution method. In this paper, we explore the simulation of fission product diffusion in TRISO fuel particles using the finite element method via the fuel performance code Bison. Recent material model development has occurred in Bison for each material present in tri-structural isotropic (TRISO) fuel particles: the buffer, inner pyrolytic carbon, silicon carbide, and outer pyrolytic carbon layers, as well as the fuel kernel. Also, new mesh generation and fission product release fraction capabilities have been added. Diffusion capabilities are shown to converge to the correct solution via formal verification tests. A large number of code benchmarking problems are also given, with good results, showing that Bison’s computed release fractions closely match those of other software tools. Finally, a significant validation effort is detailed in which fission product release, measured as part of the AGR-1 capsule experiments, is compared to Bison outputs. Bison outputs compare very well to the experimental data and to PARFUME results.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

TH-AB-202-04: Auto-Adaptive Margin Generation for MLC-Tracked Radiotherapy

Purpose: To develop an auto-adaptive margin generator for MLC tracking. The generator is able to estimate errors arising in image guided radiotherapy, particularly on an MR-Linac, which depend on the latencies of machine and image processing, as well as on patient motion characteristics. From the estimated error distribution, a segment margin is generated, able to compensate errors up to a user-defined confidence. Method: In every tracking control cycle (TCC, 40ms), the desired aperture D(t) is compared to the actual aperture A(t), a delayed and imperfect representation of D(t). Thus an error e(t)=A(T)-D(T) is measured every TCC. Applying kernel-density-estimation (KDE), the cumulative distribution (CDF) of e(t) is estimated. With CDF-confidence limits, upper and lower error limits are extracted for motion axes along and perpendicular leaf-travel direction and applied as margins. To test the dosimetric impact, two representative motion traces were extracted from fast liver-MRI (10Hz). The traces were applied onto a 4D-motion platform and continuously tracked by an Elekta Agility 160 MLC using an artificially imposed tracking delay. Gafchromic film was used to detect dose exposition for static, tracked, and error-compensated tracking cases. The margin generator was parameterized to cover 90% of all tracking errors. Dosimetric impact was rated by calculating the ratio between underexposed points (>5% underdosage) to the total number of points inside FWHM of static exposure. Results: Without imposing adaptive margins, tracking experiments showed a ratio of underexposed points of 17.5% and 14.3% for two motion cases with imaging delays of 200ms and 300ms, respectively. Activating the margin generated yielded total suppression (<1%) of underdosed points. Conclusion: We showed that auto-adaptive error compensation using machine error statistics is possible for MLC tracking. The error compensation margins are calculated on-line, without the need of assuming motion or machine models. Further strategies to reduce consequential overdosages are currently under investigation. This work was funded by the SoRTS consortium, which includes the industry partners Elekta, Philips and Technolution.

60 APPLIED LIFE SCIENCES↗

OpenACC acceleration of the Nek5000 spectral element code

We present a case study of porting NekBone, a skeleton version of the Nek5000 code, to a parallel GPU-accelerated system. Nek5000 is a computational fluid dynamics code based on the spectral element method used for the simulation of incompressible flow. The original NekBone Fortran source code has been used as the base and enhanced by OpenACC directives. The profiling of NekBone provided an assessment of the suitability of the code for GPU systems, and indicated possible kernel optimizations. To port NekBone to GPU systems required little effort and a small number of additional lines of code (approximately one OpenACC directive per 1000 lines of code). The naïve implementation using OpenACC leads to little performance improvement: on a single node, from 16 Gflops obtained with the version without OpenACC, we reached 20 Gflops with the naïve OpenACC implementation. An optimized NekBone version leads to a 43 Gflop performance on a single node. In addition, we ported and optimized NekBone to parallel GPU systems, reaching a parallel efficiency of 79.9% on 1024 GPUs of the Titan XK7 supercomputer at the Oak Ridge National Laboratory.

Computer Science↗

Integration of Online Cross-Section Generation Capability with Depletion and Transient Solvers in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE)-based reactor multiphysics analysis application jointly developed by Argonne and Idaho National Laboratories under the DOENE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. In FY25, an online crosssection generation capability based on the Self-Shielding Application Programming Interface (SSAPI) was demonstrated for TRISO-fueled reactor problems under steady-state conditions. This fiscal year, that capability was extended to support depletion and transient multiphysics calculations, enabling high-fidelity analyses that generate self-shielded cross sections on the fly from the actual evolving composition and temperature states rather than from pre-tabulated libraries. For depletion, a two-way coupling was established in which SSAPI computes compact-averaged self-shielded cross sections that the depletion solver then uses to advance the Bateman equations, with the updated compositions returned to SSAPI at each step; the depletion module was refactored to support both library-based and SSAPI-based cross sections, and additional logic was added to track daughter isotopes and to exclude minor isotopes for efficiency. For transient analysis, the SSAPI multigroup library was extended with the kinetics data required for time-dependent calculations, the Improved Quasi-Static (IQS) scheme was coupled with SSAPI, and several supporting capabilities were implemented, including a self-shielding treatment that lets control rods and drums move within a self-shielded model, which had previously been impossible and had ruled out rod- and drum-movement transients with on-the-fly cross sections altogether, a new mixing scheme for delayed-neutron precursor decay constants, a checkpoint-based restart workflow, and performance improvements such as pointwise cross-section interpolation and the bypassing of unnecessary Dancoff factor calculations. The implemented capabilities were verified against Serpent Monte Carlo solutions. For depletion, a prismatic pin-cell problem based on a Next Generation Nuclear Plant (NGNP) Very High Temperature Reactor benchmark showed excellent agreement, with eigenvalue differences within 200 pcm over the entire burnup range (up to 140 MWD/kgU) and fission-product and actinide inventories agreeing to within 0.8% and 2.5%, respectively; a heat-pipe microreactor assembly problem with a much higher fuel loading confirmed the same behavior and quantified the bias introduced when the multigroup equivalence effect is neglected. For transient analysis, a pin-cell problem with a step reactivity insertion and temperature feedback reproduced the analytically expected asymptotic power and showed close agreement between the direct and IQS solutions, and a two-dimensional microreactor core problem with control-drum rotation exercised the new moving-drum self-shielding treatment and demonstrated successful coupling of the online crosssection generation with both the direct and IQS transient methods. The capability was further exercised on a full-core pebble-bed problem, in which Griffin was coupled with the System Analysis Module (SAM) to simulate load-following operation of the gPBR with the Doppler feedback resolved at the TRISO fuel kernel temperature. These developments in Griffin provide a convenient, high-fidelity approach to cross-section generation for advanced thermal reactors with geometrically complex and highly heterogeneous configurations, including TRISO-fueled prismatic and pebble-bed systems, and support steady-state, depletion, and transient multiphysics calculations. They also enable self-shielded cross sections to be evaluated directly at the actual coupled state of the system, thereby establishing a foundation for high-fidelity, fully coupled multiphysics analysis of advanced reactors

Park, H.↗