Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical software”

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 685 records · Page 38

Tokamak-independent Software Analysis Suite for Multi-Spectral Line-Polarization MSE diagnostics

A tokamak-independent analysis suite has been developed to process data from Motional Stark Effect (MSE) diagnostics. The software supports multi-spectral line-polarization MSE diagnostics which simultaneously measure emission at the MSE sigma and pi lines as well as at two `background' wavelengths that are displaced from the MSE spectrum by a few nanometers. This analysis accurately estimates the amplitude of partially-polarized background light at the sigma and pi wavelengths even in situations where the background light changes rapidly in time and space. The signal amplitude at many frequencies is computed using a numerical-beat algorithm which allows the retardance of the MSE photo-elastic modulators (PEMs) to be monitored during routine operation. It also allows the use of summed intensities at multiple frequencies in the calculation of polarization direction, which increases the effective signal strength and reduces sensitivity to PEM retardance drift. The software allows the polarization angles to be corrected for calibration drift using a system that illuminates the MSE diagnostic with polarized light at four known polarization angles within ten seconds of a plasma discharge The software suite is modular, parallelized, and portable to other facilities. (2016-06-06)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Tokamak-independent Software Analysis Suite for Multi-Spectral Line-Polarization MSE diagnostics

A tokamak-independent analysis suite has been developed to process data from Motional Stark Effect (MSE) diagnostics. The software supports multi-spectral line-polarization MSE diagnostics which simultaneously measure emission at the MSE sigma and pi lines as well as at two `background' wavelengths that are displaced from the MSE spectrum by a few nanometers. This analysis accurately estimates the amplitude of partially-polarized background light at the sigma and pi wavelengths even in situations where the background light changes rapidly in time and space. The signal amplitude at many frequencies is computed using a numerical-beat algorithm which allows the retardance of the MSE photo-elastic modulators (PEMs) to be monitored during routine operation. It also allows the use of summed intensities at multiple frequencies in the calculation of polarization direction, which increases the effective signal strength and reduces sensitivity to PEM retardance drift. The software allows the polarization angles to be corrected for calibration drift using a system that illuminates the MSE diagnostic with polarized light at four known polarization angles within ten seconds of a plasma discharge The software suite is modular, parallelized, and portable to other facilities.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advances and challenges in computational fluid dynamics of atmospheric pressure plasmas

Atmospheric pressure plasmas (APPs) are at the core of diverse technological applications in materials processing, chemical synthesis, resource recovery, water treatment, and medicine, among others. APPs span a wide range of power density, from low-power non-thermal to high-power thermal discharges, and typically involve interactions with a stream of working gas, processing material, or gas environment. The article provides an overview of Computational Fluid Dynamics (CFD) approaches, from mathematical models to software strategies, for the analysis of APP flows. Its focus is flows with large variations in ionization degree and significant fluid dynamic-thermal-electromagnetic coupling, as particularly found in mid- to high-power discharges. The advances achieved and challenges faced by CFD of APP flows have been driven by established and emerging applications, and can be broadly characterized in terms of model fidelity and numerical accuracy. Fidelity refers to the degree of underlying phenomena captured by the model, whereas accuracy to the precision of the numerical solution of the model. Two distinct numerical accuracy challenges are addressed: the capture of instability and pattern formation phenomena, and of plasma-gas interaction and turbulence; as well as two representative fidelity challenges: radiative transport under nonequilibrium conditions, and nonequilibrium electron and particle kinetics. The purpose of this article is to offer guidance to researchers, from modelers and code developers to open-source and commercial software users, working on CFD analyses of APP flows within technological contexts.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Automated Model Updating Effect on the Linear and Nonlinear Dynamic Responses of Historical Masonry Structures

Finite element models supply the simulation of the problems to obtain the structural behaviors under different loading conditions. The updating processes based on changing the uncertain parameters such as material properties, boundary conditions, meshing size etc. are made to create actual finite element models in order to represent the real conditions of the problems. This procedure can be made using two methods, namely manual model updating and global/local automatic model updating. The global/local automatic model updating procedures are very popular owing to the applicability to all kind of engineering structures, minimizing the differences nearly to zero, availability of damage localization and structural health monitoring. In this paper a historical masonry armory building selected as an application and its finite element analyses, experimental measurements and automated model updating processes are carried out. The finite element model of the structures was developed with ANSYS software and first three natural frequencies are attained. The experimental dynamic characteristics such as natural frequencies, damping ratios and mode shapes are obtained using ambient vibration method. The differences between experimental and numerical frequencies are minimized up to the range of 0–1%, by using local updating procedure. The linear and nonlinear seismic analyses of the building are conducted on initial and updated models. At the end of the analyses, maximum displacements, principal stresses and strains are given with detail. In addition, crack distributions diagrams are attained to validate the stresses accumulation points. It can be seen that there is an increasing trend in the displacement, stress and strain values after finite element model updating both linear and nonlinear analysis. In addition, linear and nonlinear analysis results are compared with each other to evaluate the nonlinear analysis effect. It is concluded that the displacement and strain values are increased after nonlinear analysis. But, there is not any agreement in stress values.

42 ENGINEERING↗

RANSBox: A zero-dimensional modular software package for Reynolds-averaged Navier-Stokes modeling

RANSBox is a zero-dimensional software package for Reynolds-averaged Navier-Stokes (RANS) modeling developed at Lawrence Livermore National Laboratory to support common implementation of RANS models across a variety of host codes with different numerical schemes and code bases. Herein this work describes the key features of RANSBox including “model-agnostic integration,” which allows new models to be implemented in RANSBox and quickly deployed to host codes without additional changes to the host code base. Three one-dimensional test problems with analytical asymptotic properties are described which can be used to verify correctness of RANSBox integration. Results for these problems are then compared across different RANS models in a single code and across different codes with a common RANS model. By using a common model implementation in RANSBox, host codes with different numerical schemes and formal orders of accuracy are demonstrated to predict the expected behavior for the three test problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

Data preservation at the Fermilab Tevatron

The Fermilab Tevatron collider's data-taking run ended in September 2011, yielding a dataset with rich scientific potential. The CDF and D0 experiments each have approximately 9 PB of collider and simulated data stored on tape. A large computing infrastructure consisting of tape storage, disk cache, and distributed grid computing for physics analysis with the Tevatron data is present at Fermilab. The Fermilab Run II data preservation project intends to keep this analysis capability sustained through the year 2020 and beyond. To achieve this goal, we have implemented a system that utilizes virtualization, automated validation, and migration to new standards in both software and data storage technology and leverages resources available from currently-running experiments at Fermilab. Lastly, these efforts have also provided useful lessons in ensuring long-term data access for numerous experiments, and enable high-quality scientific output for years to come.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Phenomenological constraints on Lemaître-Tolman-Bondi cosmological inhomogeneities from solar system dynamics

We, first, analytically work out the long-term, i.e. averaged over one orbital revolution, perturbations on the orbit of a test particle moving in a local Fermi frame induced therein by the cosmological tidal effects of the inhomogeneous Lemaître-Tolman-Bondi (LTB) model. The LTB solution has recently attracted attention, among other things, as a possible explanation of the observed cosmic acceleration without resorting to dark energy. Then, we phenomenologically constrain both the parameters K1 doteq ddot frakR / frakR and K2 doteq ddot frakR' / frakR' of the LTB metric in the Fermi frame by using different kinds of solar system data. The corrections Δdot varpi to the standard Newtonian/Einsteinian precessions of the perihelia of the inner planets recently estimated with the EPM ephemerides, compared to our predictions for them, yield preliminarily K{sub 1} = (4±8) × 10{sup −26} s{sup −2}, K{sub 2} = (3±7) × 10{sup −23} s{sup −2}. The residuals of the Cassini-based Earth-Saturn range, compared with the numerically integrated LTB range signature, allow to preliminarily obtain K{sub 1} ≈ K{sub 2} ≈ 10{sup −27} s{sup −2}. Actually, the LTB effects should be explicitly modeled in the ephemerides softwares, so that the entire planetary and spacecraft data sets should be accordingly re-processed. The LTB-induced distortions of the orbit of a typical object of the Oort cloud with respect to the commonly accepted Newtonian picture, based on the observations of the comet showers from that remote region of the solar system, point towards K{sub 1} ≈ K{sub 2}∼<10{sup −30}−10{sup −32} s{sup −2}. Such figures have to be compared with those inferred from cosmological data which are of the order of K{sub 1} ≈ K{sub 2} = −4 × 10{sup −36} s{sup −2}.

79 ASTRONOMY AND ASTROPHYSICS↗

Scientific Core Library Stack (SCLS) v2026

SCLS (Scientific Core Library Stack) is an opinionated build and packaging system for scientific computing libraries developed at Lawrence Berkeley National Laboratory. It produces a coherent, reproducible stack of numerical libraries — including BLAS/LAPACK, MPI, sparse direct and iterative solvers, graph partitioners, and parallel I/O libraries (e.g., PETSc, SLEPc, HDF5, NetCDF, MUMPS, OpenBLAS) — that work together without manual repair by downstream scientific software. From a single recipe-and-flavor model, SCLS produces native RPM packages for RHEL-family Linux, DEB packages for Debian/Ubuntu, direct Unix-style prefix installs for HPC and locked-down environments, and native macOS builds. Multiple build "flavors" (e.g., GCC+OpenBLAS, GCC+MKL, Intel+MKL, debug) coexist in distinct prefixes on the same host. Compared to general-purpose meta-build frameworks, SCLS is deliberately curated rather than infinitely configurable. It enforces deterministic, audit-friendly behavior: explicit build dependencies, no silent feature autodetection, a clear open-source license policy, and rpath-based runtime linkage so installs integrate cleanly with standard package-manager workflows.

Messe, Christian [Lawrence Berkeley National Labor↗

Modeling Mathematical Programs with Equilibrium Constraints in Pyomo

We describe new capabilities for modeling MPEC problems within the Pyomo modeling software. These capabilities include new modeling components that represent complementarity conditions, modeling transformations for re-expressing models with complementarity conditions in other forms, and meta-solvers that apply transformations and numeric optimization solvers to optimize MPEC problems. We illustrate the breadth of Pyomo's modeling capabilities for MPEC problems, and we describe how Pyomo's meta-solvers can perform local and global optimization of MPEC problems.

97 MATHEMATICS AND COMPUTING↗

Modeling Partial Reflection Paths for Infrasound Analysis

Numerical methods enabling simulation of scattered and partially reflected infrasonic propagation paths produced by interaction with fine-scale structure in the middle atmosphere have been implemented in the infraGA ray tracing software. This capability enables simulation of ensonification in the classical stratospheric “shadow zone” that has been observed during the Humming Roadrunner and LSECE surface explosion campaigns as well as in other data sets. In the case of LSECE, a pair of stations roughly 140 kilometers east of the source location observed arrivals with celerities (horizontal group velocities) slightly slower than observed stratospheric paths at similar azimuths. The arrivals exhibited increasing trace velocity later in the wavetrain indicating a steepening of the arrival path for longer or slower propagation paths. Simulation of partially reflected paths using the updated infraGA software methods finds good agreement between observed and predicted infrasonic ensonification at these locations within the stratospheric shadow zone. Further development of the partial reflection physics and comparison with other data sets is needed to more robustly understand how such anomalous infrasonic signals can be predicted; however, the demonstration of this capability is a promising first step in such analyses.

97 MATHEMATICS AND COMPUTING↗

Developmental study of advanced HIS design method for digital I and C+HMIT of PWR plant - 277

A new conceptual frame of how to design and validate a digital HIS (human interface system) on an innovative numerical simulation basis is proposed for the support of plant operators' supervisory control of various types of automated complex NPPs (nuclear power plants). The proposed conceptual framework utilizes the object-oriented software for plant DiD (defense-in depth) risk monitor with the combination of nuclear reactor accident simulation by an advanced nuclear safety analysis code RELAP5/MOD4. The conceptual frame proposed in this paper will be applied for an example practice for the SBLOCA (small break loss of coolant accident) case of passive safety PWR (pressurized water reactor) AP1000. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Large language model evaluation for high–performance computing software development

We apply AI-assisted large language model (LLM) capabilities of GPT-3 targeting high-performance computing (HPC) kernels for (i) code generation, and (ii) auto-parallelization of serial code in C ++, Fortran, Python and Julia. Our scope includes the following fundamental numerical kernels: AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG, and language/programming models: (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, CUDA.jl, AMDGPU.jl, and KernelAbstractions.jl). Kernel implementations are generated using GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code given simple + + prompt variants. To quantify and compare the generated results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. For auto-parallelization, we use ChatGPT interactively giving simple prompts as in a dialogue with another human including simple “prompt engineering” follow ups. Results suggest that correct outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general-purpose Python can benefit from adding language keywords, while Julia prompts perform acceptably well for its Threads and CUDA.jl programming models. Finally, we expect to provide an initial quantifiable point of reference for code generation in each programming model using a state-of-the-art LLM. Overall, understanding the convergence of LLMs, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

97 MATHEMATICS AND COMPUTING↗

Numerical Methods to Evaluate Hyperelastic Transducers: Hexagonal Distributed Embedded Energy Converters

Hexagonal distributed embedded energy converters, also known as hexDEECs, are centimeter-scale energy transducers that leverage variable capacitance to generate electricity when their hyperelastic structure is dynamically deformed. To better understand, characterize, and optimize hexDEEC designs, a series of numerical methods and techniques were developed to model the hyperelastic mechanics of hexDEECs, electrostatic properties, and electricity generation characteristics. The numerical methods developed for the hyperelastic structural analysis were corroborated by empirical results from another study, and the models and equations for capacitance, electrostatic forces, and electrical potential energy were derived from fundamental electrostatic equations. These methods and techniques were implemented within the STAR-CCM+ multiphysics software Version 2020.3 (15.06.008) environment. Results from this analysis revealed methodologies and techniques necessary to model the energy converters, which will enable future exploration and optimization of more specific designs and corresponding applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

MAPPRAISER: A massively parallel map-making framework for multi-kilo pixel CMB experiments

Forthcoming cosmic microwave background (CMB) polarized anisotropy experiments have the potential to revolutionize our understanding of the Universe and fundamental physics. The sought-after, tale-telling signatures will be however distributed over voluminous data sets which these experiments will collect. These data sets will need to be efficiently processed and unwanted contributions due to astrophysical, environmental, and instrumental effects characterized and efficiently mitigated in order to uncover the signatures. This poses a significant challenge to data analysis methods, techniques, and software tools which will not only have to be able to cope with huge volumes of data but to do so with unprecedented precision driven by the demanding science goals posed for the new experiments. A keystone of efficient CMB data analysis is solvers of very large linear systems of equations. Such systems appear in very diverse contexts throughout CMB data analysis pipelines, however they typically display similar algebraic structures and can therefore be solved using similar numerical techniques. Linear systems arising in the so-called map-making problem are one of the most prominent and common ones. In this work we present a massively parallel, flexible and extensible framework, comprised of a numerical library, MIDAPACK, and a high level code, MAPPRAISER, which provide tools for solving efficiently such systems. Here, the framework implements iterative solvers based on conjugate gradient techniques: enlarged and preconditioned using different preconditioners. We demonstrate the framework on simulated examples reflecting basic characteristics of the forthcoming data sets issued by ground-based and satellite-borne instruments, executing it on as many as 16,384 compute cores. The software is developed as an open source project freely available to the community at: https://github.com/B3Dcmb/midapack.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Computational Modeling of Hydraulic Properties of a Sheared Single Rock Fracture

Flow through a single mechanically sheared Marcellus shale fracture was investigated computationally and experimentally. To provide a better understanding of the variation of hydraulic and geometrical characteristics of a fracture subjected to shearing, coupled shear flow tests on the fracture for four shearing displacement steps under constant normal stress were performed. At the end of each shearing step, computed tomography (CT) scans with resolution 26.8 μm were obtained and the corresponding fracture geometries were evaluated. The CT images were used to generate full aperture maps of the fracture configuration. In addition, average aperture maps were also created by averaging the full-resolution data over 10 × 10 pixels, smoothing out fine structural details. Computational modeling of water flow through the fractures at different shearing steps was performed using a modified local cubic law approach and the 3D full Navier–Stokes equations with the use of the ANSYS-Fluent software. Both the average aperture maps and full maps were used in these simulations. The experimental pressure drops of the fracture at shearing step 1, which has very small apertures, poorly matched the numerical results, quite likely because the fracture structure was inadequately captured by the scanning resolution. Shearing typically increased the aperture height of the fracture, whose features were then better captured by the CT scan. Good agreement between the experimental data and the numerical results of the full map for shearing step 2 was observed. The simulations were performed for both full and average aperture maps, and the effects of scan resolution and surface roughness on the accuracy of the results were studied. The modified local cubic law and full Navier–Stokes simulations of the averaged map fracture were found to be in good agreement. It was conjectured that this was because the nonlinear losses were insignificant for the smoothed out averaged map fracture. Similar comparisons with those of the full map showed agreement in trends, but there were some quantitative differences. The averaged fracture map simulations also predicted lower pressure drops compared to the full map, particularly for high flow rates. These differences were due to the fine-scale geometrical complexity (surface roughness) of fracture geometry that affects the fluid flow in the fracture. In conclusion, an improved cubic law model was also proposed, and its accuracy was verified by comparing its predictions with those of the Navier–Stokes simulations.

58 GEOSCIENCES↗