Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Algebra”

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,009 records · Page 56

Demonstration and performance testing of extreme-resolution simulations with static meshes on Summit (CPU & GPU) for a parked-turbine configuration and an actuator-line (mid-fidelity model) wind farm configuration (ECP-Q4 FY2020 Milestone Report)

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind simulation environment are Nalu-Wind, an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, AMR-Wind, a block-structured-grid solver with adaptive mesh refinement capabilities, and OpenFAST, a wind-turbine structural dynamics solver. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and Helmholtz-type equations for transport of momentum and other scalars. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. The choice of overset-mesh methodology to model the moving and non-moving parts of the computational domain introduces constraint equations in the elliptic pressure-Poisson solver. The presence of constraints greatly affects the performance of algebraic multigrid preconditioners.

17 WIND ENERGY↗

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗

Effects of refractive index mismatch in optical CT imaging of polymer gel dosimeters

Purpose: Proposing an image reconstruction technique, algebraic reconstruction technique-refraction correction (ART-rc). The proposed method takes care of refractive index mismatches present in gel dosimeter scanner at the boundary, and also corrects for the interior ray refraction. Polymer gel dosimeters with high dose regions have higher refractive index and optical density compared to the background medium, these changes in refractive index at high dose results in interior ray bending. Methods: The inclusion of the effects of refraction is an important step in reconstruction of optical density in gel dosimeters. The proposed ray tracing algorithm models the interior multiple refraction at the inhomogeneities. Jacob’s ray tracing algorithm has been modified to calculate the pathlengths of the ray that traverses through the higher dose regions. The algorithm computes the length of the ray in each pixel along its path and is used as the weight matrix. Algebraic reconstruction technique and pixel based reconstruction algorithms are used for solving the reconstruction problem. The proposed method is tested with numerical phantoms for various noise levels. The experimental dosimetric results are also presented. Results: The results show that the proposed scheme ART-rc is able to reconstruct optical density inside the dosimeter better than the results obtained using filtered backprojection and conventional algebraic reconstruction approaches. The quantitative improvement using ART-rc is evaluated using gamma-index. The refraction errors due to regions of different refractive indices are discussed. The effects of modeling of interior refraction in the dose region are presented. Conclusions: The errors propagated due to multiple refraction effects have been modeled and the improvements in reconstruction using proposed model is presented. The refractive index of the dosimeter has a mismatch with the surrounding medium (for dry air or water scanning). The algorithm reconstructs the dose profiles by estimating refractive indices of multiple inhomogeneities having different refractive indices and optical densities embedded in the dosimeter. This is achieved by tracking the path of the ray that traverses through the dosimeter. Extensive simulation studies have been carried out and results are found to be matching that of experimental results.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Lightning Radio Source Retrieval Using Advanced Lightning Direction Finder (ALDF) Networks

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing and arrival time of lightning radio emissions. Solutions for the plane (i.e., no Earth curvature) are provided that implement all of tile measurements mentioned above. Tests of the retrieval method are provided using computer-simulated data sets. We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. In the absence of measurement errors, quadratic root degeneracy (no source location ambiguity) is shown to exist exactly on the outer sensor baselines for arbitrary non-collinear network geometries. The accuracy of the quadratic planar method is tested with computer generated data sets. The results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 deg. We also note some of the advantages and disadvantages of these methods over the nonlinear method of chi(sup 2) minimization employed by the National Lightning Detection Network (NLDN) and discussed in Cummins et al.(1993, 1995, 1998).

Koshak, William J.↗

PBW Degeneration: Algebra, Geometry, and Combinatorics

We review the recent progress in the theory of Poincaré–Birkhoff–Witt degenerations of irreducible representations of simple Lie algebras. We describe algebraic, geometric, and combinatorial aspects of the theory.

97 MATHEMATICS AND COMPUTING↗

Muon Tracing and Image Reconstruction Algorithms for Cosmic Ray Muon Computed Tomography

Cosmic ray muon-computed tomography (μCT) is a new imaging modality with unique characteristics that could be particularly important for diverse applications including nuclear nonproliferation, spent nuclear fuel monitoring, cargo scanning, and volcano imaging. The strong scattering dependence of muons on atomic number Z in combination with high penetration range could offer a significant advantage over existing techniques when dense, shielded containers must be imaged. However, μCT reconstruction using conventional filtered back-projection is limited due to the overly simple assumptions that do not consider the curved path caused by multiple Coulomb scattering prompting the need for more sophisticated approaches to be developed. Here, we argue that the use of improved muon tracing and scattering angle projection algorithms as well as an algebraic reconstruction technique should produce muon tomographic images with improved quality–or require fewer muons to produce the same image quality–compared to the case where conventional methods are used. We report on the development and assessment of three novel muon tracing methods and two scattering angle projection methods for μCT. Simulated dry storage casks with single and partial missing fuel assemblies were used as numerical examples to assess and compare the proposed methods. The reconstructed images showed an expected improvement in image quality when compared with conventional techniques, even without muon momentum information, which should lead to improved detection capability, even for partial defects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Labeled trees and the efficient computation of derivations

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

Grossman, Robert↗

Computation of magnetic fields from field components on a plane grid

An algorithm is presented to calculate the field components of the magnetic field [B x (x, y, z), B y (x, y, z), B z (x, y, z)] at a point (x, y, z) in space, from the knowledge of the components [B x (x, y) = 0, z), B y (x, y = 0, z), B z (x, y = 0,z)] on a “reference plane”, which is normal to the y-axis at . The algorithm, which is a general one and is not restricted to fields with mid-plane symmetry is based on the Maclaurin series expansion of the magnetic field components at any point in space in terms of the distance (y) of the point from the reference plane. The coefficients of the Maclaurin series expansion are expressed in terms of the on-plane field components and their partial derivatives with respect to spatial coordinates (). The field components are usually generated from magnetic field measurements on a rectangular grid on the plane. This algorithm was employed in 1986 in the RAYTRACE computer code to help calculate the optical properties of magnets and of the Alternating Gradient Synchrotron (AGS) at the Brookhaven National Laboratory (BNL). Here, a general mathematical formulation of this algorithm based on the differential algebraic method was presented by Makino in 2011. This paper presents the step by step derivation of the algorithm and provides the necessary formulas to be introduced by the reader in any computer code which requires the field components generated by magnetic devices. In addition provides an example of the use of the algorithm and its limitations as applied to a Halbach type magnet with or without median plane symmetry.

43 PARTICLE ACCELERATORS↗

Heavy-Duty Vehicle Air Drag Coefficient Estimation: From an Algebraic Perspective

When a heavy-duty vehicle (HDV) operates at the nominal highway speed, over two-thirds of its total resistive force comes from the air drag, contributing to more than half of its fuel consumption. One effective countermeasure to reduce the fuel consumption of HDVs is platooning, which employs connectivity and automated driving technologies to link two or more HDVs in convoy. Platooning allows HDVs to drive closer together and yields improved fuel economy and less CO2 emission thanks to the reduced air drag. Maximizing the energy benefits of an HDV platoon requires quantifying the drag interaction between vehicles. In practice, modeling the drag reduction in a platoon boils down to identifying the relationship between the air drag coefficient C d and the inter-vehicle distance d. Existing approaches to identify C d (d) include vehicle field tests, wind tunnel experiments, and computational fluid dynamics simulation, which can howbeit be time-consuming and cost prohibitive. In contrast, this paper proposes an algebraic approach, which relies on onboard-measurable variables, to estimate the air drag coefficient of an HDV in a platoon. Its algebraic nature avoids the classical persistence of excitation condition for parameter identification and can yield the identified parameter almost instantaneously. Simulation results demonstrate its effectiveness and the improved estimation speed over a recursive least squares identifier.

Wang, Zejiang↗

A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines

We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.

97 MATHEMATICS AND COMPUTING↗

A Novel Approach for Computing Rigid Body Motion Using Linear Accelerations

Here, a novel approach is presented for computing general rigid body motion based on a few known linear accelerations. This method utilizes linear acceleration data obtained from three distinct points on the body, all within a body-fixed reference frame. The only requirement is that the three chosen points must not be collinear. A system of differential-algebraic equations is derived, combining principles of rigid body kinematics with theory of the rotation group SO(3). These equations provide a framework for numerically computing various motion parameters, including angular velocity, angular acceleration, body orientation, velocity field, acceleration field, and displacement field. By numerically solving this system of equations, we can fully characterize rigid body motion in three-dimensional space. A numerical example is provided to demonstrate the practical implementation and efficacy of the proposed technique, illustrating its potential for accurate motion computation in various applications.

42 ENGINEERING↗

Summer Student Internship working on the GPU

This summer internship consisted of learning computer programming skills and languages including Thrust, CUDA, C++, C and Linux. The application of this programming is for use in GPU, graphics processing units, that are processors that perform math intensive calculations rapidly in three dimensions typically in advanced video games (“NVIDIA GeForce…”). Our goal is to apply this technology towards exa-scale computing on the LANL supercomputing infrastructure. My mentors use these machines to do computations. The completed algorithms include KD tree and Top K. In order to access the GPU, CUDA was used. CUDA is a parallel computer architecture for general computing on the GPUs. There are different means by which to access CUDA. The first approach uses libraries, like Thrust, Linear Algebra, and Signal and Image Processing. Another approach parallelizes loops in Fortran or C and in the last approach people develop custom parallel algorithms using familiar language (“What is CUDA”). The algorithms I worked on this summer use the first approach of using the thrust library of parallel algorithms and data structures.

97 MATHEMATICS AND COMPUTING↗

Symmetry-projected wave functions in quantum Monte Carlo calculations

Here, we consider symmetry-projected Hartree-Fock trial wave functions in constrained-path Monte Carlo (CPMC) calculations. Previous CPMC calculations have mostly employed Hartree-Fock (HF) trial wave functions, restricted or unrestricted. The symmetry-projected HF approach results in a hierarchy of wave functions with increasing quality: the more symmetries that are broken and restored in a self-consistent manner, the higher the quality of the trial wave function. This hierarchy is approximately maintained in CPMC calculations: the accuracy in the energy increases and the statistical variance decreases when further symmetries are broken and restored. Significant improvement is achieved in CPMC with the best symmetry-projected trial wave functions over those from simple HF. We analyze and quantify the behavior using the two-dimensional repulsive Hubbard model as an example. In the sign-problem-free region, where CPMC can be made exact but a constraint is deliberately imposed here, spin-projected wave functions remove the constraint bias. Away from half filling, spatial symmetry restoration in addition to that of the spin leads to highly accurate results from CPMC. Since the computational cost of symmetry-projected HF trial wave functions in CPMC can be made to scale algebraically with system size, this provides a potentially general approach for accurate calculations in many-fermion systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

pnnl/COMET

COMET: Domain Specific Compilation in Multi-level IR COMET is a compiler for dense and sparse tensor algebra and a domain-specific-language (DSL) that facilitates development and implementation of high-performance computing, graph analytics, and artificial intelligence (AI) applications.

Kestor, Gokcen↗

MOSCATO Development and Integration in Fiscal Year 2025: Implementation of Multiphase, Multiphysics Modeling Capabilities for Molten Salt Systems

MOSCATO (Molten Salt Chemistry and Transport) is a multiphysics code that provides high-fidelity, coupled simulations of fluid flow, heat transfer, mass transfer, chemistry, electrochemical phenomena, and alloy corrosion for molten salt systems. In FY25, significant developments were made to the code package, enhancing its capabilities for modeling all relevant phenomena within operating moltens salt reactors (MSRs). The developments and activities in FY25 included: 1. Implementation of Level-Set methods to enable modeling of single-bubble behavior in molten salts. In FY25, the Level-Set two-phase flow modeling implementation was improved to simulate single bubble behavior with molten salt media. The large density and viscosity ratios between typical gases and molten salt liquids present challenges for these types of numerical solvers. With enhancements to the pressure projection method, MOSCATO’s Level-Set solver was able to be successfully validated to experiments related to helium bubble rise in stagnant molten salt. The simulated bubble rising velocity showed reasonable good agreement with experimental measurements. The bubble shape and dynamics were also visually compared with experimental snapshots, demonstrating a good qualitative match. 2. Generation of mass transfer correlations for multiphase flow systems. To enable calculations of the tritium transport across the interface between gas bubbles and salt, we modeled high- Schmidt-number mass transfer around a sphere across a broad range of Reynolds numbers. The mesh near the sphere surface was highly refined to resolve steep concentration gradients caused by the low diffusion coefficient. Literature-based mass transfer correlations were compared with the numerical results, and modifications were proposed to improve agreement, particularly at higher Schmidt numbers. These mass transfer correlations were subsequently provided to other national laboratories to help enable high quality mass transfer simulations using lower-order solvers under development within the NEAMS program. 3. Preliminary implementation of a bubbly flow solver. To model bubbly flow in molten salt, we implemented a bubbly flow solver for void fractions less than 5%. To do so, an algebraic relative velocity model that assumes small bubbles with rapid momentum equilibration was added to MOSCATO to compute bubble velocities. Preliminary comparisons with experimental data showed reasonable agreement, and further improvements are underway. 4. Generation of mass transfer correlations for MSRE subchannel The Molten-Salt Reactor Experiment (MSRE) was a landmark historical project that demonstrated the feasibility of molten-salt reactor technology. The MSRE campaign also generated a significant body of experimental data and reports that continue to support molten-salt–related research. In this report, the MSRE core subchannel was used as the reference geometry for a mass transfer study performed with MOSCATO. The geometry and computational mesh were adapted from a previous study, providing adequate resolution for the relatively low Reynolds number in this case. Additional mesh refinement was applied to reach higher Schmidt numbers, enabling the derivation of a reliable mass-transfer correlation for the present scenario. 5. Simulations of oxygen ingressions into molten salt. In the previous fiscal year, we initiated a study to simulate oxygen ingression in stagnant salt. As oxygen enters the salt through its surface, it reacts with Ce 3+ to form solid CeO 2 and other reaction products. To more fully capture the complex diffusion-convection-reaction mechanisms, capabilities for modeling natural convection in the salt vessel were added. These were needed as the flow of the ingressed gas induced flow in the salt caused by surface shear and non-isothermal effects. With these updated physics in place, we were able to successfully reproduce the experimental results for the rate of change of CeCl 3 concentrations versus time. 6. Flow corrosion model validation. In FY24, MOSCATO’s corrosion model was validated against static corrosion experiments. In FY25, this work was extended to a flow corrosion experiment, where FLiNaK salt was driven by natural convection, with initial salt impurities to initiate corrosion. Despite uncertainties in parameters such as elemental diffusion coefficients in the alloy and unknown H + concentrations, the simulations achieved good agreement with experimental results, especially in predicting sample mass losses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗