Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and theoretical developments”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Algorithms for real-time flutter identification

The work reported here addresses the important algorithm issues necessary to achieve a real-time flutter monitoring system; namely, the guidelines for choosing appropriate model forms, reduction of the parameter convergence transient, handling multiple modes, the effect of overparameterization, and estimate accuracy predictions, both online and for experiment design. An approach for efficiently computing continuous-time flutter parameter Cramer-Rao estimate error bounds has been developed. This enables a convincing comparison of theoretical and simulation results, as well as off-line studies in preparation for a flight test. Theoretical predictions, simulation and flight test results from the NASA/Dryden Drones for Aerodynamic and Structural Test (DAST) Program are compared.

Walker, R. A.↗
NASA NTRS1986

Analytical investigation of the dynamics of tethered constellations in Earth orbit, phase 2

The following topics related to the dynamics of the 4-mass tethered system are addressed: (1) the development of damping algorithms for damping the out-of-plane libration of the system and the interaction of the out-of-plane control with the other degrees of freedom; and (2) the development of environmental models to be added to the dynamics simulation computer code. The environmental models are specifically a new drag routine based on the Jacchia's 1977 model, a J(2) model and an accurate thermal model of the wire. Regarding topic (1) a survey of various out-of-plane libration control laws was carried out. Consequently a yo-yo control law with amplitude of the tether length variation proportional to the amplitude of the out-of-game libration has been selected. This control law provides good damping when applied to a (theoretical) two-dimensional system. In the actual 3-dimensional 4-mass tethered system, however, energy is transferred to the least damped degrees of freedom (the out-of-plane lateral deflections are still undamped in the present simulations) in such a way as to decrease the effectiveness of the algorithm for out-of-plane libration control. The addition of damping algorithms for the out-of-plane lateral deflections is therefore necessary.

Lorenzini, E. C.↗
DOE OSTI2025

Stochastic Adaptive Droop Control in Frequency Regulation of Power Systems With Intermittent Generators

Modern power systems (MPSs), including microgrids (MGs), are increasingly incorporating multiple renewable energy sources (RESs) such as wind and solar power, as well as battery storage and controllable loads. While environmentally beneficial, these sources pose challenges for control and management due to their intermittent and stochastic nature, especially in maintaining frequency stability with multiple interconnected generators of varying capacities. Traditional droop control methods are effective in systems with generators that are dispatchable and have fixed generation capacities, but they fall short when applied to systems with RESs, where generation capacities are dynamic and affected by unpredictable environmental conditions. To address these challenges, this paper introduces a novel stochastic adaptive droop control (SADC) method for load frequency control (LFC). The proposed method adapts droop coefficients in real time, based on the measured stochastic data of power generation capacities, enabling more effective frequency regulation in systems with variable and intermittent power generation. Unlike traditional adaptive control methods, which assume constant or slowly-varying system parameters, this approach accounts for stochastic processes by modeling them as Markov chains, enabling robust performance under highly dynamic and unpredictable conditions. The key contributions of this work include the development of real-time droop coefficient adaptation algorithms, derivation of their stability and convergence properties, and the demonstration of the advantages of the method through simulations. Case studies highlight the improved performance of frequency regulation, particularly in addressing the impact of stochastic weather conditions and the benefits of reducing dependence on battery reserves in dealing with intermittency of RESs. Finally, this paper provides a comprehensive analysis of the theoretical foundations of the method, as well as practical implementation insights for future power systems with high penetration of RESs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1984

Real-time flutter analysis

The important algorithm issues necessary to achieve a real time flutter monitoring system; namely, the guidelines for choosing appropriate model forms, reduction of the parameter convergence transient, handling multiple modes, the effect of over parameterization, and estimate accuracy predictions, both online and for experiment design are addressed. An approach for efficiently computing continuous-time flutter parameter Cramer-Rao estimate error bounds were developed. This enables a convincing comparison of theoretical and simulation results, as well as offline studies in preparation for a flight test. Theoretical predictions, simulation and flight test results from the NASA Drones for Aerodynamic and Structural Test (DAST) Program are compared.

Walker, R.↗
NASA NTRS2013

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Birge, Brian↗
NASA NTRS1991

Structural stereopsis - Potential for automatic stereo camera calibration

The paper describes the use of extended edge features as a source of primitives for structural stereopsis and considers the design of a system for autonomous camera calibration. It is shown that the structural approach permits greater use of spatial relational constraints, eliminating the coarse-to-fine tracking of point-based algorithms. Experimental results concerning matching and calibration on real images using Laplacian-of-Gaussian contour fragments as primitives in structural stereopsis are presented, and results in graph-theoretic representation and inexact matches, analytical photogrammetry, and other computer vision and image analysis problem domains are examined. Such a system might be used in aerial photogrammetry and cartography, and robotic vision systems; however, the system is still very much under development.

Boyer, Kim L.↗
NASA NTRS1998

Turbulent Radiation Effects in HSCT Combustor Rich Zone

A joint UTRC-University of Connecticut theoretical program was based on describing coupled soot formation and radiation in turbulent flows using stretched flamelet theory. This effort was involved with using the model jet fuel kinetics mechanism to predict soot growth in flamelets at elevated pressure, to incorporate an efficient model for turbulent thermal radiation into a discrete transfer radiation code, and to couple die soot growth, flowfield, and radiation algorithm. The soot calculations used a recently developed opposed jet code which couples the dynamical equations of size-class dependent particle growth with complex chemistry. Several of the tasks represent technical firsts; among these are the prediction of soot from a detailed jet fuel kinetics mechanism, the inclusion of pressure effects in the soot particle growth equations, and the inclusion of the efficient turbulent radiation algorithm in a combustor code.

Hall, Robert J.↗
NASA NTRS1983

A perspective of theoretical and applied computational fluid dynamics

The present effectiveness and future promise of computational fluid dynamics (CFD) are discussed. The CFD ideal of computer-designed flight vehicles and the progress that has been made toward its achievement, expressed in terms of primary and secondary pacing items, are also addressed. The primary pacing items listed by Chapman - grid generation, turbulence modeling, solution methodology development, and mainframe computer methods and architecture - are modified and reviewed. Important secondary pacing items in CFD development are also examined: algorithm development, complex geometry definition, and predata and postata processing. In addition, user requirements placed on CFD computer codes are defined and some problems associated with the dissemination of CFD technology are identified.

Kutler, P.↗
DOE OSTI2026

Machine learning approach for vibronically renormalized electronic band structures

Here, we present a machine learning (ML) method for efficient computation of vibrational thermal expectation values of physical properties from first principles. Our approach is based on the nonperturbative frozen phonon formulation in which stochastic Monte Carlo algorithm is employed to sample configurations of nuclei in a supercell at finite temperatures based on a first-principles phonon model. A deep-learning neural network is trained to accurately predict physical properties associated with sampled phonon configurations, thus bypassing the time-consuming ab initio calculations. To incorporate the point-group symmetry of the electronic system into the ML model, group-theoretical methods are used to develop a symmetry-invariant descriptor for phonon configurations in the supercell. We apply our ML approach to compute the temperature dependent electronic energy gap of silicon based on density functional theory (DFT). We show that, with less than a hundred DFT calculations for training the neural network model, an order of magnitude larger number of sampling can be achieved for the computation of the vibrational thermal expectation values. Our work highlights the promising potential of ML techniques for finite temperature first-principles electronic structure methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS2000

Annual Research Briefs - 2000: Center for Turbulence Research

This report contains the 2000 annual progress reports of the postdoctoral Fellows and visiting scholars of the Center for Turbulence Research (CTR). It summarizes the research efforts undertaken under the core CTR program. Last year, CTR sponsored sixteen resident Postdoctoral Fellows, nine Research Associates, and two Senior Research Fellows, hosted seven short term visitors, and supported four doctoral students. The Research Associates are supported by the Departments of Defense and Energy. The reports in this volume are divided into five groups. The first group largely consists of the new areas of interest at CTR. It includes efficient algorithms for molecular dynamics, stability in protoplanetary disks, and experimental and numerical applications of evolutionary optimization algorithms for jet flow control. The next group of reports is in experimental, theoretical, and numerical modeling efforts in turbulent combustion. As more challenging computations are attempted, the need for additional theoretical and experimental studies in combustion has emerged. A pacing item for computation of nonpremixed combustion is the prediction of extinction and re-ignition phenomena, which is currently being addressed at CTR. The third group of reports is in the development of accurate and efficient numerical methods, which has always been an important part of CTR's work. This is the tool development part of the program which supports our high fidelity numerical simulations in such areas as turbulence in complex geometries, hypersonics, and acoustics. The final two groups of reports are concerned with LES and RANS prediction methods. There has been significant progress in wall modeling for LES of high Reynolds number turbulence and in validation of the v(exp 2) - f model for industrial applications.

Source record↗
DOE OSTI2020

Time-stepping DPG formulations for the heat equation

For a wide range of PDEs, the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan provides discrete stability starting from a coarse mesh and minimization of the residual in a user-controlled norm, among other appealing features. Research on DPG for transient problems has mainly focused on spacetime discretizations, which has theoretical advantages, but practical costs for computations and software implementations. The sole examination of time-stepping DPG formulations was performed by Führer, Heuer, and Gupta, who applied Rothe’s method to an ultraweak formulation of the heat equation to develop an implicit time-stepping scheme; their work emphasized theoretical results, including error estimates in time and space. Here, we follow Führer, Heuer, and Gupta in examining the heat equation; our focus is on numerical experiments, examining the stability and accuracy of several formulations, including primal as well as ultraweak, and explicit as well as implicit and Crank–Nicolson time-stepping schemes. We are additionally interested in communication-avoiding algorithms, and we therefore include a highly experimental formulation that places all the trace terms on the right-hand side of the equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimization and Multimachine Learning Algorithms to Predict Nanometal Surface Area Transfer Parameters for Gold and Silver Nanoparticles

Interactions between gold metallic nanoparticles and molecular dyes have been well described by the nanometal surface energy transfer (NSET) mechanism. However, the expansion and testing of this model for nanoparticles of different metal composition is needed to develop a greater variety of nanosensors for medical and commercial applications. In this study, the NSET formula was slightly modified in the size-dependent dampening constant and skin depth terms to allow for modeling of different metals as well as testing the quenching effects created by variously sized gold, silver, copper, and platinum nanoparticles. Overall, the metal nanoparticles followed more closely the NSET prediction than for Förster resonance energy transfer, though scattering effects began to occur at 20 nm in the nanoparticle diameter. To further improve the NSET theoretical equation, an attempt was made to set a best-fit line of the NSET theoretical equation curve onto the Au and Ag data points. An exhaustive grid search optimizer was applied in the ranges for two variables, 0.1≤C≤2.0 and 0≤α≤4, representing the metal dampening constant and the orientation of donor to the metal surface, respectively. Three different grid searches, starting from coarse (entire range) to finer (narrower range), resulted in more than one million total calculations with values C=2.0 and α=0.0736. The results improved the calculation, but further analysis needed to be conducted in order to find any additional missing physics. With that motivation, two artificial intelligence/machine learning (AI/ML) algorithms, multilayer perception and least absolute shrinkage and selection operator regression, gave a correlation coefficient, R2, greater than 0.97, indicating that the small dataset was not overfitting and was method-independent. This analysis indicates that an investigation is warranted to focus on deeper physics informed machine learning for the NSET equations.

Demers, Steven M. E. (ORCID:0000000192213246)↗
NASA NTRSDate not supplied

Standardizing Algorithm Documentation For Improved Scientific Data Understanding: The Algorithm Publication Tool Prototype

Algorithm Theoretical Basis Documents (ATBDs) are documents which accompany Earth observation data products generated from algorithms. While ATBDs are essential to scientific reproducibility, these key documents are not standardized and are often difficult to find. In this paper, we present the prototype Algorithm Publication Tool (APT), a cloud-based ATBD authoring and editing tool for NASA’s Earth science data systems. A standardized ATBD information model is also described as well as lessons learned from developing the prototype tool.

Kaylin Bugbee↗
NASA NTRSDate not supplied

Enhancing accessibility and usability of Algorithm Theoretical Basis Documents through the Algorithm Publication Tool

Effective communication of scientific theories is crucial for transforming raw instrument data into valuable Earth observation products. The NASA Earth science data community disseminates this knowledge through Algorithm Theoretical Basis Documents (ATBDs). Historically, these documents lacked a standardized format, were designed for human readability rather than machine interpretation, and were challenging to locate due to the absence of a centralized repository. The Algorithm Publication Tool (APT) transforms how ATBD content is presented, simplifying the processes of creating, updating, and locating these documents. APT offers authors the option to use its user-friendly cloud-based interface or standardized templates for ATBD development. The primary advantage of the interface is its capability to manage the entire ATBD creation process within a single environment, ensuring comprehensive tracking of all activities and facilitating user tasks. Conversely, the use of standardized ATBD templates allows users to create documents using familiar tools like Google Docs, Microsoft Word, or Overleaf for LaTeX. APT also provides a centralized repository, enabling easy search and discovery of published ATBDs. This presentation showcases APT's functionalities, illustrates its contributions to advancing open science, and highlights potential benefits for broader community adoption.

Bradley Baker↗
DOE OSTI2023

The learnability of Pauli noise

Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today’s quantum devices. A fundamental issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question what information is learnable and what is not, which is unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates using graph theoretical tools. Our results reveal the optimality of cycle benchmarking in the sense that it can extract all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM’s CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we show that an attempt to extract unlearnable information by ignoring state preparation noise yields unphysical estimates, which is used to lower bound the state preparation noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Modified optimal control pilot model for computer-aided design and analysis

This paper presents the theoretical development of a modified optimal control pilot model based upon the optimal control model (OCM) of the human operator developed by Kleinman, Baron, and Levison. This model is input compatible with the OCM and retains other key aspects of the OCM, such as a linear quadratic solution for the pilot gains with inclusion of control rate in the cost function, a Kalman estimator, and the ability to account for attention allocation and perception threshold effects. An algorithm designed for each implementation in current dynamic systems analysis and design software is presented. Example results based upon the analysis of a tracking task using three basic dynamic systems are compared with measured results and with similar analyses performed with the OCM and two previously proposed simplified optimal pilot models. The pilot frequency responses and error statistics obtained with this modified optimal control model are shown to compare more favorably to the measured experimental results than the other previously proposed simplified models evaluated.

Davidson, John B.↗