Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms scalability”

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,423 records · Page 79

Constant-pH Molecular Dynamics Simulations for Large Biomolecular Systems

We report that an increasingly important endeavor is to develop computational strategies that enable molecular dynamics (MD) simulations of biomolecular systems with spontaneous changes in protonation states under conditions of constant pH. The present work describes our efforts to implement the powerful constant-pH MD simulation method, based on a hybrid nonequilibrium MD/Monte Carlo (neMD/MC) technique within the highly scalable program NAMD. The constant-pH hybrid neMD/MC method has several appealing features; it samples the correct semigrand canonical ensemble rigorously, the computational cost increases linearly with the number of titratable sites, and it is applicable to explicit solvent simulations. The present implementation of the constant-pH hybrid neMD/MC in NAMD is designed to handle a wide range of biomolecular systems with no constraints on the choice of force field. Furthermore, the sampling efficiency can be adaptively improved on-the-fly by adjusting algorithmic parameters during the simulation. Finally, illustrative examples emphasizing medium- and large-scale applications on next-generation supercomputing architectures are provided.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sipros Ensemble improves database searching and filtering for complex metaproteomics

Complex microbial communities can be characterized by metagenomics and metaproteomics. However, metagenome assemblies often generate enormous, and yet incomplete, protein databases, which undermines the identification of peptides and proteins in metaproteomics. This challenge calls for increased discrimination of true identifications from false identifications by database searching and filtering algorithms in metaproteomics. Sipros Ensemble was developed here for metaproteomics using an ensemble approach. Three diverse scoring functions from MyriMatch, Comet and the original Sipros were incorporated within a single database searching engine. Supervised classification with logistic regression was used to filter database searching results. Benchmarking with soil and marine microbial communities demonstrated a higher number of peptide and protein identifications by Sipros Ensemble than MyriMatch/Percolator, Comet/Percolator, MS-GF+/Percolator, Comet & MyriMatch/iProphet and Comet & MyriMatch & MS-GF+/iProphet. Sipros Ensemble was computationally efficient and scalable on supercomputers. Freely available under the GNU GPL license at http://sipros.omicsbio.org.

59 BASIC BIOLOGICAL SCIENCES↗

A Generalized Framework for Service Restoration in a Resilient Power Distribution System

An electric power grid is one of the complex infrastructures, and because of its complex nature, there is simply no way that outages can be completely avoided. Thus, a modern society that depends on reliable electric supply requires a resilient electric system that can recover from disruptions while integrating emerging smart grid technologies. Here, this article presents a novel approach for service restoration in a modern power distribution system with controllable switches and distributed generation (DG) resources for any kind of outage. The proposed framework supports both the traditional service restoration using feeder reconfiguration and the grid-forming DG-assisted intentional islands that are dynamically sized using algorithms based on the fault scenario, available resources, and priority of loads. The problem is formulated as a mixed-integer linear program that incorporates critical system connectivity and operating constraints. Simulations are performed to demonstrate the effectiveness of the proposed approach using a large-scale four-feeder 1069-bus three-phase unbalanced distribution test system. It is demonstrated that the framework is effective in utilizing all available resources in quickly restoring the power supply to improve resiliency during extreme events and is scalable for a large-scale unbalanced power distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization

One of the most complicating factors in decentralized solution methods for a broad range of power system optimization problems is the modeling of power flow equations. Existing formulations for direct current power flows either have limited scalability or are very dense and unstructured, making them unsuitable for large-scale decentralized studies. Here, in this work, we present a novel sparsified variant of the injection shift factors formulation, which has a decomposable block-diagonal structure and scales well for large systems. We also propose a decentralized solution method, based on the alternating direction multiplier method, that efficiently handles transmission line outages in N-1 security requirements. Benchmarks on multizonal security-constrained unit commitment problems show that the proposed formulation and algorithm can reliably and efficiently solve interconnection-level test systems with up to 6,515 buses with no convergence or numerical issues.

Alternating-method of multipliers (ADMM)↗

Active Learning Guided Computational Discovery of Plant-Based Redoxmers for Organic Nonaqueous Redox Flow Batteries

Organic nonaqueous redox flow batteries (ONRFBs) are promising energy storage devices due to their scalability and reliance on sourceable materials. However, finding suitable redox-active organic molecules (redoxmers) for these batteries remains a challenge. Using plant-based compounds as precursors for these redoxmers can decrease their costs and environmental toxicity. In this computational study, flavonoid molecules have been examined as potential redoxmers for ONRFBs. Flavone and isoflavone derivatives were selected as catholyte (positive charge carrier) and anolyte (negative charge carrier) molecules, respectively. To drive their redox potentials to the opposite extremes, in silico derivatization was performed using a novel algorithm to generate a library of > 40000 candidate molecules that penalizes overly complex structures. A multiobjective Bayesian optimization based active learning algorithm was then used to identify best redoxmer candidates in these search spaces. Furthermore, our study provides methodologies for molecular design and optimization of natural scaffolds and highlights the need of incorporating expert chemistry awareness of the natural products and the basic rules of synthetic chemistry in machine learning.

25 ENERGY STORAGE↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗

Smoothed particle hydrodynamics non-Newtonian model for ice-sheet and ice-shelf dynamics

Mathematical modeling of ice sheets is complicated by the non-linearity of the governing equations and boundary conditions. Standard grid-based methods require complex front tracking techniques and have limited capability to handle large material deformations and abrupt changes in bottom topography. As a consequence, numerical methods are usually restricted to shallow ice sheet and ice shelf approximations. We propose a new smoothed particle hydrodynamics (SPH) non-Newtonian model for coupled ice sheet and ice shelf dynamics. SPH, a fully Lagrangian particle method, is highly scalable and its Lagrangian nature and meshless discretization are well suited to the simulation of free surface flows, large material deformation, and material fragmentation. In this paper, SPH is used to study 3D ice sheet/ice shelf behavior, and the dynamics of the grounding line. The steady state position of the grounding line obtained from SPH simulations is in good agreement with laboratory observations for a wide range of simulated bedrock slopes, and density ratios, similar to those of ice and sea water. The numerical accuracy of the SPH algorithm is verif;ed by simulating Poiseuille flow, plane shear flow with free surface and the propagation of a blob of ice along a horizontal surface. In the laboratory experiment, the ice was represented with a viscous Newtonian fluid. In the present work, however, the ice is modeled as both viscous Newtonian fluid and non-Newtonian fluid, such that the effect of non-Newtonian rheology on the dynamics of grounding line was examined. The non-Newtonian constitutive relation is prescribed to be Glen’s law for the creep of polycrystalline ice. A V-shaped bedrock ramp is further introduced to model the real geometry of bedrock slope.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimal deployment of resources for maximizing impact in spreading processes

Significance Spreading processes play an increasingly important role in marketing, opinion setting, and epidemic modeling. Most existing algorithms for optimal resource allocation in spreading processes are based on topological characteristics of the underlying network and aim to maximize impact at infinite time. Clearly, realistic and efficient real-time allocation policies should consider both network properties and details of the dynamics; additionally, control may be applied only to a restricted set of accessible nodes, and impact should be maximized in a limited time window. We introduce a probabilistic targeting framework that incorporates the dynamics and encompasses previously considered optimization formulations. It is based on a scalable dynamic message-passing approach that allows for the solution of large real-world network instances.

60 APPLIED LIFE SCIENCES↗

Moment representation in the lattice Boltzmann method on massively parallel hardware

The widely-used lattice Boltzmann method (LBM) for computational fluid dynamics is highly scalable, but also significantly memory bandwidth-bound on current architectures. This paper presents a new regularized LBM implementation that reduces the memory footprint by only storing macroscopic, moment-based data. We show that the amount of data that must be stored in memory during a simulation is reduced by up to 47%. We also present a technique for cache-aware data re-utilization and show that optimizing cache utilization to limit data motion results in a similar improvement in time to solution. These new algorithms are implemented in the hemodynamics solver HARVEY and demonstrated using both idealized and realistic biological geometries. We develop a performance model for the moment representation algorithm and evaluate the performance on Summit.

Vardhan, Madhurima↗

A geometric initial guess for localized electronic orbitals in modular biological systems

Recent first-principles molecular dynamics algorithms using localized electronic orbitals have achieved O(N) complexity and controlled accuracy in simulating systems with finite band gaps. However, accurately deter- mining the centers of these localized orbitals during simulation setup may require O(N 3 ) operations, which is computationally infeasible for many biological systems. We present an O(N) approach for approximating orbital centers in proteins, DNA, and RNA which uses non-localized solutions for a set of fixed-size subproblems to create a set of geometric maps applicable to larger systems. This scalable approach, used as an initial guess in the O(N) first-principles molecular dynamics code MGmol, facilitates first-principles simulations in biological systems of sizes which were previously impossible.

59 BASIC BIOLOGICAL SCIENCES↗

A Smoothed Particle Hydrodynamics Model for Ice Sheet and Ice Shelf Dynamics

Mathematical modeling of ice sheets is complicated by the non-linearity of the governing equations and boundary conditions. Standard grid-based methods require complex front tracking techniques and have limited capability to handle large material deformations and abrupt changes in bottom topography. As a consequence, numerical methods are usually restricted to shallow ice sheet and ice shelf approximations. We propose a new smoothed particle hydrodynamics (SPH) model for coupled ice sheet and ice shelf dynamics. SPH is a fully Lagrangian particle method. It is highly scalable and its Lagrangian nature and meshless discretization are well suited to the simulation of free surface flows, large material deformation, and material fragmentation. In this paper SPH is used to study ice sheet/ice shelf behavior, and the dynamics of the grounding line. The steady state position of the grounding line obtained from the SPH simulations is in good agreement with laboratory observations for a wide range of simulated bedrock slopes, and density ratios similar to those of ice and sea water. The numerical accuracy of the SPH algorithm is further verified by simulating the plane shear flow of two immiscible fluids and the propagation of a highly viscous blob of fluid along a horizontal surface. In the experiment, the ice was represented with a viscous newtonian fluid. For consistency, in the described SPH model the ice is also modeled as a viscous newtonian fluid. Typically, ice sheets are modeled as a non-Newtonian fluid, accounting for the changes in the mechanical properties of ice. Implementation of a non-Newtonian rheology in the SPH model is the subject of our ongoing research.

54 ENVIRONMENTAL SCIENCES↗

A Comprehensive Solution for Managing TRU and LLW From Generation to Final Disposition - 13205

A LANL multi-disciplinary team faced the challenge of building and delivering a waste information system capable of managing radioactive, hazardous, and industrial waste from cradle to grave. The result is the Waste Compliance and Tracking System (WCATS) a flexible, adaptive system that has allowed LANL to consolidate its legacy applications into one system, and leverage the advantages of managing all waste types within a single scalable enterprise application. Key functionality required for robust waste operations, include: waste characterization, waste identification, transportation, inventory management, waste processing, and disposal. In order to maintain data quality, field operations such as waste identification, surveillance checklists, wall-to-wall inventory assessments, waste transfers, shipment pickup and receipt, and simple consolidation operations are captured by the operator or technician using mobile computers. Work flow is managed via end-user defined work paths, to ensure that unit operations are performed in the correct order. Regulatory compliance reports and algorithms are provided to support typical U.S. EPA, DOT, NRC, and DOE requirements, including the EPA hazardous waste manifest, NRC LLW manifest, DOE nuclear material at risk, RCRA TSDF inventory rules, and so forth. The WCATS application has allowed LANL to migrate and consolidate its disparate legacy applications. The design and implementation is generalized so that facility owners can customize the user interface, setup facilities and unit operations (i.e., treatment, storage, disposal, characterization, and administrative), define inventory compliance rules, and establish custom work flow requirements. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Scalable Nonlinear Compact Schemes

In this work, we focus on compact schemes resulting in tridiagonal systems of equations, specifically the fifth-order CRWENO scheme. We propose a scalable implementation of the nonlinear compact schemes by implementing a parallel tridiagonal solver based on the partitioning/substructuring approach. We use an iterative solver for the reduced system of equations; however, we solve this system to machine zero accuracy to ensure that no parallelization errors are introduced. It is possible to achieve machine-zero convergence with few iterations because of the diagonal dominance of the system. The number of iterations is specified a priori instead of a norm-based exit criterion, and collective communications are avoided. The overall algorithm thus involves only point-to-point communication between neighboring processors. Our implementation of the tridiagonal solver differs from and avoids the drawbacks of past efforts in the following ways: it introduces no parallelization-related approximations (multiprocessor solutions are exactly identical to uniprocessor ones), it involves minimal communication, the mathematical complexity is similar to that of the Thomas algorithm on a single processor, and it does not require any communication and computation scheduling.

97 MATHEMATICS AND COMPUTING↗

Autonomous In-space Construction, Maintenance, and Reconfiguration Using Programmable Meta-Material

NASA ARC's Coded Structures Laboratory (CSL) is developing autonomous construction, maintenance, and reconfiguration technologies to meet long-duration and deep space infrastructure needs, in accordance with long-term NASA goals of "in-space reliance" and "mass-less exploration." We seek to achieve these capabilities by utilizing a "programmable meta-material" approach that integrates emerging advances in materials (mechanical meta-materials), manufacturing (cooperative mobile robotics), and autonomy (multi-agent planning algorithms). Through the ARMADAS project, we have shown assembly of high-performance engineered cellular materials using multiple cooperating mobile robotic assemblers. In this paper, we describe how such a programmable meta-material architecture may shift the paradigm of how we design, build, manufacture, and operate future space infrastructure and assets. The core of a programmable meta-material architecture consists of 3 main technology sub-areas: the structure, the assembly agents, and the assembly algorithms. We co-design these systems to ensure an adaptable system that can create and reconfigure structures from a base set of building block components. From this core technology, we can branch out and expand the capability of the system through additional secondary component types and robotic agents to perform activities such as inspections, maintenance, repair, payload installation, or perform power and communications interconnect. As these technologies mature, future designers will be able to utilize the system to rapidly integrate and operate assets in space or on planetary surfaces from a set of well-tested part library, or create their own modules to integrate into the system. A core trait to the development of this system is the automation approach. Because of the modular and functional discrete (pixel-like) nature of the structural system, a diverse set of powerful algorithms for analysis, planning, and simulation can be adapted and leveraged to optimize construction, maintenance, and dynamic reorganization (as hardware with programmable form and function). With an ability to free the design space from launch vehicle constraints and fundamentally shift how a mission is designed and conducted, we discuss the influence of a programmable meta-material architecture on mission design, build, and operations. For the "design phase", we discuss project lifecycle effects, costs, time, and performance. For the "build phase", we discuss reusability, ISRU, manufacturing, material logistics, and scalability. And for "operations", we discuss autonomy, maintenance and upgrades, reliability, and reconfiguration. Autonomy and modularity are the primary enabling traits of this system. Engineering systems that utilize a modular and reconfiguration building block approach such as digital communication and computation systems, currently lead all other areas of technology in size and complexity scalability. NASA is extending the benefits and flexibility of digital systems to hardware systems, to optimize materials lifecycle management and expand our space exploration mission capabilities.

in space assembly↗

Evaluation of Portable Acceleration Solutions for LArTPC Simulation Using Wire-Cell Toolkit

The Liquid Argon Time Projection Chamber (LArTPC) technology plays an essential role in many current and future neutrino experiments. Accurate and fast simulation is critical to developing efficient analysis algorithms and precise physics model projections. The speed of simulation becomes more important as Deep Learning algorithms are getting more widely used in LArTPC analysis and their training requires a large simulated dataset. Heterogeneous computing is an efficient way to delegate computationally intensive tasks to specialized hardware. However, as the landscape of compute accelerators quickly evolves, it becomes increasingly difficult to manually adapt the code to the latest hardware or software environments. A solution which is portable to multiple hardware architectures without substantially compromising performance would thus be very beneficial, especially for long-term projects such as the LArTPC simulations. In search of a portable, scalable and maintainable software solution for LArTPC simulations, we have started to explore high-level portable programming frameworks that support several hardware backends. In this paper, we present our experience porting the LArTPC simulation code in the Wire-Cell Toolkit to NVIDIA GPUs, first with the CUDA programming model and then with a portable library called Kokkos. Preliminary performance results on NVIDIA V100 GPUs and multi-core CPUs are presented, followed by a discussion of the factors affiecting the performance and plans for future improvements.

Yu, Haiwang↗

Development and validation of two-phase flow models and critical heat flux prediction for the highly-scalable CFD code NEK-2P

A project is underway to develop, verify and validate an advanced two-phase flow modeling capability for the highly-scalable high-performance CFD code NEK5000[1]. The goal of the project is to develop a new two-phase version of the NEK5000code, named NEK-2P, to simulate the two-phase flow and heat transfer phenomena that occur in a Boiling Water Reactor (BWR) fuel bundle under various operating conditions. The NEK-2P two-phase flow models follow the approach used for the Extended Boiling Framework [2-3] previously developed at Argonne, but include more fundamental physical models of boiling phenomena and advanced numerical algorithms for improved computational accuracy, robustness, and computational speed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Comprehensive Comparison of Methods for Evaluating Dispatch of Long-Duration Energy Storage in Power Systems Models

Long-duration energy storage (LDES) could play a pivotal role in the transformation of electricity grids with high shares of variable renewable energy (VRE) such as solar and wind. However, the weather-dependent nature of VRE introduces challenges for grid balancing and stability, which LDES - along with short-duration energy storage (SDES) - can help address. However, modeling LDES in production cost models (PCMs) is particularly challenging due to the need for high temporal resolution over extended optimization windows while preserving chronology, which ensures the alignment of energy storage operations with VRE generation over multi-day periods. This report compares traditional dispatch methods with advanced LDES dispatch strategies, such as the extended horizon approach, across different PCM platforms and examines tradeoffs and scalability. The comparison reveals that the traditional 1-day optimization horizon within the PCM leads to inefficient utilization of LDES. In contrast, extending the optimization horizon as much as possible significantly reduces curtailment and improves storage dispatch, especially in renewable-dense systems. There is also promise in using state-of-charge or end volume targets set by an external model, however this requires an additional modeling set and generally increases computational burden. This paper presents a comparison of these various methods in a number of power systems, showing algorithms initially in small test systems and scaling up to large, country-wide simulations. Overall, the research presents the trade-offs of various computational methods and illustrates how LDES may play an essential role in power systems of the future.

14 SOLAR ENERGY↗