Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

A time optimal Space Station reboost guidance strategy

A closed-loop guidance strategy for time and fuel optimal reboost of Space Station Freedom is discussed in this paper. The reboost maneuver is formulated as an optimal control problem rather than a parameter optimization problem, the parameters being the thrust switching times. In the present approach the thrust switching structure need not be prescribed a priori to solve the resulting two point boundary value problem. Non-optimality of singular control or intermediate thrust is proved by utilizing the second order Kelley condition or the Generalized Legendre-Clebsch condition. Only a few sets of initial co-states and time-to-go guess values need to be stored on-board for a wide range of reboost scenarios.

Kumar, Renjith R.↗
NASA NTRS1993

A time-optimal Space Station reboost guidance strategy

A closed-loop guidance strategy for time and fuel optimal reboost of Space Station Freedom is discussed in this paper. The reboost maneuver is formulated as an optimal control problem rather than a parameter optimization problem, the parameters being the thrust switching times. In the present approach the thrust switching structure need not be prescribed a priori to solve the resulting two point boundary value problem. Non-optimality of singular control or intermediate thrust is proved by utilizing the second order Kelley condition or the Generalized Legendre-Clebsch condition. Only a few sets of initial co-states and time-to-go guess values need to be stored on-board for a wide range of reboost scenarios.

Kumar, Renjith R.↗
DOE OSTI2020

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

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.↗
NASA NTRS1991

Time-accurate finite difference solutions to the incompressible Navier-Stokes/energy equations

Two new algorithms for solving coupled Navier-Stokes and energy equations are presented. The algorithms are compared with available Navier-Stokes solutions for the model problem of a driven-cavity-flow over a range of Reynolds numbers. It is noted that the algorithms represent two different implementations of the fractional step approach to the solution of the coupled Navier-Stokes and energy equations using the Boussinesq approximation.

Mirfakhraee, Ali↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Oxidation-enhanced thermoelectric efficiency in a two-dimensional phosphorene oxide

We performed density functional theory calculations to investigate the thermoelectric properties of phosphorene oxide (PO) expected to form by spontaneous oxidation of phosphorene. Since thermoelectric features by nature arise from the consequences of the electron-phonon interaction, we computed the phonon-mediated electron relaxation time, which was fed into the semiclassical Boltzmann transport equation to be solved for various thermoelectric-related quantities. It was found that PO exhibits superior thermoelectric performance compared with its pristine counterpart, which has been proposed to be a candidate for the use of future thermoelectric applications. We revealed that spontaneous oxidation of phosphorene leads to a significant enhancement in the thermoelectric properties of n-doped phosphorene oxide, which is attributed to the considerable reduction of lattice thermal conductivity albeit a small decrease in electrical conductivity. Our results suggest that controlling oxidation may be utilized to improve thermoelectric performance in nanostructures, and PO can be a promising candidate for low-dimensional thermoelectric devices.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Data-driven based coordinated smart inverter control for distributed energy resources

Smart inverters (SI) for distributed energy resources (DER) are becoming popular since they have the ability to stabilize as well as restore the voltage and frequency of power systems. Aiming at establishing the mathematical models combined with SI control methods, multiple optimization methods are developed. However, the computational complexity of solving such a mathematical model with various uncertainties limits the real-time application of the SI control. To conquer this challenge, a data-driven-based SI control approach is developed to achieve coordinated control in the high penetration DER system. First, an optimization problem for maximizing the active power generation and minimizing the power loss is designed using the Volt/VAR control. To reduce the time consumption, the recurrent neural network (RNN) is proposed to model the relationship between the uncertainties and control actions during the offline site. The RNN with different sub-structures such as the long short-term memory cell and gated recurrent unit cell are included to enrich the diversity of features. In the last stage, different experiment comparisons, including multiple uncertainties maps and stateof- art machine learning methods, are conducted to verify the effectiveness of the proposed method based on the IEEE 123 bus power system. The results demonstrate that the proposed method can effectively achieve a rapid and coordinated control with a lower error rate.

Qiu, Wei↗
DOE OSTI2025

Convex relaxation for Fokker–Planck equation

We propose an approach to directly estimate the moments or marginals for a high-dimensional equilibrium distribution in statistical mechanics by solving the high-dimensional Fokker–Planck equation in terms of low-order cluster moments or marginals. With this approach, we bypass the exponential complexity of estimating the full high-dimensional distribution and directly solve the simplified partial differential equations for low-order moments/marginals. Moreover, the proposed moment/marginal relaxation is fully convex and can be solved via off-the-shelf solvers. We further propose a time-dependent version of the convex programs to study non-equilibrium dynamics. In a specific setting, we show the proposed method can recover a mean-field-type equilibrium density. Numerical results are provided to demonstrate the performance of the proposed algorithm for high-dimensional systems.

Chen, Yian↗
DOE OSTI2025

Two- and three-meson scattering amplitudes with physical quark masses from lattice QCD

We study systems of two and three mesons composed of pions and kaons at maximal isospin using four CLS ensembles with 𝑎 ≈ 0.063 fm, including one with approximately physical quark masses. Using the stochastic Laplacian-Heaviside method, we determine the energy spectrum of these systems including many levels in different momentum frames and irreducible representations. Using the relativistic two- and three-body finite-volume formalism, we constrain the two- and three-meson K matrices, including not only the leading 𝑠 wave, but also 𝑝 and 𝑑 waves. By solving the three-body integral equations, we determine, for the first time, the physical-point scattering amplitudes for 3⁢𝜋 + , 3⁢𝐾 + , 𝜋 + ⁢𝜋 + ⁢𝐾 + , and 𝐾 + ⁢𝐾 + ⁢𝜋 + systems. These are determined for total angular momentum 𝐽 𝑃 = 0 − , 1 + , and 2 − . We also obtain accurate results for 2⁢𝜋 + , 𝜋 + ⁢𝐾 + , and 2⁢𝐾 + phase shifts. We compare our results to chiral perturbation theory and to phenomenological fits.

FOS: Physical sciences↗
DOE OSTI2020

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗
DOE OSTI2021

Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework

A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Efficient CP Rounding Using Alternating Least Squares with QR Decomposition

The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Here, our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox's NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution.

CANDECOMP/PARAFAC↗
DOE OSTI2023

Creation of Synthetic Electric Grids (SPP/MISO) Supporting PERFORM (Final Report)

Over the course of the project, two “realistic but not real” synthetic transmission-level grid models over the SPP-MISO and ERCOT footprints were created to provide more realistic data and increase the reliability and resiliency of the grids under a variety of scenarios. The synthetic ERCOT transmission grid is compatible with the distribution grid developed in collaboration with NREL. All generators are based on the EIA 860 data and a column with EIA plant code and Gen ID is added to generators of both grids so that they can be easily mapped. The improvements are also made to electric grids including N-1 contingencies with some remedial actions, improving the transmission lines to avoid lines in lakes, including an HVDC line to the SPP-MISO case, providing several generator parameters and their temporal constraints that were not included in EIA 860 form, generators’ cost curves, load offer curves, adding phase shifters and tap changers with impedance correction tables, adding reactive power control and partitioning the grids into active and reactive reserve zones and determine different types of the required reserve for each zone. Hourly load time series at the bus level were generated to create scenarios for solving power flow in different loading conditions. Weather measurement information and the models of renewable generators are used to directly include the impact of weather on the grids. Based on a variety of load and weather conditions the grids are improved to accommodate different conditions. The ERCOT 7k-bus grids were also modeled for the year 2030 with predicted improvements in renewable resources. The renewable generation model was also improved with historic weather data included. The impact of electric vehicles on the ERCOT grid is also modeled.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1971

Fluid dynamics in flexible tubes: An application to the study of the pulmonary circulation

Based on an analysis of unsteady, viscous flow through distensible tubes, a lumped-parameter model for the dynamics of blood flow through the pulmonary vascular bed was developed. The model is nonlinear, incorporating the variation of flow resistance with transmural pressure. Solved using a hybrid computer, the model yields information concerning the time-dependent behavior of blood pressures, flow rates, and volumes in each important class of vessels in each lobe of each lung in terms of the important physical and environmental parameters. Simulations of twenty abnormal or pathological situations of interest in environmental physiology and clinical medicine were performed. The model predictions agree well with physiological data.

Kuchar, N. R.↗
NASA NTRS1972

Development of communications analysis techniques

Major results from the frequency analysis of system program (FASP) are reported. The FASP procedure was designed to analyze or design linear dynamic systems, but can be used to solve any problem that can be described by a system of linear time invariant differential equations. The program also shows plots of performance changes as design parameters are adjusted. Experimental results on narrowband FM distortion are also reported.

Shelton, R. D.↗