Search NASA⌕ Search

SEARCH · Search NASA

Results for “Semi-Definite”

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.

24 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

A fast Poisson solver for unsteady incompressible Navier-Stokes equations on the half-staggered grid

In this paper, a fast Poisson solver for unsteady, incompressible Navier-Stokes equations with finite difference methods on the non-uniform, half-staggered grid is presented. To achieve this, new algorithms for diagonalizing a semi-definite pair are developed. Our fast solver can also be extended to the three dimensional case. The motivation and related issues in using this second kind of staggered grid are also discussed. Numerical testing has indicated the effectiveness of this algorithm.

Golub, G. H.↗
NASA NTRS2005

Small Body GN&C Research Report: A Guidance and Control Technique for Small-Body Proximity Operations with Guaranteed Guidance Resolvability and Required Thruster Silent Time

The guidance and control (G&C) algorithms for enabling small-body proximity operations are developed by using a model predictive control approach along with a convexification of the governing dynamics, control constraints, and trajectory/state constraints. The open-loop guidance is solved ahead of time or in a resolvable, real-time manner through the use of PWG (Pseudo Way-point Generation), a technique developed in this research. The PWG scheme ensures required thruster silent times during trajectory maneuvers. The feedback control is implemented to track the PWG trajectories in a manner that guarantees the resolvability for the open-loop problem, enabling the ability to update the G&C in a model-predictive manner. The schemes incorporate gravity models and thruster ring times into discrete dynamics that are solved as a optimal control problem to minimize fuel consumption or thruster energy expenditure. The optimal control problem is cast as an LMI (Linear Matrix Inequality) and then solved through Semi-Definite Programming techniques in a computationally efficient manner that provides convergence and constraint guarantees.

guidance and control (G&C)↗
NASA NTRS2007

Algorithm Optimally Allocates Actuation of a Spacecraft

A report presents an algorithm that solves the following problem: Allocate the force and/or torque to be exerted by each thruster and reaction-wheel assembly on a spacecraft for best performance, defined as minimizing the error between (1) the total force and torque commanded by the spacecraft control system and (2) the total of forces and torques actually exerted by all the thrusters and reaction wheels. The algorithm incorporates the matrix vector relationship between (1) the total applied force and torque and (2) the individual actuator force and torque values. It takes account of such constraints as lower and upper limits on the force or torque that can be applied by a given actuator. The algorithm divides the aforementioned problem into two optimization problems that it solves sequentially. These problems are of a type, known in the art as semi-definite programming problems, that involve linear matrix inequalities. The algorithm incorporates, as sub-algorithms, prior algorithms that solve such optimization problems very efficiently. The algorithm affords the additional advantage that the solution requires the minimum rate of consumption of fuel for the given best performance.

Motaghedi, Shi↗
NASA NTRS2014

Development of Dynamic Sub-Grid Models for Variational Multiscale Methods

A dynamic Variational Multiscale Method (Hughes et al. 1998) is developed by leveraging the Germano procedure from classical Large-eddy Simulations (LES). The similarity between the classical and variational approaches is analyzed in the context of incompressible flow. This analysis leads to a consistent modeling approach for both incompressible and compressible flows, the latter being demonstrated in a priori testing for low-speed attached and separated boundary layers. Similar to the classical LES procedure from which it is derived, the variational dynamic procedure does not guarantee a positive semi-definite coefficient in the general case. However, reproducing the behavior of the classical LES dynamic approach is seen as a necessary first step to develop a VMM that automatically adjusts to the local resolution and flow physics.

Variational multiscale↗
DOE OSTI2022

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗
DOE OSTI2023

Measure This, Not That: Pareto Optimal Trade-Offs between Model-Based Information Content and Measurements Cost

The slides present a novel convex optimization formulation to compute the best set of measurements for multi-response dynamical systems with asynchronous time steps that maximize the Fisher information content subject to budget constraints. The trace (A-optimality) or determinant (D-optimality) of the Fisher Information Matrix (FIM) quantifies the information content. The framework supports arbitrary (positive semi-definite) variance and covariances between every pair of responses and their time steps.

Wang, Jialu↗