Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative linear solution”

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.

414 records · Page 23

Standard and goal-oriented adaptive mesh refinement applied to radiation transport on 2D unstructured triangular meshes

Standard and goal-oriented adaptive mesh refinement (AMR) techniques are presented for the linear Boltzmann transport equation. A posteriori error estimates are employed to drive the AMR process and are based on angular-moment information rather than on directional information, leading to direction-independent adapted meshes. An error estimate based on a two-mesh approach and a jump-based error indicator are compared for various test problems. In addition to the standard AMR approach, where the global error in the solution is diminished, a goal-oriented AMR procedure is devised and aims at reducing the error in user-specified quantities of interest. The quantities of interest are functionals of the solution and may include, for instance, point-wise flux values or average reaction rates in a subdomain. A high-order (up to order 4) Discontinuous Galerkin technique with standard upwinding is employed for the spatial discretization; the discrete ordinates method is used to treat the angular variable.

97 MATHEMATICS AND COMPUTING↗

Design and Analysis of the US ITER Central Solenoid Module Lifting Fixture

The central solenoid (CS) consists of six large high field superconducting magnets (also known as modules) approximately 4 m in diameter and 2 m tall that weigh approximately 120 tonnes each. These large and complex modules create challenges during assembly of the CS that require the development of custom assembly tooling such as the CS lifting fixture. The CS module lifting fixture is designed to lift and stack the six CS modules in the assembly building on the ITER site. Because of its unique design, fabrication, and assembly features, no lifting attachments could be incorporated within or under the CS modules. This limitation motivated the development of a friction-based lift fixture. The design and evaluation of the CS module lifting fixture considered both worker safety and investment protection, and the assessments were performed to international codes and standards. The CS module lifting fixture consists of two principal subassemblies: spider assembly and ring weldment. These subassemblies allow the frictional force to be augmented by the mechanical advantage of shallow-angle wedges. Large radial preloads created by both screw jack assemblies and the weight of a CS module develop frictional forces capable of performing a lift with a safety factor of at least 2. The design effort resulted in the use of low friction linear bearings on angle surfaces to ensure constant pressure, integrated jacks for pretensioning the fixture prior to lifting, and load pin strain gauges for monitoring the normal force. Testing of various materials and surface treatments led to the selection of laminated aluminum and rubber pads as the friction interface on the CS lifting fixture side and a grit-blasted Nitronic 50 stainless steel band on the CS module side. A redundant lifting method using the module slings between the spider and module is also utilized after the initial friction lift. The CS lifting fixture provides a safe and reliable solution for lifting and stacking the CS module during assembly.

Morris, Eric↗

Quantifying the Impact of Single Bit Flips on Floating Point Arithmetic

In high-end computing, the collective surface area, smaller fabrication sizes, and increasing density of components have led to an increase in the number of observed bit flips. If mechanisms are not in place to detect them, such flips produce silent errors, i.e. the code returns a result that deviates from the desired solution by more than the allowed tolerance and the discrepancy cannot be distinguished from the standard numerical error associated with the algorithm. These phenomena are believed to occur more frequently in DRAM, but logic gates, arithmetic units, and other circuits are also susceptible to bit flips. Previous work has focused on algorithmic techniques for detecting and correcting bit flips in specific data structures, however, they suffer from lack of generality and often times cannot be implemented in heterogeneous computing environment. Our work takes a novel approach to this problem. We focus on quantifying the impact of a single bit flip on specific floating-point operations. We analyze the error induced by flipping specific bits in the most widely used IEEE floating-point representation in an architecture-agnostic manner, i.e., without requiring proprietary information such as bit flip rates and the vendor-specific circuit designs. We initially study dot products of vectors and demonstrate that not all bit flips create a large error and, more importantly, expected value of the relative magnitude of the error is very sensitive on the bit pattern of the binary representation of the exponent, which strongly depends on scaling. Our results are derived analytically and then verified experimentally with Monte Carlo sampling of random vectors. Furthermore, we consider the natural resilience properties of solvers based on the fixed point iteration and we demonstrate how the resilience of the Jacobi method for linear equations can be significantly improved by rescaling the associated matrix.

Elliott, James J.↗

Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations

The linear multifrequency-grey acceleration (LMFGA) technique is used to accelerate the iterative convergence of multigroup thermal radiation diffusion calculations in high energy density simulations. Although it is effective and efficient in one-dimensional calculations, the LMFGA method has recently been observed to significantly degrade under certain conditions in multidimensional calculations with large discontinuities in material properties. To address this deficiency, we recast the LMFGA method in terms of a preconditioned system that is solved with a Krylov method (LMFGK). Results are presented demonstrating that the new LMFGK method always requires fewer iterations than the original LMFGA method. The reduction in iteration count increases with both the size of the time step and the inhomogeneity of the problem. However, for reasons later explained, the LMFGK method can cost more per iteration than the LMFGA method, resulting in lower but comparable efficiency in problems with small time steps and weak inhomogeneities. In problems with large time steps and strong inhomogeneities, the LMFGK method is significantly more efficient than the LMFGA method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

POLARIZED LINE FORMATION IN MULTI-DIMENSIONAL MEDIA. IV. A FOURIER DECOMPOSITION TECHNIQUE TO FORMULATE THE TRANSFER EQUATION WITH ANGLE-DEPENDENT PARTIAL FREQUENCY REDISTRIBUTION

To explain the linear polarization observed in spatially resolved structures in the solar atmosphere, the solution of polarized radiative transfer (RT) equation in multi-dimensional (multi-D) geometries is essential. For strong resonance lines, partial frequency redistribution (PRD) effects also become important. In a series of papers, we have been investigating the nature of Stokes profiles formed in multi-D media including PRD in line scattering. For numerical simplicity, so far we have restricted our attention to the particular case of PRD functions which are averaged over all the incident and scattered directions. In this paper, we formulate the polarized RT equation in multi-D media that takes into account the Hanle effect with angle-dependent PRD functions. We generalize here to the multi-D case the method for Fourier series expansion of angle-dependent PRD functions originally developed for RT in one-dimensional geometry. We show that the Stokes source vector S = (S{sub I} , S{sub Q} , S{sub U} ){sup T} and the Stokes vector I = (I, Q, U){sup T} can be expanded in terms of infinite sets of components S-tilde{sup (k)}, I-tilde{sup (k)}, respectively, k in [0, +{infinity}). We show that the components S-tilde{sup (k)} become independent of the azimuthal angle ({psi}) of the scattered ray, whereas the components I-tilde{sup (k)} remain dependent on {psi} due to the nature of RT in multi-D geometry. We also establish that S-tilde{sup (k)} and I-tilde{sup (k)} satisfy a simple transfer equation, which can be solved by any iterative method such as an approximate Lambda iteration or a Bi-Conjugate Gradient-type projection method provided we truncate the Fourier series to have a finite number of terms.

79 ASTRONOMY AND ASTROPHYSICS↗

Uranium and strontium fate in waste-weathered sediments: Scaling of molecular processes to predict reactive transport

Objectives of the project: 1. Determine the process coupling that occurs between mineral transformation and contaminant (U and Sr) speciation in acid-uranium waste weathered Hanford sediments. 2. Establish linkages between molecular-scale contaminant speciation and meso-scale contaminant lability, release and reactive transport. 3. Make conjunctive use of molecular- to bench-scale data to constrain the development of a mechanistic, reactive transport model that includes coupling of contaminant sorption-desorption and mineral transformation reactions. Hypotheses tested: - Uranium and strontium speciation in legacy sediments from the U-8 and U-12 Crib sites can be reproduced in bench-scale weathering experiments conducted on unimpacted Hanford sediments from the same formations. - Reactive transport modeling of future uranium and strontium releases from the vadose zone of acid-waste weathered sediments can be effectively constrained by combining molecular-scale information on contaminant bonding environment with grain-scale information on contaminant phase partitioning, and meso-scale kinetic data on contaminant release from the waste-weathered porous media. - Although field contamination and laboratory experiments differ in their diagenetic time scales (decades for field vs. months to years for lab), sediment dissolution, neophase nucleation, and crystal growth reactions that occur during the initial disequilibrium induced by waste-sediment interaction leave a strong imprint that persists over subsequent longer-term equilibration time scales and, therefore, give rise to long-term memory effects. Enabling capabilities developed: Our team developed an iterative measure-model approach that is broadly applicable to elucidate the mechanistic underpinnings of reactive contaminant transport in geomedia subject to active weathering. Experimental design: Hypotheses were tested by comparing (with a similar set of techniques) the geochemical transformations and transport behaviors that occured in bench-scale studies of waste-sediment interaction with parallel model systems studies of homogeneous nucleation and neo-phase dissolution. Initial plans were to compare results with core sample extractions from the acid uranium waste impacted U-8 and U-12 Cribs at Hanford (see original proposal and letter of collaboration from J. Zachara). However, this part of the project was impossible because funding for core extractions were eliminated from the DoE budget. Three distinct crib waste aqueous simulants (whose composition is based on the most up-to-date information from field site investigations) were reacted with Hanford sediments in batch and column systems. Coupling of contaminant uptake to mineral weathering was monitored using a suite of methods both during waste-sediment interaction, and after, when waste-weathered sediments were subjected to infusion with circumneutral background pore water solutions. Our research was designed to adapt as needed to maintain a strong dialogue between laboratory and modeling investigations so that model development was increasingly constrained by emergent data and understanding. Potential impact of the project to DOE: Better prediction of contaminant uranium transport was achieved by employing multi-faceted lines of inquiry to build a strong bridge between molecular- and field-scale information. By focusing multiple lines and scales of observation on a common experimental design, our collaborative team revealed non-linear and emergent behavior in contaminated weathering systems. A goal of the current project was to expand our modeling capabilities, originally focused on hyperalkaline legacy waste streams, to include acidic weathering reactions that, as described above, were expected to result in profoundly different products. We were able to achieve this goal, and showed that these products nonetheless undergo analogous silicate and non-silicate transformation, ripening and aging processes. Our prediction that these weathering reactions would vary with waste stimulant chemistry resulted in data that was incorporated directly into a reactive transport model structure.

54 ENVIRONMENTAL SCIENCES↗

The influence of external fields on the energy of two interacting electrons in a quantum dot

In this paper, the effects of both an external electric field and an external magnetic field on the energy of two interacting electrons in a two-dimensional parabolic quantum dot are investigated for various quantum states (n,|m|) in the framework of the asymptotic iteration method. It is seen that the energy eigenvalues increase monotonically with increasing electric and magnetic field strengths in the weak- and strong-field regimes. However, the behavior is slightly different in the two regimes. Whereas the energy values increase linearly in the low-electric-field regime, they increase much more than linearly in the strong-field regime. This paper demonstrates that it is possible to obtain the energy eigenvalues of two electrons in a two-dimensional parabolic quantum dot not only for cases with and without an electric field and with and without a magnetic field, but also for cases where magnetic and electric fields (either strong or weak) are present simultaneously. - Highlights: Black-Right-Pointing-Pointer The energy eigenvalues of two electrons in a 2D quantum dot in external electric and magnetic fields are discussed. Black-Right-Pointing-Pointer The effects of the fields on the energies are obtained for strong and weak fields. Black-Right-Pointing-Pointer The energies increase monotonically with increasing field. Black-Right-Pointing-Pointer The increase in the energies in weak fields has a different behavior from that in strong fields. Black-Right-Pointing-Pointer The method used here is very efficient for discovering the effects of external fields on different states.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT)

Purpose: Station Parameter Optimized Radiation Therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital LINACs, in which the station parameters of a delivery system, (such as aperture shape and weight, couch position/angle, gantry/collimator angle) are optimized altogether. SPORT promises to deliver unprecedented radiation dose distributions efficiently, yet there does not exist any optimization algorithm to implement it. The purpose of this work is to propose an optimization algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: We build a mathematical model whose variables are beam angles (including non-coplanar and/or even nonisocentric beams) and aperture shapes. To solve the resulting large scale optimization problem, we devise an exact, convergent and fast optimization algorithm by integrating three advanced optimization techniques named column generation, gradient method, and pattern search. Column generation is used to find a good set of aperture shapes as an initial solution by adding apertures sequentially. Then we apply the gradient method to iteratively improve the current solution by reshaping the aperture shapes and updating the beam angles toward the gradient. Algorithm continues by pattern search method to explore the part of the search space that cannot be reached by the gradient method. Results: The proposed technique is applied to a series of patient cases and significantly improves the plan quality. In a head-and-neck case, for example, the left parotid gland mean-dose, brainstem max-dose, spinal cord max-dose, and mandible mean-dose are reduced by 10%, 7%, 24% and 12% respectively, compared to the conventional VMAT plan while maintaining the same PTV coverage. Conclusion: Combined use of column generation, gradient search and pattern search algorithms provide an effective way to optimize simultaneously the large collection of station parameters and significantly improves quality of resultant treatment plans as compared with conventional VMAT or IMRT treatments.

07 ISOTOPE AND RADIATION SOURCES↗

SU-G-JeP1-15: Sliding Window Prior Data Assisted Compressed Sensing for MRI Lung Tumor Tracking

Purpose: Prior Data Assisted Compressed Sensing (PDACS) is a partial k-space acquisition and reconstruction method for mobile tumour (i.e. lung) tracking using on-line MRI in radiotherapy. PDACS partially relies on prior data acquired at the beginning of dynamic scans, and is therefore susceptible to artifacts in longer duration scan due to slow drifts in MR signal. A novel sliding window strategy is presented to mitigate this effect. Methods: MRI acceleration is simulated by retrospective removal of data from the fully sampled sets. Six lung cancer patients were scanned (clinical 3T MRI) using a balanced steady state free precession (bSSFP) sequence for 3 minutes at approximately 4 frames per second, for a total of 650 dynamics. PDACS acceleration is achieved by undersampling of k-space in a single pseudo-random pattern. Reconstruction iteratively minimizes the total variations while constraining the images to satisfy both the currently acquired data and the prior data in missing k-space. Our novel sliding window technique (SW-PDACS), uses a series of distinct pseudo-random under-sampling patterns of partial k-space – with the prior data drawn from a sliding window of the most recent data available. Under-sampled data, simulating 2 – 5x acceleration are reconstructed using PDACS and SW-PDACS. Three quantitative metrics: artifact power, centroid error and Dice’s coefficient are computed for comparison. Results: Quantitively metric values from all 6 patients are averaged in 3 bins, each containing approximately one minute of dynamic data. For the first minute bin, PDACS and SW-PDACS give comparable results. Progressive decline in image quality metrics in bins 2 and 3 are observed for PDACS. No decline in image quality is observed for SW-PDACS. Conclusion: The novel approach presented (SW-PDACS) is a more robust for accelerating longer duration (>1 minute) dynamic MRI scans for tracking lung tumour motion using on-line MRI in radiotherapy. B.G. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗

Waves in Plasmas

Quadratic corrections to the metaplectic formulation of mode conversions. In this work we showed how to systematically deal with quadratic corrections beyond the usual linearization of the dispersion matrix at a conversion. The linearization leads to parabolic cylinder functions as the local approximation to the full-wave behavior, but these do not include the variation in amplitude associated with ray refraction in the neighborhood of the conversion. Hence, the region over which they give a good fit to the incoming and outgoing WKB solutions is small. By including higher order corrections it is possible to provide a much more robust matching. We also showed that it was possible, in principle, to extend these methods to arbitrary order. A new normal form for mode conversion. This is based upon our earlier NSF-DOE-funded work on ray helicity. We have begun efforts to apply these new ideas in practical ray tracing algorithms. Group theoretical foundation of path integrals and phase space representations of wave problems. Using the symbol theory of N. Zobin, we developed a new understanding of path integrals on phase space. The initial goal was to find practical computational tools for dealing with non-standard mode conversions. Along the way we uncovered a new way to represent wave functions directly on phase space without the intermediary of a Wigner function. We are exploring the use of these ideas for numerical studies of conversion, with the goal of eventually incorporating kinetic effects. Wave packet studies of gyroresonance crossing. In earlier work, Huanchun Ye and Allan Kaufman -- building upon ideas due to Lazar Friedland -- had shown that gyroresonance crossings could be treated as a double conversion. This perspective is one we have used for many of our papers since then. We are now performing a detailed numerical comparison between full-wave and ray tracing approaches in the study of minority-ion gyroresonance crossing. In this study, a fast magnetosonic wave -- supported by a majority-ion species such as deuterium -- crosses the resonance layer associated with a minority species, such as hydrogen. By using wave packets instead of harmonic solutions, it becomes easy to see the evolution in k-space of the minority-ion disturbance, and the time delay for emission of the reflected fast-wave packet. Iterated conversion in a cavity. When mode conversion occurs in a cavity where rays are trapped, multiple conversions will occur and the resulting absorption profile will typically have a complicated spatial dependence due to overlapping interference patterns. The goal of this work is to develop fast and efficient ray-based methods for computing the cavity response to external driving, and to compute the spatial absorption profile. We have introduced a new approach that allows us to visualize in great detail the underlying iterated ray geometry, and should lead to simpler methods for identifying parameter values where global changes occur in the qualitative response (e.g. global bifurcations).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Group Structure Optimization Using the PyGroup Code

Group constants are used as coefficients in the energy domain discretized Linear Boltzmann Equation (LBE), in which the Continuous-Energy (CE) fluxes are also integrated over energy bins and transformed into group fluxes. This procedure, based on the Multi-Group (MG) theory, is widely applied in radiation transport and diffusion simulations Careful preparation of MG cross section data, or group constants, is thus a prerequisite for success in acquiring high-fidelity LBE solutions. Generation of MG cross section data itself is a complicated multi-step task, since group constants are indispensably coupled with the solution of the LBE, i.e. the flux spectrum in the problem to be solved. Theoretically, a MG cross section library is only valid for the problem that it is built upon. Nevertheless, in practice MG cross section libraries are prepared for similar type of problems, such as thermal reactors, fast reactors, etc., to facilitate the neutronic simulations. Generally, CE point-wise cross section data set, generated by both theoretical models and experimental data, is first converted to Fine-Group (FG) libraries using a pre-defined or precalculated flux spectra, then, Broad-Group (BG) libraries are collapsed from the fine-group libraries using problem-dependent flux spectra. Proper treatments of energy and spatial self-shielding and resonance cross section are required in the CE-to-MG converting process Previously, we have developed a computer code, YGROUP, for fine-to-broad group cross section collapsing. To maintain high accuracy of the resulting BG libraries, YGROUP provides users several options on collapsing strategies and weighting schemes for group binning and evaluation of BG cross section data in users' specific problems.. An approach based on Particle Swarm Optimization was applied to automatically determine the optimal group structure. We also developed a hybrid weighting scheme to further improve BG library performance for Special Nuclear Materials (SNM) detection applications. In this work, a new computer code, PyGroup, has been developed to implement the PSO approach with an improved simulation-driven fitness function design that includes both response and forward/adjoint flux errors. Together with YGROUP, and deterministic transport code TITAN/PENMSHXP, the PyGroup code package is tested on a Dual Range Coincident Counter (DRCC) model. In this paper, we demonstrated the capability of the PyGroup code for group structure optimization using the DRCC detector model. In the future, an iteration scheme can be implemented to determine the number of broad groups based on a user-defined tolerance. we will also apply PyGroup to more complicated reactor models, and investigate physics-based fitness function designs to further reduce computational cost. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Treatment planning for volumetric modulated arc therapy

Purpose: Volumetric modulated arc therapy (VMAT) is a specific type of intensity-modulated radiation therapy (IMRT) in which the gantry speed, multileaf collimator (MLC) leaf position, and dose rate vary continuously during delivery. A treatment planning system for VMAT is presented. Methods: Arc control points are created uniformly throughout one or more arcs. An iterative least-squares algorithm is used to generate a fluence profile at every control point. The control points are then grouped and all of the control points in a given group are used to approximate the fluence profiles. A direct-aperture optimization is then used to improve the solution, taking into account the allowed range of leaf motion of the MLC. Dose is calculated using a fast convolution algorithm and the motion between control points is approximated by 100 interpolated dose calculation points. The method has been applied to five cases, consisting of lung, rectum, prostate and seminal vesicles, prostate and pelvic lymph nodes, and head and neck. The resulting plans have been compared with segmental (step-and-shoot) IMRT and delivered and verified on an Elekta Synergy to ensure practicality. Results: For the lung, prostate and seminal vesicles, and rectum cases, VMAT provides a plan of similar quality to segmental IMRT but with faster delivery by up to a factor of 4. For the prostate and pelvic nodes and head-and-neck cases, the critical structure doses are reduced with VMAT, both of these cases having a longer delivery time than IMRT. The plans in general verify successfully, although the agreement between planned and measured doses is not very close for the more complex cases, particularly the head-and-neck case. Conclusions: Depending upon the emphasis in the treatment planning, VMAT provides treatment plans which are higher in quality and/or faster to deliver than IMRT. The scheme described has been successfully introduced into clinical use.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

IDAES-PSE 2.6.0 Release

The Institute for the Design of Advanced Energy Systems (IDAES) Integrated Platform is a versatile computational environment offering extensive process systems engineering (PSE) capabilities for optimizing the design and operation of complex, interacting technologies and systems. IDAES enables users to efficiently search vast, complex design spaces to discover the lowest cost solutions while supporting the full process modeling lifecycle, from conceptual design to dynamic optimization and control. The extensible, open platform empowers users to create models of novel processes and rapidly develop custom analyses, workflows, and end-user applications. IDAES-PSE 2.6.0 Release Highlights Upcoming Changes IDAES will be switching to the new Pyomo solver interface in the next release. Whilst this will hopefully be a smooth transition for most users, there are a few important changes to be aware of. The new solver interface uses a different version of the IPOPT writer (“ipopt_v2”) and thus any custom configuration options you might have set for IPOPT will not carry over and will need to be reset. By default, the new Pyomo linear presolver will be activated with ipopt_v2. Whilst are working to identify any bugs in the presolver, it is possible that some edge cases will remain. IDAES will begin deploying a new set of scaling tools and APIs over the next few releases that make use of the new solver writers. The old scaling tools and APIs will remain for backward compatibility but will begin to be deprecated. New Models, Tools and Features New Intersphinx extension automatically linking Jupyter notebook examples to project documentation New end-to-end diagnostics example demonstrated on a real problem New complementarity formulation for VLE with cubic equations of state, backward compatibility for old formulation New solver interface with presolve (ipopt_v2) in support of upcoming changes to the initialization and APIs methods, with default set to ipopt to maintain backwards compatibility; this will deprecate once all examples have been updated New forecaster and parameterized bidder methods within grid integration library Updated surrogates API and examples to support Keras 3, with backwards compatibility for older formats such as TensorFlow SavedModel (TFSM) Updated costing base dictionary to include the 2023 cost year index value Updated ProcessBlock to include information on the constructing block class Updated Flowsheet Visualizer to allow visualize() method to return value and functions Bug Fixes Fixed bug in the Modular Property Framework that would cause errors when trying to use phase-based material balances with phase equilibria. Fixed bug in Modular Properties Framework that caused errors when initializing models with non-vapor-liquid phase equilibria. Fixed typos flagged by June update to crate-ci/typos and removed DMF-related exceptions Minor corrections of units of measurement handling in power plant waste/transport costing expressions, control volume material holdup expressions, and BTX property package parameters Fixed throwing >7500 numpy deprecation warnings by replacing scalar value assignment with element extraction and item iteration calls Testing and Robustness Migrated slow tests (>10s) to integration, impacting test coverage but also yielding a nearly 30% decrease in local test runtime Pinned pint to avoid issues with older supported Python versions Pinned codecov versions to avoid tokenless upload behavior with latest version Bumped extensions to version 3.4.2 to allow pointing to non-standard install location Deprecations and Removals Python 3.8 is no longer supported. The supported Python versions are 3.9 through 3.12 The Data Management Framework (DMF) is no longer supported. Importing idaes.core.dmf will cause a deprecation warning to be displayed until the next release The SOFC Keras surrogates have been removed. The current version of the SOFC surrogate model in the examples repository is a PySMO Kriging model.

AS↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

A comprehensive formulation for volumetric modulated arc therapy planning

Purpose: Volumetric modulated arc therapy (VMAT) is a widely employed radiation therapy technique, showing comparable dosimetry to static beam intensity modulated radiation therapy (IMRT) with reduced monitor units and treatment time. However, the current VMAT optimization has various greedy heuristics employed for an empirical solution, which jeopardizes plan consistency and quality. The authors introduce a novel direct aperture optimization method for VMAT to overcome these limitations. Methods: The comprehensive VMAT (comVMAT) planning was formulated as an optimization problem with an L2-norm fidelity term to penalize the difference between the optimized dose and the prescribed dose, as well as an anisotropic total variation term to promote piecewise continuity in the fluence maps, preparing it for direct aperture optimization. A level set function was used to describe the aperture shapes and the difference between aperture shapes at adjacent angles was penalized to control MLC motion range. A proximal-class optimization solver was adopted to solve the large scale optimization problem, and an alternating optimization strategy was implemented to solve the fluence intensity and aperture shapes simultaneously. Single arc comVMAT plans, utilizing 180 beams with 2° angular resolution, were generated for a glioblastoma multiforme case, a lung (LNG) case, and two head and neck cases—one with three PTVs (H&N{sub 3PTV}) and one with foue PTVs (H&N{sub 4PTV})—to test the efficacy. The plans were optimized using an alternating optimization strategy. The plans were compared against the clinical VMAT (clnVMAT) plans utilizing two overlapping coplanar arcs for treatment. Results: The optimization of the comVMAT plans had converged within 600 iterations of the block minimization algorithm. comVMAT plans were able to consistently reduce the dose to all organs-at-risk (OARs) as compared to the clnVMAT plans. On average, comVMAT plans reduced the max and mean OAR dose by 6.59% and 7.45%, respectively, of the prescription dose. Reductions in max dose and mean dose were as high as 14.5 Gy in the LNG case and 15.3 Gy in the H&N{sub 3PTV} case. PTV coverages measured by D95, D98, and D99 were within 0.25% of the prescription dose. By comprehensively optimizing all beams, the comVMAT optimizer gained the freedom to allow some selected beams to deliver higher intensities, yielding a dose distribution that resembles a static beam IMRT plan with beam orientation optimization. Conclusions: The novel nongreedy VMAT approach simultaneously optimizes all beams in an arc and then directly generates deliverable apertures. The single arc VMAT approach thus fully utilizes the digital Linac’s capability in dose rate and gantry rotation speed modulation. In practice, the new single VMAT algorithm generates plans superior to existing VMAT algorithms utilizing two arcs.

60 APPLIED LIFE SCIENCES↗

Innovative Divertor Development to Solve the Plasma Heat-Flux Problem

Large, localized plasma heat exhaust continues to be one of the critical problems for the development of tokamak fusion reactors. Excessive heat flux erodes and possibly melts plasma-facing materials, thereby dramatically shortening their lifetime and increasing the impurity contamination of the core plasma. A detailed assessment by the ITER team for their divertor has revealed substantial limitations on the operational space imposed by the divertor performance. For a fusion reactor, the problem becomes worse in that the divertor must accommodate 20% of the total fusion power (less any broadly radiated loss), while not allowing excess buildup of tritium in the walls nor excessive impurity production. This is an extremely challenging set of problems that must be solved for fusion to succeed as a power source; it deserves a substantial research investment. Material heat-flux constraints: Results from present-day tokamaks show that there are two major limitations of peak plasma heat exhaust. The first is the continuous flow of power to the divertor plates and nearby surfaces that, for present technology, is limited to 10-20 MW/m{sup 2}. The second is the transient peak heat-flux that can be tolerated in a short time, {tau}{sub m}, before substantial ablation and melting of the surface occurs; such common large transient events are Edge Localized Mode (ELMs) and disruptions. The material limits imposed by these events give a peak energy/{tau}{sub m}{sup 1/2} parameter of {approx} 40 MJ/m{sup 2}s{sup 1/2} [1]. Both the continuous and transient limits can be approached by input powers in the largest present-day devices, and future devices are expected to substantially exceed the limits unless a solution can be found. Since the early 90's LLNL has developed the analytic and computational foundation for analyzing divertor plasmas, and also suggested and studied a number of solid and liquid material concepts for improving divertor/wall performance, with the most recent being the Snowflake divertor concept [2] and generating Resonant Magnetic Perturbations by the SOL currents [3]. However, the specific approaches discussed here are part of a wider class of innovative divertor ideas that have come from the community in the last several years, and we certainly advocate the need to consider a range of options. Indeed, the most effective solution to the heat-flux problem may well contain features of various ideas. For example, there are the X-divertor (Kotschenreuther et al. [4]) that expands the magnetic flux surface in the vicinity of the near-X-point divertor plate, and the super X-divertor (Valanju et al. [5]) that guides the near-separatrix SOL flux tubes to a larger major radius to increase the surface area available for power deposition. These approaches have the common feature of manipulation of the edge magnetic geometry. Another approach is the use of liquid divertor surfaces that can increase the heat-flux capability by flowing the heated material to a cooling region and eventually out of the machine, and/or by being able to withstand a higher peak heat flux [6]. All of these areas are only emerging concepts that require substantially more analysis and definitive experimental tests, and given the need for a large improvement in this area, we advocate a substantial program to systematically assess the approaches. Because of space limitation here, we present some details of one of the concepts, namely the Snowflake divertor configuration. The Snowflake (SF) divertor [2] exploits a tokamak geometry in which the poloidal magnetic field varies quadratically with distance from the X-point null, {Delta}r. The name stems from the characteristic hexagonal, snowflake-like, shape of the multi-branched separatrix for this exact second-order null. In contrast, the standard X-point configuration has a poloidal field varying linearly with ?r. The different variations mean that a flux expansion is much larger in the vicinity of a null of a snowflake divertor, and one can try to exploit this fact for reducing the divertor heat load. A unique feature here is also that the shear in the magnetic field near the X-point is substantially larger for the SF configuration, which may favorably affect microinstabilities and ELMs. Practical realization appears straightforward; the SF can be obtained using existing poloidal field coils in various present-day devices, and in general can be produced with coils located well outside the vacuum vessel. The SF configuration increases the flux expansion near the X-point that can be exploited by some increase in the plate wetted area, longer field-line length, and larger volume for impurity radiation. Initial UEDGE simulations comparing the SF with the standard divertor for the same conditions show a reduction in the peak heat flux for the SF of {approx}1.2-1.6 when comparing cases for the same angle of the total magnetic field to the divertor plate [7].

29 ENERGY PLANNING, POLICY, AND ECONOMY↗