Search NASA⌕ Search

SEARCH · Search NASA

Results for “Software 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.

At least 973 records · Page 54

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗

Post-Flight Performance Analysis of Navigation and Advanced Guidance Algorithms on a Terrestrial Suborbital Rocket Flight

There is currently renewed interest in robotic and crewed landers for a return to the lunar surface. Advanced guidance and navigation algorithms are essential to accurately delivering cargo and crew safely to the moon successfully. This paper reports the overall performance of an integrated set of navigation and guidance algorithms flown on a terrestrial suborbital rocket up to an altitude of approximately 100km. The navigation algorithm consists of an onboard extended Kalman Filter (EKF) that ingests multiple sensor measurements, one of which is the output from a terrain relative navigation (TRN) algorithm that cross-references camera images to on-board satellite imagery to perform feature correlation within the camera image. The guidance algorithm solves for a 6-degree-of-freedom (DoF) optimal trajectory using a successive convexification method during powered descent. The altitude range as well as the landing dynamics experienced during this test flight are realistic for an extraterrestrial landing and provide an invaluable data set to gauge the current development of these landing algorithms in an effort to advance the overall software readiness levels (SRL). This paper will delve into different aspects of each algorithm and present an analysis of the in-flight performance of the algorithms. This flight was conducted under the National Aeronautics and Space Administration (NASA) Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project focused on technology advancement for landing applications.

Guidance↗

ARQUIN: Architectures for Multinode Superconducting Quantum Computers

Many proposals to scale quantum technology rely on modular or distributed designs wherein individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, internode gates in these systems may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require improvements in entanglement generation, use of entanglement distillation, and optimized software and compilers. Still, it remains unclear what performance is possible with current hardware and what performance algorithms require. In this article, we employ a systems analysis approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. We show how to navigate tradeoffs in entanglement generation and distillation in the context of algorithm performance, lay out how compilers and software should balance between local and internode gates, and discuss when noisy quantum internode links have an advantage over purely classical links. Here, we find that a factor of 10–100× better link performance is required and introduce a research roadmap for the co-design of hardware and software towards the realization of early MNQCs. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Code for Experiment in Publication “Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations”

Following the Open Research requirements for AGU journals, we must release the code used to perform the experiment described in our recent publication, posted at (https://arxiv.org/abs/2312.04722). This code fits a joint emulator to data from a Discrete Fracture Network (DFN) simulation, performed using the open-source software DFNworks (https://dfnworks.lanl.gov/). All code to be released implements existing methods; there are no novel algorithms nor any major innovations to existing software.

Murph, Alexander↗

Code for Experiment in Publication “Determining the dominant factors for carbon-1 mineralization in three-dimensional fracture networks”

We plan to release the code used to perform the experiment described in our recent publication, entitled “Determining the dominant factors for carbon-1 mineralization in three-dimensional fracture networks.” This code fits a joint emulator to data from several Discrete Fracture Network (DFN) simulations, performed using the open-source software DFNworks (https://dfnworks.lanl.gov/). All code to be released implements existing methods; there are no novel algorithms nor any major innovations to existing software.

Murph, Alexander↗

Decentralized Signal Processing and Distributed Control of Collaborative Autonomous Networks (17-ERD-101 LDRD Final Report)

Intelligent autonomous sensor networks, often comprised of large numbers of sensors, must be capable of jointly exploiting data collected at each agent in the network, and using that data to optimize their future actions towards multiple mission objectives. Centralized signal processing and optimization solutions process all data and determine all future actions at a single agent, and the resulting information and commands are disseminated back to the network. The communications bandwidth this requires and the single point of failure the central agent represents often make these solutions untenable for national security applications. In this project, several fundamental algorithms for solving both the decentralized signal processing and network optimization were developed, as well as simulation software to validate the results of these algorithms at scale. Specifically, novel algorithms for Bayesian decentralized estimation and decentralized detection and optimization based on the alternating direction method of multipliers (ADMM) were developed for autonomous sensor networks and published in the literature. The first large scale simulation of autonomous sensor networks (1000 agents) was conducted on this project, validating the performance of the developed algorithms. These algorithms and simulation tools are critical components of any decentralized autonomous network and have current and future national security applications, including distributed sensor networks for detection, estimation, and tracking problems, and large decentralized cyber-physical infrastructure such as the power grid.

42 ENGINEERING↗

SmartTransit.AI: A Dynamic Paratransit and Microtransit Application

New rideshare and shared mobility services have transformed urban mobility in recent years. Such services have the potential to improve efficiency and reduce costs by allowing users to share rides in high-capacity vehicles and vans. Most transit agencies already operate various ridepooling services, including microtransit and paratransit. However, the objectives and constraints for implementing these services vary greatly between agencies and can be challenging. First, off-the-shelf ridepooling formulations must be adapted for real-world conditions and constraints. Second, the lack of modular and reusable software makes it hard to implement and evaluate new ridepooling algorithms and approaches in real-world settings. We demonstrate a modular on-demand public transportation scheduling software for microtransit and paratransit services. The software is aimed at transit agencies looking to incorporate state-of-the-art rideshare and ridepooling algorithms in their everyday operations. We provide management software for dispatchers and mobile applications for drivers and users and conclude with results from the demonstration in Chattanooga, TN.

Pavia, Sophie↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

KIVA-Update June 2012

Development of a fractional step, a Predictor-Corrector Split (PCS), or what is often known as a projection method combining hp-adaptive system in a Finite Element Method (FEM) for combustion modeling has been achieved. This model will advance the accuracy and range of applicability of the KIVA combustion model and software used typically for internal combustion engine modeling. This abstract describes a PCS hp-adaptive FEM model for turbulent reactive flow spanning all velocity regimes and fluids that is being developed for the new KIVA combustion algorithm, particularly for internal combustion engines. The method and general solver is applicable to Newtonian and non- Newtonian fluids and also for incompressible solids, porous media, solidification modeling, and fluid structure interaction problems. The fuel injection and injector modeling could easily benefit from the capability of solving the fluid structure interaction problem in an injector, helping to understand cycle to cycle variation and cavitation. This is just one example where the new algorithm differs from the old, in addition to handling Conjugate Heat Transfer (CHT), although there a numerous features that makes the new system more robust and accurate. In these ways, the PCS hp-adaptive algorithm does not compete with commercial software packages, those often used in conjunction with the currently distributed KIVA codes for engine combustion modeling. In addition, choosing a local ALE method on immersed moving parts represented by overset grid that is 2nd order spatially accurate, allows for easy grid generation from CAD to fluid grid while also provide for robustness in handling any possible moving parts configuration without any code modifications. The combined methods employed produce a minimal amount of computational effort as compared to fully resolved grids at the same accuracy. We demonstrate the solver on benchmark problems for the all flow regimes as follows: (1) 2-D backward-facing step using h-adaption, (2) 2-D driven cavity, (3) 2-D natural convection in a differentially heat cavity with h-adaptation, (4) NACA 0012 airfoil in 2-D, (5) supersonic flows over compression ramps, (6) 2-D natural convection in a differentially heat cavity with hp-adaptation, (7) 3-D natural convection in a differentially heat sphere with hp-adaptation. In addition, we show the new moving parts algorithm for working for a 2-D piston; the immersed moving parts method also for valves and pistons, vanes, etc... The movement is performed using an overset grid method and is 2nd order accurate in space, and never produces a tangle grid, that is, robust system at any resolution and any parts configuration. We also show CHT for the currently distributed KIVA-4mpi software and some fairly automatic grid generation using Sandia's Cubit unstructured grid generator. A new electronic web-based manual for KIVA-4 has been developed as well.

02 PETROLEUM↗

Process optimization of complex geometries using feed forward control for laser powder bed fusion additive manufacturing

Additive manufacturing (AM) enables the fabrication of complex designs that are difficult to create by other means. Metal parts manufactured by laser powder bed fusion (LPBF) can incorporate intricate design features and demonstrate desirable mechanical properties. However, printing a part that is qualified for its intended application often involves reprinting and discarding many parts to eliminate defects, improve dimensional accuracy, and increase repeatability. The process of iteratively converging on the appropriate build parameters increases the time and cost of creating functional LPBF manufactured parts. This work describes a fast, scalable method for part-scale process optimization of arbitrary geometries. Additionally, the computational approach uses feature extraction to identify scan vectors in need of parameter adaptation and applies results from simulation-based feed forward control models. This method provides a framework to quickly optimize complex parts through the targeted application of models with a range of fidelity and by automating the transfer of optimization strategies to new part designs. The computational approach and algorithmic framework are described, a software package is implemented, the method is applied to parts with complex features, and parts are printed on a customized open architecture LPBF machine.

3D printing↗

The OpenMC Monte Carlo particle transport code

A new Monte Carlo code called OpenMC is currently under development at the Massachusetts Institute of Technology as a tool for simulation on high-performance computing platforms. Given that many legacy codes do not scale well on existing and future parallel computer architectures, OpenMC has been developed from scratch with a focus on high performance scalable algorithms as well as modern software design practices. The present work describes the methods used in the OpenMC code and demonstrates the performance and accuracy of the code on a variety of problems.

Nuclear Science & Technology↗

Practical factors of envelope model setup and their effects on the performance of model predictive control for building heating, ventilating, and air conditioning systems

Model predictive control (MPC) for buildings is attracting significant attention in research and industry due to its potential to address a number of challenges facing the building industry, including energy cost reduction, grid integration, and occupant connectivity. However, the strategy has not yet been implemented at any scale, largely due to the significant effort required to configure and calibrate the model used in the MPC controller. While many studies have focused on methods to expedite model configuration and improve model accuracy, few have studied the impact a wide range of factors have on the accuracy of the resulting model. In addition, few have continued on to analyze these factors’ impact on MPC controller performance in terms of final operating costs. Therefore, this study first identifies the practical factors affecting model setup, specifically focusing on the thermal envelope. The seven that are identified are building design, model structure, model order, data set, data quality, identification algorithm and initial guesses, and software tool-chain. Then, through a large number of trials, it analyzes each factor's influence on model accuracy, focusing on grey-box models for a single zone building envelope. Finally, this study implements a subset of the models identified with these factor variations in heating, ventilating, and air conditioning MPC controllers, and tests them in simulation of a representative case that aims to optimally cool a single-zone building with time-varying electricity prices. It is found that a difference of up to 20%25 in cooling cost for the cases studied can occur between the best performing model and the worst performing model. The primary factors attributing to this were model structure and initial parameter guesses during parameter estimation of the model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A reusable neural network pipeline for unidirectional fiber segmentation

Abstract Fiber-reinforced ceramic-matrix composites are advanced, temperature resistant materials with applications in aerospace engineering. Their analysis involves the detection and separation of fibers, embedded in a fiber bed, from an imaged sample. Currently, this is mostly done using semi-supervised techniques. Here, we present an open, automated computational pipeline to detect fibers from a tomographically reconstructed X-ray volume. We apply our pipeline to a non-trivial dataset by Larson et al . To separate the fibers in these samples, we tested four different architectures of convolutional neural networks. When comparing our neural network approach to a semi-supervised one, we obtained Dice and Matthews coefficients reaching up to 98%, showing that these automated approaches can match human-supervised methods, in some cases separating fibers that human-curated algorithms could not find. The software written for this project is open source, released under a permissive license, and can be freely adapted and re-used in other domains.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum Computing and Visualization: A Disruptive Technological Change Ahead

The focus of this Visualization Viewpoints article is to provide some background on quantum computing (QC), to explore ideas related to how visualization helps in understanding QC, and examine how QC might be useful for visualization with the growth and maturation of both technologies in the future. In a quickly evolving technology landscape, QC is emerging as a promising pathway to overcome the growth limits in classical computing. In some cases, QC platforms offer the potential to vastly outperform the familiar classical computer by solving problems more quickly or that may be intractable on any known classical platform. As further performance gains for classical computing platforms are limited by diminishing Moore’s Law scaling, QC platforms might be viewed as a potential successor to the current field of exascale-class platforms. Importantly, while present-day QC hardware platforms are still limited in scale, the field of quantum computing is robust and rapidly advancing in terms of hardware capabilities, software environments for developing quantum algorithms, and educational programs for training the next generation of scientists and engineers. After a brief introduction to QC concepts, the focus of this article is to explore the interplay between the fields of visualization and QC. First, visualization has played a role in QC by providing the means to show representations of the quantum state of single-qubits in superposition states and multiple-qubits in entangled states. Second, there are a number of ways in which the field of visual data exploration and analysis may potentially benefit from this disruptive new technology though there are challenges going forward.

97 MATHEMATICS AND COMPUTING↗

More of an art than a science: Using microbial DNA sequences to compose music

Bacteria are everywhere. Microbial ecology is emerging as a critical field for understanding the relationships between these ubiquitous bacterial communities, the environment, and human health. Next generation DNA sequencing technology provides us a powerful tool to indirectly observe the communities by sequencing and analyzing all of the bacterial DNA present in an environment. The results of the DNA sequencing experiments can generate gigabytes to terabytes of information however, making it difficult for the citizen scientist to grasp and the educator to convey this data. Here, we present a method for interpreting massive amounts of microbial ecology data as musical performances, easily generated on any computer and using only commonly available or freely available software and the ‘Microbial Bebop’ algorithm. Furthermore, using this approach citizen scientists and biology educators can sonify complex data in a fun and interactive format, making it easier to communicate both the importance and the excitement of exploring the planet earth’s largest ecosystem.

59 BASIC BIOLOGICAL SCIENCES↗

Action Recommendation for Cyber Resilience

This paper presents an unifying graph-based model for representing the infrastructure, behavior and missions of an enterprise. We describe how the model can be used to achieve resiliency against a wide class of failures and attacks. We introduce an algorithm for recommending resilience establishing actions based on dynamic updates to the models. Without loss of generality, we show the effectiveness of the algorithm for preserving latency based quality of service (QoS). Our models and the recommendation algorithms are implemented in a software framework that we seek to release as an open source framework for simulating resilient cyber systems.

resilience, cyber security↗

Assessment of the Phase-to-Ground Fault Apparent Admittance Method with Phase/Ground Boundaries to Detect Types of Electrical Faults for Protective Relays Using Signature Library and Simulated Events

Protective relays in electric power grids recognize the types of electrical faults in a few seconds. The most common detection method to detect the types of electrical faults is based on measuring the angle between the zero and negative sequence currents. However, it is not completely accurate because the phase-to-phase-ground and phase-to-ground electrical faults could have the same detection conditions. Therefore, engineers need to plot the events after an electrical fault to observe the nature of the incidents in detail. In this study, the phase-to-ground fault apparent (PGFA) admittance method with phase/ground boundaries identified the types of electrical faults located in distribution power lines and feeders. This method was based on measuring the PGFA admittance magnitudes for the faulted and nonfaulted phases, resulting in greater than zero and near zero, respectively. The PGFA admittance algorithm was built with MATLAB/Simulink software and tested with signature library and grid simulation events. The PGFA method with phase/ground boundaries was evaluated with the confusion matrix. The measured and predicted values matched in more than 90% of the tests, and the PGFA admittance method with phase/ground boundaries presented an accuracy of 94.3% and a precision of 100%.

42 ENGINEERING↗

L-TERRA [SWR-15-34]

Lidar (light detection and ranging) instruments are often used in wind energy studies in place of meteorological towers, as they can collect measurements at higher heights than met towers and are more easily moved to different parts of a site. While lidars can accurately measure mean wind speeds, they frequently measure different values of turbulence intensity (TI) than would be measured by a cup anemometer on a tower. Discrepancies in TI values are caused by several factors, including instrument noise and volume averaging. The inability of lidars to accurately measure turbulence is a significant barrier to replacing met towers with lidars in the future. There is currently no accepted standard process for quantifying and removing these errors in lidar TI measurements. The Software is an error reduction algorithm for lidar-measured turbulence. The algorithm is trained using co-located lidar and meteorological tower data. Lidar-measured parameters, such as wind speed, shear, and TI, will be used to predict the difference between the lidar- and tower-measured TI. The algorithm will be disseminated as a set of computer code that can be used by lidar users and manufacturers to correct lidar TI data in real time or in post-processing.

Newman, Jennifer↗