Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics computing”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Summer High School Apprenticeship Research Program (SHARP)

The summer of 1997 will not only be noted by NASA for the mission to Mars by the Pathfinder but also for the 179 brilliant apprentices that participated in the SHARP Program. Apprentice participation increased 17% over last year's total of 153 participants. As indicated by the End-of-the-Program Evaluations, 96% of the programs' participants rated the summer experience from very good to excellent. The SHARP Management Team began the year by meeting in Cocoa Beach, Florida for the annual SHARP Planning Conference. Participants strengthened their Education Division Computer Aided Tracking System (EDCATS) skills, toured the world-renowned Kennedy Space Center, and took a journey into space during the Alien Encounter Exercise. The participants returned to their Centers with the same goals and objectives in mind. The 1997 SHARP Program goals were: (1) Utilize NASA's mission, unique facilities and specialized workforce to provide exposure, education, and enrichment experiences to expand participants' career horizons and inspire excellence in formal education and lifelong learning. (2) Develop and implement innovative education reform initiatives which support NASA's Education Strategic Plan and national education goals. (3) Utilize established statistical indicators to measure the effectiveness of SHARP's program goals. (4) Explore new recruiting methods which target the student population for which SHARP was specifically designed. (5) Increase the number of participants in the program. All of the SHARP Coordinators reported that the goals and objectives for the overall program as well as their individual program goals were achieved. Some of the goals and objectives for the Centers were: (1) To increase the students' awareness of science, mathematics, engineering, and computer technology; (2) To provide students with the opportunity to broaden their career objectives; and (3) To expose students to a variety of enrichment activities. Most of the Center goals and objectives were consistent with the overall program goals. Modem Technology Systems, Inc., was able to meet the SHARP Apprentices, Coordinators and Mentors during their site visits to Stennis Space Center, Ames Research Center and Dryden Flight Research Center. All three Centers had very efficient programs and adhered to SHARP's general guidelines and procedures. MTSI was able to meet the apprentices from the other Centers via satellite in July during the SHARP Video-Teleconference(ViTS). The ViTS offered the apprentices and the NASA and SHARP Coordinators the opportunity to introduce themselves. The apprentices from each Center presented topical "Cutting Edge Projects". Some of the accomplishments for the 1997 SHARP Program year included: MTSI hiring apprentices from four of the nine NASA Centers, the full utilization of the EDCATS by apprentices and NASA/SHARP Coordinators, the distribution of the SHARP Apprentice College and Scholarship Directory, a reunion with former apprentices from Langley Research Center and the development of a SHARP Recruitment Poster. MTSI developed another exciting newsletter containing graphics and articles submitted by the apprentices and the SHARP Management Team.

Source record↗
DOE OSTI2021

Blockchain-Enabled Cyber-Secure Microgrid Control Using Consensus Algorithm

This paper proposes a distributed control method based on a consensus algorithm for distributed energy resources (DERs) using blockchain as a secure communication medium for cyber resilience. Each DER communicates with a local blockchain server that is maintained by the distributed ledger technology to allow for securely sharing local measurements among neighbouring assets to achieve the global control objectives, i.e., voltage and frequency regulation as well as accurate power sharing among the DERs, including collective grid-forming capability. To prove that the distributed control can retain system stability under a blockchain-induced variable communication delay, Lyapunov function-based stability analysis is carried out. This paper demonstrates the concept on an 11-bus test case developed in MATLAB Simulink, which has been modified from the IEEE 9-bus test case, to study dynamic operations of the five inverter-based DERs working with a blockchain-induced variable delay. The results validate the superior performance of the proposed control method, compared to heavily compromised operations of the other test cases without the security measure, affected by heavy communication delays and communication interruptions.

blockchains↗
DOE OSTI2025

Selection of Global Climate Model Data for Downscaling With Generative Machine Learning and Use in the Power Planning for Alignment of Climate and Energy Systems Project

The range of results from climate models and scenarios is important to the understanding of uncertainty in power planning analysis. A U.S. Department of Energy-funded analytic project called Power Planning for Alignment of Climate and Energy Systems is developing data and analytic methods to reflect the effects of climate change on key variables for power system planning, as part of the Grid Modernization Lab Consortium. This project will select and prepare global climate model results for use in power system planning models. A related report (Evaluation of Global Climate Models for Use in Energy Analysis) assesses the performance of various global climate models from the Coupled Model Intercomparison Project Phase 6 data archive for their historical skill with respect to energy system performance and for their future projections under multiple climate change scenarios. Building from that report, we describe the selection of a climate scenario (Shared Socioeconomic Pathway [SSP] 2-4.5) and five climate models: TaiESM1, EC-Earth3-CC, GFDL-CM4, EC-Earth3-Veg, and MPI-ESM1-2-HR. We describe the model selection criteria, which were based on the quality of the match between model results under historical conditions and on the representation of the range of future values for several variables. These results will be downscaled via an open-source generative machine learning method called Super-Resolution for Renewable Energy Resource Data with Climate Change Impacts.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS2010

Modeling Flight: The Role of Dynamically Scaled Free-Flight Models in Support of NASA's Aerospace Programs

The state of the art in aeronautical engineering has been continually accelerated by the development of advanced analysis and design tools. Used in the early design stages for aircraft and spacecraft, these methods have provided a fundamental understanding of physical phenomena and enabled designers to predict and analyze critical characteristics of new vehicles, including the capability to control or modify unsatisfactory behavior. For example, the relatively recent emergence and routine use of extremely powerful digital computer hardware and software has had a major impact on design capabilities and procedures. Sophisticated new airflow measurement and visualization systems permit the analyst to conduct micro- and macro-studies of properties within flow fields on and off the surfaces of models in advanced wind tunnels. Trade studies of the most efficient geometrical shapes for aircraft can be conducted with blazing speed within a broad scope of integrated technical disciplines, and the use of sophisticated piloted simulators in the vehicle development process permits the most important segment of operations the human pilot to make early assessments of the acceptability of the vehicle for its intended mission. Knowledgeable applications of these tools of the trade dramatically reduce risk and redesign, and increase the marketability and safety of new aerospace vehicles. Arguably, one of the more viable and valuable design tools since the advent of flight has been testing of subscale models. As used herein, the term "model" refers to a physical article used in experimental analyses of a larger full-scale vehicle. The reader is probably aware that many other forms of mathematical and computer-based models are also used in aerospace design; however, such topics are beyond the intended scope of this document. Model aircraft have always been a source of fascination, inspiration, and recreation for humans since the earliest days of flight. Within the scientific community, Leonardo da Vinci, George Cayley, and the Wright brothers are examples of early aviation pioneers who frequently used models during their scientific efforts to understand and develop flying machines. Progress in the technology associated with model testing in worldwide applications has firmly established model aircraft as a key element in new aerospace research and development programs. Models are now routinely used in many applications and roles, including aerodynamic data gathering in wind tunnel investigations for the analysis of full-scale aircraft designs, proof-of-concept demonstrators for radical aeronautical concepts, and problem-solving exercises for vehicles already in production. The most critical contributions of aerospace models are to provide confidence and risk reduction for new designs and to enhance the safety and efficiency of existing configurations.

Chambers, Joseph↗
DOE OSTI2025

Adaptive Computing for Scale-Up Problems

Adaptive Computing is an application-agnostic outer loop framework to strategically deploy simulations and experiments to guide decision making for scale-up analysis. Resources are allocated over successive batches, which makes the allocation adaptive to some objective such as optimization or model training. The framework enables the characterization and management of uncertainties associated with predictive models of complex systems when scale-up questions lead to significant model extrapolation. A key advancement of this framework is its integration of multi-fidelity surrogate modeling, uncertainty management, and automated orchestration of various computing and experimentation resources into a single integrated software package. This enables efficient multi-fidelity modeling across multiple computing resources by incorporating real-world constraints such as relative queue times and throughput on individual machines into the multi-fidelity sampling decision. We discuss applications of this framework to problems in the renewable energy space, including biofuels production, material synthesis, perovskite crystal growth, and building electrical loads.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Demonstration Trials of AI/ML Edge+Cloud Suite (CRADA Final Report)

PACE AI and LBNL partnered under this CRADA to test and evaluate the PACE5 edge node prototype, an AI/ML edge and cloud-based suite, at FLEXLAB.The objective of the test was to evaluate the PACE5 edge node prototype's ability to perform demand shed and take to dynamic price signals, and to demonstrate advanced fault detection and microgrid monitoring capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Automated and Accelerated Continuum Model Development for Electrochemical Systems (Abbreviated Report)

Despite the availability of computational resources and advancements in numerical computing capabilities, the multiscale models core to understanding, predicting the behaviors of, and designing energy and environmental systems involving porous media are still 1.) developed through by-hand derivations and 2.) limited by many methodological assumptions employed during model derivation. As a result, the advancement of effective media models for engineering DOE mission-critical systems (e.g., batteries, flow batteries, electrolyzers, geothermal systems, subsurface chemical storage systems, etc.) is slow (i.e., it takes years for models to traverse from stages of “development” to “practical utilization”), hindering our ability to effectively optimize such systems and stay at the cutting-edge of the energy frontier. In this work, we aimed to address these limitations by 1.) automating and accelerating multiscale model derivation via symbolic computing and 2.) develop a novel multiscale modeling methodology for flow and transport through porous media that avoids the typical assumptions hindering previous models. As a result of our efforts, we 1.) developed a hybrid symbolic-numeric code called Fouriera for fully-automating the implementation of multiphysical and phase-field models via the Fourier spectral method for materials science research, and 2.) advanced a multiscale modeling methodology called The Method of Finite Averages that rigorously predicts the behaviors of flow and transport through heterogeneous porous media under the influence of non-local effects and strong advection. Ultimately, these deliverables provide strong foundations from which further efforts can advance multiscale modeling tools and capabilities that do not intrinsically rely on 1.) the speed and mathematical capabilities of humans, nor 2.) the methodological assumptions limiting current models.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Impact Report: Quantum Systems Accelerator

The Quantum Systems Accelerator (QSA) is a U.S. National Quantum Information Science Research Center established in August 2020 and funded by the Department of Energy (DOE) Office of Science. QSA is composed of 15 partner institutions— universities and national laboratories—bringing together pioneers of many of today’s unique quantum information science (QIS) and engineering capabilities. Led by Lawrence Berkeley National Laboratory (Berkeley Lab), with Sandia National Laboratories (Sandia Labs) as the lead partner, 250+ QSA researchers are catalyzing U.S. leadership in a fast-growing field that seeks solutions to the Nation’s and the world’s most pressing problems by harnessing the laws of quantum mechanics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Barren Plateaus Preclude Learning Scramblers

Scrambling processes, which rapidly spread entanglement through many-body quantum systems, are difficult to investigate using standard techniques, but are relevant to quantum chaos and thermalization. In this Letter, we ask if quantum machine learning (QML) could be used to investigate such processes. In this study we prove a no-go theorem for learning an unknown scrambling process with QML, showing that it is highly probable for any variational Ansatz to have a barren plateau landscape, i.e., cost gradients that vanish exponentially in the system size. This implies that the required resources scale exponentially even when strategies to avoid such scaling (e.g., from Ansatz -based barren plateaus or no-free-lunch theorems) are employed. Furthermore, we numerically and analytically extend our results to approximate scramblers. Hence, our work places generic limits on the learnability of unitaries when lacking prior information.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗
DOE OSTI2025

Machine Learning for Scalable and Optimal Load Shedding Under Power System Contingency

Prompt and effective corrective actions in response to unexpected contingencies are crucial for improving power system resilience and preventing cascading blackouts. The optimal load shedding (OLS) accounting for network limits has the potential to address the diverse system-wide impacts of contingency scenarios as compared to traditional local schemes. However, due to the fast cascading propagation of initial contingencies, real-time OLS solutions are challenging to attain in large systems with high computation and communication needs. In this paper, we propose a decentralized design that leverages offline training of a neural network (NN) model for individual load centers to autonomously construct the OLS solutions from locally available measurements. Our learning-for-OLS approach can greatly reduce the computation and communication needs during online emergency responses, thus preventing the cascading propagation of contingencies for enhanced power grid resilience. Numerical studies on both the IEEE 118-bus system and a synthetic Texas 2000-bus system have demonstrated the efficiency and effectiveness of our scalable OLS learning design for timely power system emergency operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Rozansky-Witten geometry of Coulomb branches and logarithmic knot invariants

By studying Rozansky-Witten theory with non-compact target spaces we find new connections with knot invariants whose physical interpretation was not known. Furthermore, this opens up several new avenues, which include a new formulation of q-series invariants of 3-manifolds in terms of affine Grassmannians and a generalization of Akutsu-Deguchi-Ohtsuki knot invariants.

97 MATHEMATICS AND COMPUTING↗