Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer”

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

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

At least 1,027 records · Page 57

Computational Aerodynamic Simulations of an 840 ft/sec Tip Speed Advanced Ducted Propulsor Fan System Model for Acoustic Methods Assessment and Development

Computational Aerodynamic simulations of an 840 ft/sec tip speed, Advanced Ducted Propulsor fan system were performed at five different operating points on the fan operating line, in order to provide detailed internal flow field information for use with fan acoustic prediction methods presently being developed, assessed and validated. The fan system is a sub-scale, lownoise research fan/nacelle model that has undergone extensive experimental testing in the 9- by 15- foot Low Speed Wind Tunnel at the NASA Glenn Research Center, resulting in quality, detailed aerodynamic and acoustic measurement data. Details of the fan geometry, the computational fluid dynamics methods, the computational grids, and various computational parameters relevant to the numerical simulations are discussed. Flow field results for three of the five operating conditions simulated are presented in order to provide a representative look at the computed solutions. Each of the five fan aerodynamic simulations involved the entire fan system, excluding a long core duct section downstream of the core inlet guide vane. As a result, only fan rotational speed and system bypass ratio, set by specifying static pressure downstream of the core inlet guide vane row, were adjusted in order to set the fan operating point, leading to operating points that lie on a fan operating line and making mass flow rate a fully dependent parameter. The resulting mass flow rates are in good agreement with measurement values. The computed blade row flow fields for all five fan operating points are, in general, aerodynamically healthy. Rotor blade and fan exit guide vane flow characteristics are good, including incidence and deviation angles, chordwise static pressure distributions, blade surface boundary layers, secondary flow structures, and blade wakes. Examination of the computed flow fields reveals no excessive boundary layer separations or related secondary-flow problems. A few spanwise comparisons between computational and measurement data in the bypass duct show that they are in good agreement, thus providing a partial validation of the computational results.

Tweedt, Daniel L.↗

Re-Computation of Numerical Results Contained in NACA Report No. 496

An extensive examination of NACA Report No. 496 (NACA 496), "General Theory of Aerodynamic Instability and the Mechanism of Flutter," by Theodore Theodorsen, is described. The examination included checking equations and solution methods and re‐computing interim quantities and all numerical examples in NACA 496. The checks revealed that NACA 496 contains computational shortcuts (time‐ and effort‐saving devices for engineers of the time) and clever artifices (employed in its solution methods), but, unfortunately, also contains numerous tripping points (aspects of NACA 496 that have the potential to cause confusion) and some errors. The re‐computations were performed employing the methods and procedures described in NACA 496, but using modern computational tools. With some exceptions, the magnitudes and trends of the original results were in fair‐to‐very‐good agreement with the re‐computed results. The exceptions included what are speculated to be computational errors in the original in some instances and transcription errors in the original in others. Independent flutter calculations were performed and, in all cases, including those where the original and re‐computed results differed significantly, were in excellent agreement with the re‐computed results. Appendix A contains NACA 496; Appendix B contains a Matlab(Reistered) program that performs the re‐computation of results; Appendix C presents three alternate solution methods, with examples, for the two‐degree‐of-freedom solution method of NACA 496; Appendix D contains the three‐degree‐of‐freedom solution method (outlined in NACA 496 but never implemented), with examples.

Perry, Boyd, III↗

Computational Analysis of the X-57 Maxwell Airplane at Unpowered Conditions (Preliminary Fuselage)

The X-57 Maxwell is an all-electric airplane that implements a distributed electric propulsion system to demonstrate that high-efficiency electric propulsion can be integrated with aerodynamics to increase the performance of an airplane. To this end, distributed electric fans were installed on the wing to provide increased flow over the wing at the low takeoff and landing speeds of the X-57. The low-speed lift augmentation allows for a reduction in wing area for cruise optimization. The X-57 wing area was reduced to 42 percent of the wing area of the baseline aircraft, a Tecnam P2006T. With this reduced wing area and the electric propulsion system, it is estimated that the X-57 will cruise on less than one-third the total energy compared to the baseline aircraft. To meet the cruise performance goal at a Mach number of 0.233 at an altitude of 8000 feet, the X-57 has a cruise lift coefficient of 0.7516 and needs to have a cruise drag coefficient of 0.05423 or less. The USM3D computational solver was used to investigate the X-57 performance, without the distributed electric propulsion high-lift system operating. The unpowered X-57 performance is of interest to quantify if the X-57 can meet the cruise drag performance goal, and to document the lift performance of the very small wing at takeoff and landing conditions. The primary configurations investigated in this paper include the cruise configuration with no flap deflection, a takeoff configuration with a 10◦ flap deflection, and a landing configuration with a 30◦ flap deflection. The conditions for the cruise configuration were a flight unit Reynolds number of 1.32E+06 per foot, an altitude of 8000 feet, a Mach number of 0.233, and angles of attack from −2° to 24° . At the cruise lift coefficient of 0.7516, the computed drag coefficient is 0.05275. This computed drag is less than the drag coefficient of 0.05423 that is required to meet the X-57 airplane performance goal. However, the computational airplane is a completely smooth geometry and does not account for protuberance drag, nor the drag from steps and gaps in the actual X-57 airplane. Therefore, based upon the CFD drag calculation there is a 10-percent margin to account for some of the differences between the as-built metal fuselage and empennage construction, and the smooth computational geometry. The computed cruise drag also does not account for an induced drag reduction due to the wing-tip propellers and a drag reduction due to laminar flow achieved on the wing. The computed lift to drag ratio is 14.14 at the cruise lift coefficient of 0.7516, and the maximum computed lift to drag ratio is 15.8. The maximum lift coefficient for the cruise configuration was 2.13 at an angle of attack of 15°. The conditions for the takeoff configuration with a 10° flap deflection were a flight unit Reynolds number of 0.986E+06 per foot, an altitude of 2500 feet, a Mach number of 0.149, and angles of attack from −2° to 22°. The maximum lift coefficient for the takeoff configuration was 2.21 at an angle of attack of 16°. The conditions for the landing configuration with a 30° flap deflection were a flight unit Reynolds number of 0.922E+06 per foot, an altitude of 2500 feet, a Mach number of 0.139, and angles of attack from −2° to 24°. The maximum lift coefficient for the landing configuration was 2.58 and occurred at two angles of attack, 10° and 14°. Based on the unpowered maximum lift coefficient of 2.58 for the 30° flap deflection, along with computations of the distributed electric propulsion lift augmentation (not shown in this paper), the X-57 Maxwell is estimated to meet its powered landing goal of a maximum lift coefficient of 4.0.

X-57 Maxwell Airplane↗

Line-plane broadcasting in a data communications network of a parallel computer

Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

Archer, Charles J↗

Reverse Computation for Rollback-based Fault Tolerance in Large Parallel Systems

Reverse computation is presented here as an important future direction in addressing the challenge of fault tolerant execution on very large cluster platforms for parallel computing. As the scale of parallel jobs increases, traditional checkpointing approaches suffer scalability problems ranging from computational slowdowns to high congestion at the persistent stores for checkpoints. Reverse computation can overcome such problems and is also better suited for parallel computing on newer architectures with smaller, cheaper or energy-efficient memories and file systems. Initial evidence for the feasibility of reverse computation in large systems is presented with detailed performance data from a particle simulation scaling to 65,536 processor cores and 950 accelerators (GPUs). Reverse computation is observed to deliver very large gains relative to checkpointing schemes when nodes rely on their host processors/memory to tolerate faults at their accelerators. A comparison between reverse computation and checkpointing with measurements such as cache miss ratios, TLB misses and memory usage indicates that reverse computation is hard to ignore as a future alternative to be pursued in emerging architectures.

Perumalla, Kalyan S↗

High-data throughput reconfigurable computing platform

A reconfigurable computing platform includes a reconfigurable computing device, electro-optical transceiver, and first voltage converter disposed on a multilayer board. The electro-optical transceiver converts an optical signal at least one of to and from an electrical signal, and the electrical signal is operatively coupled to the reconfigurable computing device. The electro-optical transceiver is disposed in proximity to the reconfigurable computing device, and the first voltage converter is operatively coupled to a common voltage distributed around a periphery of the multilayer board. The first voltage converter converts the common voltage to a first operating voltage, and the first voltage converter is disposed in proximity to the reconfigurable computing device. The first operating voltage is provided to the reconfigurable computing device as a first power source. A reconfigurable computing system includes a plurality of reconfigurable computing platforms operatively coupled together using an optical signal. A corresponding method of providing a reconfigurable computing platform is also disclosed.

Tang, Shaochun↗

On the Bayesian calibration of computer model mixtures through experimental data, and the design of predictive models

For many real systems, several computer models may exist with different physics and predictive abilities. To achieve more accurate simulations/predictions, it is desirable for these models to be properly combined and calibrated. Here, we propose the Bayesian calibration of computer model mixture method which relies on the idea of representing the real system output as a mixture of the available computer model outputs with unknown input dependent weight functions. The method builds a fully Bayesian predictive model as an emulator for the real system output by combining, weighting, and calibrating the available models in the Bayesian framework. Moreover, it fits a mixture of calibrated computer models that can be used by the domain scientist as a mean to combine the available computer models, in a flexible and principled manner, and perform reliable simulations. It can address realistic cases where one model may be more accurate than the others at different input values because the mixture weights, indicating the contribution of each model, are functions of the input. Inference on the calibration parameters can consider multiple computer models associated with different physics. The method does not require knowledge of the fidelity order of the models. We provide a technique able to mitigate the computational overhead due to the consideration of multiple computer models that is suitable to the mixture model framework. We implement the proposed method in a real-world application involving the Weather Research and Forecasting large-scale climate model.

97 MATHEMATICS AND COMPUTING↗

A Roadmap for Edge Computing Enabled Automated Multidimensional Transmission Electron Microscopy

The advent of modern, high-speed electron detectors has made the collection of multidimensional hyperspectral transmission electron microscopy datasets, such as 4D-STEM, a routine. However, many microscopists find such experiments daunting since analysis, collection, long-term storage, and networking of such datasets remain challenging. Some common issues are their large and unwieldy size that often are several gigabytes, non-standardized data analysis routines, and a lack of clarity about the computing and network resources needed to utilize the electron microscope. The existing computing and networking bottlenecks introduce significant penalties in each step of these experiments, and thus, real-time analysis-driven automated experimentation for multidimensional TEM is challenging. One solution is to integrate microscopy with edge computing, where moderately powerful computational hardware performs the preliminary analysis before handing off the heavier computation to high-performance computing (HPC) systems. In this work, we trace the roots of computation in modern electron microscopy, demonstrate deep learning experiments running on an edge system, and discuss the networking requirements for tying together microscopes, edge computers, and HPC systems.

47 OTHER INSTRUMENTATION↗

Enhancing materials property prediction by leveraging computational and experimental data using deep transfer learning

Abstract The current predictive modeling techniques applied to Density Functional Theory (DFT) computations have helped accelerate the process of materials discovery by providing significantly faster methods to scan materials candidates, thereby reducing the search space for future DFT computations and experiments. However, in addition to prediction error against DFT-computed properties, such predictive models also inherit the DFT-computation discrepancies against experimentally measured properties. To address this challenge, we demonstrate that using deep transfer learning, existing large DFT-computational data sets (such as the Open Quantum Materials Database (OQMD)) can be leveraged together with other smaller DFT-computed data sets as well as available experimental observations to build robust prediction models. We build a highly accurate model for predicting formation energy of materials from their compositions; using an experimental data set of $$1,643$$ 1 , 643 observations, the proposed approach yields a mean absolute error (MAE) of $$0.07$$ 0.07 eV/atom, which is significantly better than existing machine learning (ML) prediction modeling based on DFT computations and is comparable to the MAE of DFT-computation itself.

36 MATERIALS SCIENCE↗

An approach to quantum-computational hydrologic inverse analysis

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealer to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.

97 MATHEMATICS AND COMPUTING↗

Large Scale Computing and Storage Requirements for Nuclear Physics Research

The National Energy Research Scientific Computing Center (NERSC) is the primary computing center for the DOE Office of Science, serving approximately 4,000 users and hosting some 550 projects that involve nearly 700 codes for a wide variety of scientific disciplines. In addition to large-scale computing resources NERSC provides critical staff support and expertise to help scientists make the most efficient use of these resources to advance the scientific mission of the Office of Science. In May 2011, NERSC, DOE’s Office of Advanced Scientific Computing Research (ASCR) and DOE’s Office of Nuclear Physics (NP) held a workshop to characterize HPC requirements for NP research over the next three to five years. The effort is part of NERSC’s continuing involvement in anticipating future user needs and deploying necessary resources to meet these demands. The workshop revealed several key requirements, in addition to achieving its goal of characterizing NP computing. The key requirements include: 1. Larger allocations of computational resources at NERSC; 2. Visualization and analytics support; and 3. Support at NERSC for the unique needs of experimental nuclear physicists. This report expands upon these key points and adds others. The results are based upon representative samples, called “case studies,” of the needs of science teams within NP. The case studies were prepared by NP workshop participants and contain a summary of science goals, methods of solution, current and future computing requirements, and special software and support needs. Participants were also asked to describe their strategy for computing in the highly parallel, “multi-core” environment that is expected to dominate HPC architectures over the next few years. The report also includes a section with NERSC responses to the workshop findings. NERSC has many initiatives already underway that address key workshop findings and all of the action items are aligned with NERSC strategic plans.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Software Systems for High-performance Quantum Computing

Quantum computing promises new opportunities for solving hard computational problems, but harnessing this novelty requires breakthrough concepts in the design, operation, and application of computing systems. We define some of the challenges facing the development of quantum computing systems as well as software-based approaches that can be used to overcome these challenges. Following a brief overview of the state of the art, we present models for the quantum programming and execution models, the development of architectures for hybrid high-performance computing systems, and the realization of software stacks for quantum networking. This leads to a discussion of the role that conventional computing plays in the quantum paradigm and how some of the current challenges for exascale computing overlap with those facing quantum computing.

high-performance computing↗

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Argonne Leadership Computing Facility 2024 Operational Assessment Report

This Operational Assessment Report describes how the Argonne Leadership Computing Facility (ALCF) met or exceeded every goal set by DOE for the calendar year (CY) 2024. In CY 2024, the ALCF operated Polaris, an AMD and NVIDIA-based Hewlett Packard Enterprise (HPE) Apollo 6500 Gen10+ system that provides a powerful platform for breakthrough science and prepares applications and workloads for Aurora, Argonne National Laboratory’s Intel-HPE exascale computer. Since going into production in August 2022, Polaris has supported research teams from the DOE Exascale Computing Project (ECP), which concluded in 2024, and from ALCF’s Aurora Early Science Program (ESP). Polaris delivered a total of 2555.7K node-hours to 17 Innovative and Novel Computational Impact on Theory and Experiment (INCITE) 2024 projects and 601.6K node-hours to ASCR Leadership Computing Challenge (ALCC) projects (12 of which were awarded during the 2023–2024 ALCC year and 11 of which were awarded during the 2024–2025 ALCC year), as well as providing substantial time for Director’s Discretionary (DD) projects (966.2K node-hours). As Table ES.1 shows, Polaris performed exceptionally well in terms of overall availability (97.7 percent), scheduled availability (99.6 percent), and utilization (94.7 percent; Table 2.1). In CY 2024, ALCF supported more than 2,000 users. As of March 18, 2025, ALCF’s users have published 254 papers in peer-reviewed journals and technical proceedings.

97 MATHEMATICS AND COMPUTING↗

From NWChem to NWChemEx: Evolving with the Computational Chemistry Landscape

Since the advent of the first computers, chemists have been at the forefront of using computers to understand and solve complex chemical problems. As the hardware and software have evolved, so have the theoretical and computational chemistry methods and algorithms. Parallel computers clearly changed the common computing paradigm in the late 1970s and 80s, and the field has again seen a paradigm shift with the advent of graphical processing units. This review explores the challenges and some of the solutions in transforming software from the terascale to the petascale and now to the upcoming exascale computers. While discussing the field in general, NWChem and its redesign, NWChemEx, will be highlighted as one of the early codesign projects to take advantage of massively parallel computers and emerging software standards to enable large scientific challenges to be tackled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Perspective on Sustainable Computational Chemistry Software Development and Integration

The power of quantum chemistry to predict the ground and excited state properties of complex chemical systems has driven the development of computational quantum chemistry software, integrating advances in theory, applied mathematics, and computer science. The emergence of new computational paradigms associated with exascale technologies also poses significant challenges that require a flexible forward strategy to take full advantage of existing and forthcoming computational resources. In this context, the sustainability and interoperability of computational chemistry software development are among the most pressing issues. In this perspective, we discuss software infrastructure needs and investments with an eye to fully utilize exascale resources and provide unique computational tools for next-generation science problems and scientific discoveries.

36 MATERIALS SCIENCE↗

Accelerated computation of lattice thermal conductivity using neural network interatomic potentials

We report with the development of the density functional theory (DFT) and ever-increasing computational capacity, an accurate prediction of lattice thermal conductivity based on the Boltzmann transport theory becomes computationally feasible, contributing to a fundamental understanding of thermal conductivity as well as a choice of the optimal materials for specific applications. However, steep costs in evaluating third-order force constants limit the theoretical investigation to crystals with high symmetry and few atoms in the unit cell. Currently, machine learning potentials are garnering attention as a computationally efficient high-fidelity model of DFT, and several studies have demonstrated that the lattice thermal conductivity could be computed accurately via the machine learning potentials. However, test materials were mostly crystals with high symmetries, and the applicability of machine learning potentials to a wide range of materials has yet to be demonstrated. Furthermore, establishing a standard training set that provides consistent accuracy and computational efficiencies across a wide range of materials would be useful. To address these issues, herein we compute lattice thermal conductivities at 300 K using neural network interatomic potentials. As test materials, we select 25 materials with diverse symmetries and a wide range of lattice thermal conductivities between 10 -1 and 10 3 Wm -1 K -1 . Among various choices of training sets, we find that molecular dynamics trajectories at 50–700 K consistently provide results at par with DFT for the test materials. In contrast to pure DFT approaches, the computational cost in the present approach is uniform over the test materials, yielding a speed gain of 2–10 folds. When a smaller reduced training set is used, the relative efficiency increases by up to ~50 folds without sacrificing accuracy significantly. The current work will broaden the application scope of machine learning potentials by establishing a robust framework for accurately computing lattice thermal conductivity with machine learning potentials.

36 MATERIALS SCIENCE↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗