SEARCH · Engineering Papers

Results for “solution regularity”

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.

SourceResearch connectionFrom yearThrough year

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

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Quasinormal modes for non-minimally coupled scalar fields in regular black hole spacetimes: Grey-body factors, area spectrum and shadow radius

Black hole perturbation theory is a useful approach to study interactions between black holes and fundamental fields. A particular class of black hole solutions arising out of modification of Einstein’s general theory of relativity are regular black holes (RBHs) which can be constructed using a nonlinear electrodynamic Lagrangian. Because of their importance, we are interested in studying the behavior of three kinds of such RBHs under perturbations generated by an external field. Indeed, we investigate the quasinormal modes (QNMs) of a massive scalar field propagating near the RBHs which is non-minimally coupled to the Ricci scalar-tensor of background geometry. We will attempt to find the low-lying quasinormal frequencies of the perturbations by using WKB approximation. We shall also study the relationship between the QNMs and some characteristic properties of black holes such as grey-body factors, area quantization, and shadow radius.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1992

A time-accurate high-resolution TVD scheme for solving the Navier-Stokes equations

A total variation diminishing (TVD) scheme has been developed and incorporated into an existing time-accurate high-resolution Navier-Stokes code. The accuracy and the robustness of the resulting solution procedure have been assessed by performing many calculations in four different areas: shock tube flows, regular shock reflection, supersonic boundary layer, and shock boundary layer interactions. These numerical results compare well with corresponding exact solutions or experimental data.

Kim, Hyun Dae↗

NASA NTRS1993

A time-accurate high-resolution TVD scheme for solving the Navier-Stokes equations

Kim, Hyun D.↗

NASA NTRS1977

Recursive analytical solution describing artificial satellite motion perturbed by an arbitrary number of zonal terms

An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.

Mueller, A. C.↗

NASA NTRS1977

Over-relaxation applied to the MacCormack finite-difference scheme

An over-relaxation procedure is applied to the MacCormack finite-difference scheme in order to reduce the computation time required to obtain a steady-state solution. The implementation of this acceleration procedure to an existing computer program using the regular MacCormack method is extremely simple and does not require additional storage. The over-relaxation procedure does not alter the steady-state solution, which is second-order accurate. The method is first applied to Burgers' equation. A stability condition and an expression for the increase in the rate of convergence are derived. The method is then applied to the calculation of the hypersonic viscous flow over a flat plate, using the complete Navier-Stokes equations, and the inviscid flow over a wedge. Reductions in computing time by factors of 3 and 1.5, respectively, are obtained by over-relaxation.

Desideri, J.-A.↗

DOE OSTI2022

Kinetics-Informed Neural Networks

Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize feed-forward artificial neural networks as basis functions to solve ordinary differential equations (ODEs) constrained by differential algebraic equations (DAEs) that describe microkinetic models (MKMs). We present an algebraic framework for the mathematical description and classification of reaction networks, types of elementary reaction, and chemical species. Under this framework, we demonstrate that the simultaneous training of neural nets and kinetic model parameters in a regularized multi-objective optimization setting leads to the solution of the inverse problem through the estimation of kinetic parameters from synthetic experimental data. We analyze a set of scenarios to establish the extent to which kinetic parameters can be retrieved from transient kinetic data, and assess the robustness of the methodology with respect to statistical noise. Furthermore, this approach to inverse kinetic ODEs can assist in the elucidation of reaction mechanisms based on transient data.

36 MATERIALS SCIENCE↗

DOE OSTI2026

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Recipes for when physics fails: recovering robust learning of physics informed neural networks

Abstract Physics-informed neural networks (PINNs) have been shown to be effective in solving partial differential equations by capturing the physics induced constraints as a part of the training loss function. This paper shows that a PINN can be sensitive to errors in training data and overfit itself in dynamically propagating these errors over the domain of the solution of the PDE. It also shows how physical regularizations based on continuity criteria and conservation laws fail to address this issue and rather introduce problems of their own causing the deep network to converge to a physics-obeying local minimum instead of the global minimum. We introduce Gaussian process (GP) based smoothing that recovers the performance of a PINN and promises a robust architecture against noise/errors in measurements. Additionally, we illustrate an inexpensive method of quantifying the evolution of uncertainty based on the variance estimation of GPs on boundary data. Robust PINN performance is also shown to be achievable by choice of sparse sets of inducing points based on sparsely induced GPs. We demonstrate the performance of our proposed methods and compare the results from existing benchmark models in literature for time-dependent Schrödinger and Burgers’ equations.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1989

Euler procedure for three-dimensional transonic wall interference

Based on an optimization formulation, a procedure has been developed to evaluate Mach number and angle-of-attack corrections. The Euler equations are assumed to be the flow governing equations. To obtain efficient solutions for the optimization problem, the iterative solutions for the flow variables and the design parameters are simultaneously updated. In addition to the model lift and geometry, the procedure requires pressure measurements near the tunnel walls. The tunnel boundary conditions are based on the introduction of Reimann invariants for a one-dimensional flow normal to the boundary. Computations are performed to verify that the errors introduced by this approximate boundary-condition formulation are acceptably small. The correction scheme is applied to an aircraft configuration in an open jet. The results indicate that the optimization scheme is highly efficient with the rate of convergence of the flow solution nearly equal to the corresponding rate of a regular analysis problem.

Rizk, Magdi H.↗

NASA NTRS1990

Regularized Chapman-Enskog expansion for scalar conservation laws

Rosenau has recently proposed a regularized version of the Chapman-Enskog expansion of hydrodynamics. This regularized expansion resembles the usual Navier-Stokes viscosity terms at law wave-numbers, but unlike the latter, it has the advantage of being a bounded macroscopic approximation to the linearized collision operator. The behavior of Rosenau regularization of the Chapman-Enskog expansion (RCE) is studied in the context of scalar conservation laws. It is shown that thie RCE model retains the essential properties of the usual viscosity approximation, e.g., existence of traveling waves, monotonicity, upper-Lipschitz continuity..., and at the same time, it sharpens the standard viscous shock layers. It is proved that the regularized RCE approximation converges to the underlying inviscid entropy solution as its mean-free-path epsilon approaches 0, and the convergence rate is estimated.

Schochet, Steven↗

NASA NTRS1991

Optimal guidance law development for an advanced launch system

The proposed investigation on a Matched Asymptotic Expansion (MAE) method was carried out. It was concluded that the method of MAE is not applicable to launch vehicle ascent trajectory optimization due to a lack of a suitable stretched variable. More work was done on the earlier regular perturbation approach using a piecewise analytic zeroth order solution to generate a more accurate approximation. In the meantime, a singular perturbation approach using manifold theory is also under current investigation. Work on a general computational environment based on the use of MACSYMA and the weak Hamiltonian finite element method continued during this period. This methodology is capable of the solution of a large class of optimal control problems.

Calise, Anthony J.↗

NASA NTRS2006

Generative Representations for Computer-Automated Evolutionary Design

With the increasing computational power of computers, software design systems are progressing from being tools for architects and designers to express their ideas to tools capable of creating designs under human guidance. One of the main limitations for these computer-automated design systems is the representation with which they encode designs. If the representation cannot encode a certain design, then the design system cannot produce it. To be able to produce new types of designs, and not just optimize pre-defined parameterizations, evolutionary design systems must use generative representations. Generative representations are assembly procedures, or algorithms, for constructing a design thereby allowing for truly novel design solutions to be encoded. In addition, by enabling modularity, regularity and hierarchy, the level of sophistication that can be evolved is increased. We demonstrate the advantages of generative representations on two different design domains: the evolution of spacecraft antennas and the evolution of 3D objects.

Hornby, Gregory S.↗

DOE OSTI2025

Bridging the Gap Between Modern UX Design and Particle Accelerator Control Room Interfaces

Accelerator control systems often represent relatively complex and safety-sensitive human-machine interfaces within process control industries. These systems are technically robust and reflect the cumulative integration of solutions built and adapted across decades. One of the regular, unfortunate casualties of provisional accelerator control system updates is their human-system interfaces (HSIs) which often lag behind modern usability and design standards. An additional challenge is that although there is a multitude of established human factors (HF), and user experience (UX) principles for everyday digital applications, there are very few (if any) established principles for complex and safety-critical applications for an accelerator. This paper argues for the importance of established HF and UX principles (herein referred to as human-centered design principles) into the development of accelerator HSIs, emphasizing the need for clarity, consistency, responsiveness, and cognitive accessibility. Drawing from HF/UX best practices and human-centered design, this paper discusses how these approaches can enhance operator performance, reduce human error, and improve accelerator personnel collaboration. Case studies from Accelerator Control Operations Research Network (ACORN) at Fermilab are explored to demonstrate how interfaces built with human-centered design principles can scale with system complexity while remaining intuitive and efficient for diverse user roles including operators, machine experts, and engineers. By bridging the gap between traditional control system design and modern human-centered design methods, this paper provides a roadmap for evolving accelerator HSIs into more usable, maintainable, and effective tools.

Hill, Rachael [Idaho Natl. Lab.]↗

NASA NTRSDate not supplied

Conjunction Assessment and Deconfliction Paradigm for Co-Located Satellite Constellations With on-Spacecraft “Autonomous” Flight Dynamics Control

Satellite constellations that employ on-spacecraft flight dynamics and conjunction assessment (CA) approaches face particular challenges. First, they must arrange to obtain and upload to the constellation satellite close approach information, such as Conjunction Data Messages, so that their on-board systems will have the data they need to make informed CA decisions. Second, given current latencies in obtaining CA screening information, such systems often cannot obtain dedicated screenings of their proposed maneuvers before they are executed. Third, they usually cannot engage in real time with owner/operators (O/Os) with whom they may come into conjunction, relying instead on pre-arranged courses of action that may or may not fit a given situation well. Despite these difficulties, it is nonetheless possible, as operators such as SpaceX have demonstrated, to operate safely using on-board CA calculations, in the presence of a largely collaborative operating environment. The situation breaks down, however, when two constellations that operate with such a paradigm are placed in the same orbital region and will experience conjunctions with each other. Each may have a vague idea of where the other’s satellites are, or perhaps even a somewhat precise idea if they exchange O/O ephemerides, but neither will know the other’s more immediate maneuver intentions, especially for situations in which they are in a high-risk conjunction with each other and a mitigation maneuver is required. As there is no formalized way for these automated systems to ascertain each other’s intentions for this type of conjunction, it is quite possible that each spacecraft may choose a maneuver that results in the two objects’ colliding. An opportunity to develop a solution to this problem was presented by the NASA “Starling” project, a small experimental constellation developed to demonstrate autonomous satellite control and constellation reconfiguration and for which a launch was obtained that, serendipitously, will place this constellation close to the SpaceX Starlink constellation. Because the NASA constellation is experimental, an extended mission part of the mission has been negotiated to implement and test mechanisms for resolving the problem of co-located constellations with on-board flight dynamics control. For the last eighteen months, a consortium among NASA Ames (the Starling satellite providers), NASA CARA (the Agency organization responsible for conjunction assessment), Space X, and the Department of Commerce (in observer status) has met regularly to assemble a concept of operations for a robust solution to this problem and has developed a prototype ground node that will serve as a needed CA screening and information dispensary. The approach and methods, as well as the active employment of the developed ground node, will be tested both in simulation before actual use and then in actual spacecraft operations, which are anticipated to begin in January 2024. This paper will describe the co-located autonomously-controlled constellation problem and the developed solution in detail, outlining what ground node (i.e., government) infrastructure and features are required, what particular capabilities are needed by the constellations themselves in order to make use of this deconfliction paradigm, and the migration path forward to allow such a capability set to be incorporated by the Department of Commerce’s space traffic coordination system.

Conjunction Assessment↗

DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

NASA NTRS1998

Initial Results of an MDO Method Evaluation Study

The NASA Langley MDO method evaluation study seeks to arrive at a set of guidelines for using promising MDO methods by accumulating and analyzing computational data for such methods. The data are collected by conducting a series of re- producible experiments. In the first phase of the study, three MDO methods were implemented in the SIGHT: framework and used to solve a set of ten relatively simple problems. In this paper, we comment on the general considerations for conducting method evaluation studies and report some initial results obtained to date. In particular, although the results are not conclusive because of the small initial test set, other formulations, optimality conditions, and sensitivity of solutions to various perturbations. Optimization algorithms are used to solve a particular MDO formulation. It is then appropriate to speak of local convergence rates and of global convergence properties of an optimization algorithm applied to a specific formulation. An analogous distinction exists in the field of partial differential equations. On the one hand, equations are analyzed in terms of regularity, well-posedness, and the existence and unique- ness of solutions. On the other, one considers numerous algorithms for solving differential equations. The area of MDO methods studies MDO formulations combined with optimization algorithms, although at times the distinction is blurred. It is important to

Alexandrov, Natalia M.↗

NASA NTRS1957

Influence of Alloying upon Grain-Boundary Creep

Grain-boundary displacement, occurring in bicrystals during creep at elevated temperature (350 degrees c), has been measured as a function of the copper content (0.1 to 3 percent) in a series of aluminum-rich aluminum-copper solid-solution alloys. The minimums in stress and temperature, below which grain-boundary motion does not occur, increase regularly with the copper content as would be expected if recovery is necessary for movement. Otherwise, the effects, if any, of the copper solute upon grain-boundary displacement and its rate are too small for identification by the experimental technique employed. It was shown, additionally, that grain-boundary displacement appears regular and proceeds at a constant rate if observed parallel to the stress axis, whereas the motion is seen to occur in a sequence of surges and the rate to diminish with time if the observations are made perpendicular to the stress axis.

Rhines, F N↗

NASA NTRS2021

Error Propagation in Microwave Soil Moisture and Vegetation Optical Depth Retrievals

Satellite soil moisture and vegetation optical depth (VOD; related to the total vegetation water mass per unit area) are increasingly being used to study water relations in the soil-plant continuum across the globe. However, soil moisture and VOD are typically jointly estimated, where errors in the optimization approach can cause compensation between both variables and confound such studies. It is thus critical to quantify how satellite microwave measurement errors propagate into soil moisture and VOD. Such a study is especially important for VOD given limited investigations of whether VOD reflects in-situ plant physiology. Furthermore, despite new approaches that constrain (or regularize) VOD dynamics to reduce soil moisture errors, there is limited study of whether regularization reduces VOD errors without obscuring true vegetation temporal dynamics. Here, we find that, across the globe, VOD is less robust to measurement error (more difficult for optimization methods to find the true solution) than soil moisture in their joint estimation. However, a moderate degree of regularization (via time-constrained VOD) reduces errors in VOD to a greater degree than soil moisture and reduces spurious soil moisture-VOD coupling. Furthermore, despite constraining VOD time dynamics, regularized VOD variations on sub-weekly scales are both closer to simulated true VOD time series and have global VOD post-rainfall responses with reduced error signatures compared to VOD retrievals without regularization. Ultimately, we recommend moderately regularized VOD for use in large scale studies of soil-plant water relations because it suppresses noise and spurious soil moisture-VOD coupling without removing the physical signal.

Vegetation optical depth↗