Search NASA⌕ Search

SEARCH · Search NASA

Results for “Outer approximation algorithms”

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.

34 records · Page 2

Transonic Navier-Stokes wing solution using a zonal approach. Part 1: Solution methodology and code validation

A fast diagonalized Beam-Warming algorithm is coupled with a zonal approach to solve the three dimensional Euler/Navier-Stokes equations. The computer code, called Transonic Navier-Stokes (TNS), uses a total of four zones for wing configurations (or can be extended to complete aircraft configurations by adding zones). In the inner blocks near the wing surface, the thin-layer Navier-Stokes equations are solved, while in the outer two blocks the Euler equations are solved. The diagonal algorithm yields a speedup of as much as a factor of 40 over the original algorithm/zonal method code. The TNS code, in addition, has the capability to model wind tunnel walls. Transonic viscous solutions are obtained on a 150,000-point mesh for a NACA 0012 wing. A three-order-of-magnitude drop in the L2-norm of the residual requires approximately 500 iterations, which takes about 45 min of CPU time on a Cray-XMP processor. Simulations are also conducted for a different geometrical wing called WING C. All cases show good agreement with experimental data.

Flores, J.↗

Multiphysics Time-Integration for Turbulent Combustion at the Exascale

Turbulent reacting flow systems are often modeled with coupled time-dependent partial differential equations (PDEs). Solving such equations can easily tax the world's largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This generic operator-splitting strategy leads to a set of ordinary differential equations (ODEs) that need to be solved as part of an "outer-loop" time-stepping approach. In many combustion applications, the ODEs to be solved can be very stiff, exhibiting timescales that span many orders of magnitude. The SUNDIALS library provides a plethora of robust time integration algorithms for solving these ODEs on exascale-capable computing hardware, yet for many complex applications (such multicomponent fuels or emissions predictions), the chemical models remain too complex to solve using reasonable resources. The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of the simulations. In this talk, I will discuss the use of the SUDIALS library of ODE solvers together with automatic code generation tools to solve complex turbulent reacting flow problems using QSSA models.

chemistry↗

Mixed Integer Nonlinear Programming Approaches to Enhance Resiliency and Response Strategies in Critical Infrastructure

Motivation. Critical infrastructures are large, complex engineered systems that must be operated robustly under abnormal conditions resulting from natural hazards or intentional acts. For example, electric power systems must be robust to line faults, water utilities must rapidly mitigate contamination incidents, and computing networks must adapt to adversarial intrusions to protect critical information. Problem. It is difficult for decision-makers within resiliency analysis in critical infrastructure to optimize designs and develop effective response strategies that can account for uncertainties. Facing incomplete information and the sheer scope that a natural hazard or attack vector may incorporate, response can be ineffective without reliable, scalable decision support tools. These problems are intrinsically nonlinear and involve discrete decisions, and unfortunately, existing off-the-shelf mathematical programming methods cannot support optimization-based decision-making of these nonlinear at scale. Method/Approach and Results. This project emphasized development of fundamental optimization strategies that supported real- time mitigation and response for critical infrastructures. In particular, the project developed multi- tree approaches based on piecewise outer-approximations for solution of mixed-integer nonlinear programming (MINLP) problems. These techniques alternate between an MILP or MISOCP relaxation to obtain a lower bound and candidate discrete solutions and an NLP subproblem to obtain upper bounds. Using tailored relaxations based on problem structure, these methods were used to solve several key applications in resilience and response of critical infrastructure. This work resulted in two open-source, copyrighted software packages: CORAMIN (https://github.com/Coramin/Coramin) -- an object-oriented mathematical programming framework that supports tailored multi-tree algorithms for solution of large- scale mixed-integer nonlinear programming; and EGRET (Electrical Grid Research and Engineering Toolkit) (https://github.com/grid- parity-exchange/Egret) -- a declarative mathematical programming framework built upon CORAMIN and Pyomo for formulation and solution of resilience and operations problems in power grid systems. Furthermore, these tools resulted in several important published results, including the following: The first known global optimization approach that could solve the unit-commitment problem with nonlinear power flow constraints on medium-sized test problems; Improved parallel optimization-based bounds tightening and strengthening of relaxations of AC power flow constraints; and, Optimization-based approaches for improved grid resilience and use of demand response to improve grid resilience with reduction in capital requirements. Result Implications. This project developed first-of-a-kind algorithms for decision-making in critical infrastructure resilience operations and planning, as well as a next-generation toolkit for MINLP researchers. These approaches leveraged high-performance computing architectures to solve some of the largest, most challenging nonlinear discrete optimization problems to global optimality, and these successes were captured in open-source software to enable optimization-based decision-making, and efficient solution of MINLP formulations for electric power transmission grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Streamlining algorithms for complete adaptation

For purposes of the adaptive-wall algorithms to be described, the modern era is considered to have begun with the simultaneous, independent recognition of the concept of matching an experimental inner flow across an interface to a computed outer flow by Chevallier, Ferri, Goodyer, Lissaman, Rubbert, and Sears. Fundamental investigations of the adaptive-wall matching concept by means of numerical simulations and theoretical considerations are described. An overview of the development and operation of 2D adaptive-wall facilities from about 1970 until the present is given, followed by similar material for 3D adaptive-wall facilities from approximately 1978 until the present. A general formulation of adaptation strategy is presented, with a theoretical basis for adaptation followed by 2D flexible, impermeable-wall applications; 2D ventilated-wall applications; 3D flexible, impermeable-wall applications; and 3D ventilated-wall applications. Representative experimental and 3D results are given, with 2D, followed by a discussion of limitations and open questions.

Erickson, J. C., Jr.↗

Algorithm Plans Collision-Free Path for Robotic Manipulator

An algorithm has been developed to enable a computer aboard a robot to autonomously plan the path of the manipulator arm of the robot to avoid collisions between the arm and any obstacle, which could be another part of the robot or an external object in the vicinity of the robot. In simplified terms, the algorithm generates trial path segments and tests each segment for potential collisions in an iterative process that ends when a sequence of collision-free segments reaches from the starting point to the destination. The main advantage of this algorithm, relative to prior such algorithms, is computational efficiency: the algorithm is designed to make minimal demands upon the limited computational resources available aboard a robot. This path-planning algorithm utilizes a modified version of the collision-detection method described in "Improved Collision-Detection Method for Robotic Manipulator" (NPO-30356), NASA Tech Briefs, Vol. 27, No. 3 (June 2003), page 72. The method involves utilization of mathematical models of the robot constructed prior to operation and similar models of external objects constructed automatically from sensory data acquired during operation. This method incorporates a previously developed method, known in the art as the method of oriented bounding boxes (OBBs), in which an object is represented approximately, for computational purposes, by a box that encloses its outer boundary. Because many parts of a robotic manipulator are cylindrical, the OBB method has been extended in this method to enable the approximate representation of cylindrical parts by use of octagonal or other multiple-OBB assemblies denoted oriented bounding prisms (OBPs). A multiresolution OBB/OBP representation of the robot and its manipulator arm and a multiresolution OBB representation of external objects (including terrain) are constructed and used in a process in which collisions at successively finer resolutions are detected through computational detection of overlaps between the corresponding OBB and OBP models. For computational efficiency, the process is started at the coarsest resolution and stopped as soon as possible, preferably before reaching the finest resolution. At the coarsest resolution, there is a single OBB enclosing all relevant external objects and a single OBB enclosing the entire robot. At the next finer level of resolution, the coarsest-resolution OBB is divided into two OBBs, and so forth. If no collision is detected at the coarsest resolution, then there is no need for further computation to detect collisions. If a collision is detected at the coarsest resolution, then tests for collisions are performed at the next finer level of resolution. This process is continued to successively finer resolutions until either no more collisions are detected or the finest resolution is reached.

Backes, Paul↗

Optimizations of a Hardware Decoder for Deep-Space Optical Communications

The National Aeronautics and Space Administration has developed a capacity approaching modulation and coding scheme that comprises a serial concatenation of an inner accumulate pulse-position modulation (PPM) and an outer convolutional code [or serially concatenated PPM (SCPPM)] for deep-space optical communications. Decoding of this code uses the turbo principle. However, due to the nonbinary property of SCPPM, a straightforward application of classical turbo decoding is very inefficient. Here, we present various optimizations applicable in hardware implementation of the SCPPM decoder. More specifically, we feature a Super Gamma computation to efficiently handle parallel trellis edges, a pipeline-friendly 'maxstar top-2' circuit that reduces the max-only approximation penalty, a low-latency cyclic redundancy check circuit for window-based decoders, and a high-speed algorithmic polynomial interleaver that leads to memory savings. Using the featured optimizations, we implement a 6.72 megabits-per-second (Mbps) SCPPM decoder on a single field-programmable gate array (FPGA). Compared to the current data rate of 256 kilobits per second from Mars, the SCPPM coded scheme represents a throughput increase of more than twenty-six fold. Extension to a 50-Mbps decoder on a board with multiple FPGAs follows naturally. We show through hardware simulations that the SCPPM coded system can operate within 1 dB of the Shannon capacity at nominal operating conditions.

quadratic polynomial interleaver↗

Insights into the origin of halo mass profiles from machine learning

ABSTRACT The mass distribution of dark matter haloes is the result of the hierarchical growth of initial density perturbations through mass accretion and mergers. We use an interpretable machine-learning framework to provide physical insights into the origin of the spherically-averaged mass profile of dark matter haloes. We train a gradient-boosted-trees algorithm to predict the final mass profiles of cluster-sized haloes, and measure the importance of the different inputs provided to the algorithm. We find two primary scales in the initial conditions (ICs) that impact the final mass profile: the density at approximately the scale of the haloes’ Lagrangian patch RL ($R\sim 0.7\, R_L$) and that in the large-scale environment (R ∼ 1.7 RL). The model also identifies three primary time-scales in the halo assembly history that affect the final profile: (i) the formation time of the virialized, collapsed material inside the halo, (ii) the dynamical time, which captures the dynamically unrelaxed, infalling component of the halo over its first orbit, (iii) a third, most recent time-scale, which captures the impact on the outer profile of recent massive merger events. While the inner profile retains memory of the ICs, this information alone is insufficient to yield accurate predictions for the outer profile. As we add information about the haloes’ mass accretion history, we find a significant improvement in the predicted profiles at all radii. Our machine-learning framework provides novel insights into the role of the ICs and the mass assembly history in determining the final mass profile of cluster-sized haloes.

79 ASTRONOMY AND ASTROPHYSICS↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗

Multidisciplinary Optimization of Tilt Rotor Blades Using Comprehensive Composite Modeling Technique

An optimization procedure is developed for addressing the design of composite tilt rotor blades. A comprehensive technique, based on a higher-order laminate theory, is developed for the analysis of the thick composite load-carrying sections, modeled as box beams, in the blade. The theory, which is based on a refined displacement field, is a three-dimensional model which approximates the elasticity solution so that the beam cross-sectional properties are not reduced to one-dimensional beam parameters. Both inplane and out-of-plane warping are included automatically in the formulation. The model can accurately capture the transverse shear stresses through the thickness of each wall while satisfying stress free boundary conditions on the inner and outer surfaces of the beam. The aerodynamic loads on the blade are calculated using the classical blade element momentum theory. Analytical expressions for the lift and drag are obtained based on the blade planform with corrections for the high lift capability of rotor blades. The aerodynamic analysis is coupled with the structural model to formulate the complete coupled equations of motion for aeroelastic analyses. Finally, a multidisciplinary optimization procedure is developed to improve the aerodynamic, structural and aeroelastic performance of the tilt rotor aircraft. The objective functions include the figure of merit in hover and the high speed cruise propulsive efficiency. Structural, aerodynamic and aeroelastic stability criteria are imposed as constraints on the problem. The Kreisselmeier-Steinhauser function is used to formulate the multiobjective function problem. The search direction is determined by the Broyden-Fletcher-Goldfarb-Shanno algorithm. The optimum results are compared with the baseline values and show significant improvements in the overall performance of the tilt rotor blade.

Chattopadhyay, Aditi↗

Enhanced decoding for the Galileo S-band mission

A coding system under consideration for the Galileo S-band low-gain antenna mission is a concatenated system using a variable redundancy Reed-Solomon outer code and a (14,1/4) convolutional inner code. The 8-bit Reed-Solomon symbols are interleaved to depth 8, and the eight 255-symbol codewords in each interleaved block have redundancies 64, 20, 20, 20, 64, 20, 20, and 20, respectively (or equivalently, the codewords have 191, 235, 235, 235, 191, 235, 235, and 235 8-bit information symbols, respectively). This concatenated code is to be decoded by an enhanced decoder that utilizes a maximum likelihood (Viterbi) convolutional decoder; a Reed Solomon decoder capable of processing erasures; an algorithm for declaring erasures in undecoded codewords based on known erroneous symbols in neighboring decodable words; a second Viterbi decoding operation (redecoding) constrained to follow only paths consistent with the known symbols from previously decodable Reed-Solomon codewords; and a second Reed-Solomon decoding operation using the output from the Viterbi redecoder and additional erasure declarations to the extent possible. It is estimated that this code and decoder can achieve a decoded bit error rate of 1 x 10(exp 7) at a concatenated code signal-to-noise ratio of 0.76 dB. By comparison, a threshold of 1.17 dB is required for a baseline coding system consisting of the same (14,1/4) convolutional code, a (255,223) Reed-Solomon code with constant redundancy 32 also interleaved to depth 8, a one-pass Viterbi decoder, and a Reed Solomon decoder incapable of declaring or utilizing erasures. The relative gain of the enhanced system is thus 0.41 dB. It is predicted from analysis based on an assumption of infinite interleaving that the coding gain could be further improved by approximately 0.2 dB if four stages of Viterbi decoding and four levels of Reed-Solomon redundancy are permitted. Confirmation of this effect and specification of the optimum four-level redundancy profile for depth-8 interleaving is currently being done.

Dolinar, S.↗

The SMAP Level 4 Surface and Root-zone Soil Moisture (L4_SM) Product

The Soil Moisture Active and Passive (SMAP) mission is being developed by NASA for launch in 2013 as one of four first-tier missions recommended by the U.S. National Research Council Committee on Earth Science and Applications from Space in 2007. The primary science objectives of SMAP are to enhance understanding of land surface controls on the water, energy and carbon cycles, and to determine their linkages. Moreover, the high resolution soil moisture mapping provided by SMAP has practical applications in weather and seasonal climate prediction, agriculture, human health, drought and flood decision support. In this paper we describe the assimilation of SMAP observations for the generation of the planned SMAP Level 4 Surface and Root-zone Soil Moisture (L4_SM) product. The SMAP mission makes simultaneous active (radar) and passive (radiometer) measurements in the 1.26-1.43 GHz range (L-band) from a sun-synchronous low-earth orbit. Measurements will be obtained across a 1000 km wide swath using conical scanning at a constant incidence angle (40 deg). The radar resolution varies from 1-3 km over the outer 70% of the swath to about 30 km near the center of the swath. The radiometer resolution is 40 km across the entire swath. The radiometer measurements will allow high-accuracy but coarse resolution (40 km) measurements. The radar measurements will add significantly higher resolution information. The radar is however very sensitive to surface roughness and vegetation structure. The combination of the two measurements allows optimal blending of the advantages of each instrument. SMAP directly observes only surface soil moisture (in the top 5 cm of the soil column). Several of the key applications targeted by SMAP, however, require knowledge of root zone soil moisture (approximately top 1 m of the soil column), which is not directly measured by SMAP. The foremost objective of the SMAP L4_SM product is to fill this gap and provide estimates of root zone soil moisture that are informed by and consistent with SMAP observations. Such estimates are obtained by merging SMAP observations with estimates from a land surface model in a soil moisture data assimilation system. The land surface model component of the assimilation system is driven with observations-based surface meteorological forcing data, including precipitation, which is the most important driver for soil moisture. The model also encapsulates knowledge of key land surface processes, including the vertical transfer of soil moisture between the surface and root zone reservoirs. Finally, the model interpolates and extrapolates SMAP observations in time and in space. The L4_SM product thus provides a comprehensive and consistent picture of land surface hydrological conditions based on SMAP observations and complementary information from a variety of sources. The assimilation algorithm considers the respective uncertainties of each component and yields a product that is superior to satellite or model data alone. Error estimates for the L4_SM product are generated as a by-product of the data assimilation system.

Reichle, Rolf↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

New Global Electron Density Observations from GPS-RO in the D- and E-Region Ionosphere

A novel retrieval technique is developed for electron density (N(sub e)) in the D- and E-region (80-120 km) using the high-quality 50-Hz GPS radio occultation (GPS-RO) phase measurements. The new algorithm assumes a slow, linear variation in the F-region background when the GPS-RO passes through the D- and E-region, and extracts the N(sub e) profiles at 80-130 km from the phase advance signal caused by N(sub e). Unlike the conventional Abel function, the new approach produces a sharp N(sub e) weighting function in the lower ionosphere, and the N(sub e) retrievals are in good agreement with the IRI (International Reference Ionosphere) model in terms of monthly maps, zonal means and diurnal variations. The daytime GPS-RO N(sub e) profiles can be well characterized by the alpha-Chapman function of three parameters (N(sub mE), h(sub mE) and H), showing that the bottom of E-region is deepening and sharpening towards the summer pole. At high latitudes the monthly GPS-RO N(sub e) maps at 80-120 km reveal clear enhancement in the auroral zones, more prominent at night, as a result of energetic electron precipitation (EEP) from the outer radiation belt. The D-/E-region auroral N(sub e) is strongly correlated with K(sub p) on a daily basis. The new N(sub e) data allow further comprehensive analyses of the sporadic E (E(sub s)) phenomena in connection with the background N(sub e) in the E-region. The layered (2-10 km) and fluctuated (less than 2 km) E(sub s) components, namely N(sub e_Layer) than N(sub e_Pert), are extracted with respect to the background N( sub e_Region) on a profile-by-profile basis. The N(sub e_Layer) component has a strong but highly-refined peak at approximately 105 km, with an amplitude smaller than N(sub e_Region) approximately by an order of magnitude. The N(sub e_Pert) component, which was studied extensively in the past, is approximately 2 orders of magnitude weaker than N(sub e_Layer). Both N(sub e_Layer) and N(sub e_Pert) are subject to significant diurnal and semidiurnal variations, showing downward progression with local time in amplitude. The 11-year solar cycle dominates the N(sub e) interannual variations, showing larger N(sub e_Region) and N(sub e_Layer) but smaller N(sub e_Pert) amplitudes in the solar maximum years. Enhanced Ne profiles are often observed in the polar winter, showing good correlation with solar proton events (SPEs) and geomagnetic activity. The new methodology offers great potential for retrieving low N(sub e) in the D-region, where radio propagation and communication blackouts can occur due to enhanced ionization. For space weather applications it is recommended for GPSRO operations to raise the top of high-rate data acquisition to approximately 140 km in the future.

GSP-R↗

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A 3D High-Order Unstructured Finite-Volume Algorithm for Solving Maxwell's Equations

A three-dimensional finite-volume algorithm based on arbitrary basis functions for time-dependent problems on general unstructured grids is developed. The method is applied to the time-domain Maxwell equations. Discrete unknowns are volume integrals or cell averages of the electric and magnetic field variables. Spatial terms are converted to surface integrals using the Gauss curl theorem. Polynomial basis functions are introduced in constructing local representations of the fields and evaluating the volume and surface integrals. Electric and magnetic fields are approximated by linear combinations of these basis functions. Unlike other unstructured formulations used in Computational Fluid Dynamics, the new formulation actually does not reconstruct the field variables at each time step. Instead, the spatial terms are calculated in terms of unknowns by precomputing weights at the beginning of the computation as functions of cell geometry and basis functions to retain efficiency. Since no assumption is made for cell geometry, this new formulation is suitable for arbitrarily defined grids, either smooth or unsmooth. However, to facilitate the volume and surface integrations, arbitrary polyhedral cells with polygonal faces are used in constructing grids. Both centered and upwind schemes are formulated. It is shown that conventional schemes (second order in Cartesian grids) are equivalent to the new schemes using first degree polynomials as the basis functions and the midpoint quadrature for the integrations. In the new formulation, higher orders of accuracy are achieved by using higher degree polynomial basis functions. Furthermore, all the surface and volume integrations are carried out exactly. Several model electromagnetic scattering problems are calculated and compared with analytical solutions. Examples are given for cases based on 0th to 3rd degree polynomial basis functions. In all calculations, a centered scheme is applied in the interior, while an upwind matching scheme is employed at material interfaces and the Engquist-Majda non-reflecting boundary condition is implemented at the numerical outer boundaries. The staggered leapfrog scheme and the Runge-Kutta methods are utilized for the time integration. Excellent agreements are found between the numerical and analytical solutions.

Liu, Yen↗