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,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
NASA NTRS2015

A Tool for Model-Based Generation of Scenario-driven Electric Power Load Profiles

Power consumption during all phases of spacecraft flight is of great interest to the aerospace community. As a result, significant analysis effort is exerted to understand the rates of electrical energy generation and consumption under many operational scenarios of the system. Previously, no standard tool existed for creating and maintaining a power equipment list (PEL) of spacecraft components that consume power, and no standard tool existed for generating power load profiles based on this PEL information during mission design phases. This paper presents the Scenario Power Load Analysis Tool (SPLAT) as a model-based systems engineering tool aiming to solve those problems. SPLAT is a plugin for MagicDraw (No Magic, Inc.) that aids in creating and maintaining a PEL, and also generates a power and temporal variable constraint set, in Maple language syntax, based on specified operational scenarios. The constraint set can be solved in Maple to show electric load profiles (i.e. power consumption from loads over time). SPLAT creates these load profiles from three modeled inputs: 1) a list of system components and their respective power modes, 2) a decomposition hierarchy of the system into these components, and 3) the specification of at least one scenario, which consists of temporal constraints on component power modes. In order to demonstrate how this information is represented in a system model, a notional example of a spacecraft planetary flyby is introduced. This example is also used to explain the overall functionality of SPLAT, and how this is used to generate electric power load profiles. Lastly, a cursory review of the usage of SPLAT on the Cold Atom Laboratory project is presented to show how the tool was used in an actual space hardware design application.

power load profile↗
NASA NTRS2019

Modeling Mg II During Solar Flares. II. Nonequilibrium Effects

To extract the information that the Mg II NUV spectra (observed by the Interface Region Imaging Spectrograph) carry about the chromosphere during solar flares, and to validate models of energy transport via model–data comparison, forward modeling is required. The assumption of statistical equilibrium (SE) is typically used to obtain the atomic level populations from snapshots of flare atmospheres, due to computational necessity. However, it is possible that relying on SE could lead to spurious results. We compare solving the atomic level populations via SE versus a non-equilibrium (NEQ) time-dependent approach. This was achieved using flare simulations from RADYN alongside the minority species version MS_RADYN from which the time-dependent Mg II atomic level populations and radiation transfer were computed in complete frequency redistribution. The impacts on the emergent profiles, light curves, line ratios, and formation heights are discussed. In summary we note that NEQ effects during flares are typically important only in the initial stages and for a short period following the cessation of the energy injection. An analysis of the timescales of ionization equilibrium reveals that for most of the duration of the flare, when the temperatures and densities are sufficiently enhanced, the relaxation timescales are short (τrelax < 0.1 s), so that the equilibrium solution is an adequate approximation. These effects vary with the size of the flare, however. In weaker flares, effects can be more pronounced. We recommend that NEQ effects be considered when possible but that SE is sufficient at most stages of the flare.

Kerr, Graham S.↗
NASA NTRS2020

Machine Learning For Planetary Mining Applications

Robotic mining could prove to be an efficient method of mining resources for extended missions on the Moon or Mars. One component of robotic mining is scouting an area for resources to be mined by other robotic systems. Writing controllers for scouting can be difficult due to the need for fault tolerance, inter-agent cooperation, and agent problem solving. Reinforcement learning could solve these problems by enabling the scouts to learn to improve their performance over time. This work is divided into two sections, with each section addressing the use of machine learning in this domain. The first contribution of this work focuses on the application of reinforcement learning to mining mission analysis. Various mission parameters were modified and control policies were learned. Then agent performance was used to assess the effect of the mission parameters on the performance of the mission. The second contribution of this work explores the potential use of reinforcement learning to learn a controller for the scouts. Through learning, these scouts would improve their ability to map their surroundings over time.

Cook, Joshua↗
NASA NTRS1977

Computation of unsteady transonic flows by the indicial method

The indicial method is investigated for the computation of unsteady transonic force and moment coefficients for use in flutter analyses. This approach has the advantage that solutions for all reduced frequencies for a given mode of motion can be obtained from a single finite-difference flowfield computation. Comparisons of indicial and time-integration computations for oscillating airfoil and flap motions help define limits on the motion amplitude for the applicability of the indicial method to transonic flows. Within these limits, solutions for various motion modes can be superposed to obtain solutions for multiple-degree-of-freedom aeroelastic systems. Also, a simple aeroelastic problem is solved by an alternative approach in which the structural motion and flowfield equations are integrated simultaneously using a time-integration finite-difference procedure.

Ballhaus, W. F.↗
NASA NTRS1997

Visualization of Unsteady Computational Fluid Dynamics

The current compute environment that most researchers are using for the calculation of 3D unsteady Computational Fluid Dynamic (CFD) results is a super-computer class machine. The Massively Parallel Processors (MPP's) such as the 160 node IBM SP2 at NAS and clusters of workstations acting as a single MPP (like NAS's SGI Power-Challenge array and the J90 cluster) provide the required computation bandwidth for CFD calculations of transient problems. If we follow the traditional computational analysis steps for CFD (and we wish to construct an interactive visualizer) we need to be aware of the following: (1) Disk space requirements. A single snap-shot must contain at least the values (primitive variables) stored at the appropriate locations within the mesh. For most simple 3D Euler solvers that means 5 floating point words. Navier-Stokes solutions with turbulence models may contain 7 state-variables. (2) Disk speed vs. Computational speeds. The time required to read the complete solution of a saved time frame from disk is now longer than the compute time for a set number of iterations from an explicit solver. Depending, on the hardware and solver an iteration of an implicit code may also take less time than reading the solution from disk. If one examines the performance improvements in the last decade or two, it is easy to see that depending on disk performance (vs. CPU improvement) may not be the best method for enhancing interactivity. (3) Cluster and Parallel Machine I/O problems. Disk access time is much worse within current parallel machines and cluster of workstations that are acting in concert to solve a single problem. In this case we are not trying to read the volume of data, but are running the solver and the solver outputs the solution. These traditional network interfaces must be used for the file system. (4) Numerics of particle traces. Most visualization tools can work upon a single snap shot of the data but some visualization tools for transient problems require dealing with time.

Haimes, Robert↗
NASA NTRS2001

Temporal Constraint Reasoning With Preferences

A number of reasoning problems involving the manipulation of temporal information can naturally be viewed as implicitly inducing an ordering of potential local decisions involving time (specifically, associated with durations or orderings of events) on the basis of preferences. For example. a pair of events might be constrained to occur in a certain order, and, in addition. it might be preferable that the delay between them be as large, or as small, as possible. This paper explores problems in which a set of temporal constraints is specified, where each constraint is associated with preference criteria for making local decisions about the events involved in the constraint, and a reasoner must infer a complete solution to the problem such that, to the extent possible, these local preferences are met in the best way. A constraint framework for reasoning about time is generalized to allow for preferences over event distances and durations, and we study the complexity of solving problems in the resulting formalism. It is shown that while in general such problems are NP-hard, some restrictions on the shape of the preference functions, and on the structure of the preference set, can be enforced to achieve tractability. In these cases, a simple generalization of a single-source shortest path algorithm can be used to compute a globally preferred solution in polynomial time.

Khatib, Lina↗
NASA NTRS1997

Multistage Schemes with Multigrid for Euler and Navier-Strokes Equations: Components and Analysis

A class of explicit multistage time-stepping schemes with centered spatial differencing and multigrids are considered for the compressible Euler and Navier-Stokes equations. These schemes are the basis for a family of computer programs (flow codes with multigrid (FLOMG) series) currently used to solve a wide range of fluid dynamics problems, including internal and external flows. In this paper, the components of these multistage time-stepping schemes are defined, discussed, and in many cases analyzed to provide additional insight into their behavior. Special emphasis is given to numerical dissipation, stability of Runge-Kutta schemes, and the convergence acceleration techniques of multigrid and implicit residual smoothing. Both the Baldwin and Lomax algebraic equilibrium model and the Johnson and King one-half equation nonequilibrium model are used to establish turbulence closure. Implementation of these models is described.

Swanson, R. C.↗
NASA NTRS1993

An approach to the design of operations systems

The MultiMission Control Team (MMCT) consists of mission controllers which provides Real-Time operations support for the Mars Observer project. The Real-Time Operations task is to insure the integrity of the ground data system, to insure that the configuration is correct to support the mission, and to monitor the spacecraft for the Spacecraft Team. Operations systems are typically developed by adapting operations systems from previous projects. Problems tend to be solved empirically when they are either anticipated or observed in testing. This development method has worked in the past when time was available for extensive Ops testing. In the present NASA budget environment, a more cost conscious design approach has become necessary. Cost is a concern because operations is an ongoing, continuous activity. Reducing costs entails reducing staff. Reducing staffing levels potentially increases the risk of mission failure. Therefore, keeping track of the risk level is necessary.

Chafin, Roy L.↗
NASA NTRS2010

High-Speed Solution of Spacecraft Trajectory Problems Using Taylor Series Integration

It has been known for some time that Taylor series (TS) integration is among the most efficient and accurate numerical methods in solving differential equations. However, the full benefit of the method has yet to be realized in calculating spacecraft trajectories, for two main reasons. First, most applications of Taylor series to trajectory propagation have focused on relatively simple problems of orbital motion or on specific problems and have not provided general applicability. Second, applications that have been more general have required use of a preprocessor, which inevitably imposes constraints on computational efficiency. The latter approach includes the work of Berryman et al., who solved the planetary n-body problem with relativistic effects. Their work specifically noted the computational inefficiencies arising from use of a preprocessor and pointed out the potential benefit of manually coding derivative routines. In this Engineering Note, we report on a systematic effort to directly implement Taylor series integration in an operational trajectory propagation code: the Spacecraft N-Body Analysis Program (SNAP). The present Taylor series implementation is unique in that it applies to spacecraft virtually anywhere in the solar system and can be used interchangeably with another integration method. SNAP is a high-fidelity trajectory propagator that includes force models for central body gravitation with N X N harmonics, other body gravitation with N X N harmonics, solar radiation pressure, atmospheric drag (for Earth orbits), and spacecraft thrusting (including shadowing). The governing equations are solved using an eighth-order Runge-Kutta Fehlberg (RKF) single-step method with variable step size control. In the present effort, TS is implemented by way of highly integrated subroutines that can be used interchangeably with RKF. This makes it possible to turn TS on or off during various phases of a mission. Current TS force models include central body gravitation with the J2 spherical harmonic, other body gravitation, thrust, constant atmospheric drag from Earth's atmosphere, and solar radiation pressure for a sphere under constant illumination. The purpose of this Engineering Note is to demonstrate the performance of TS integration in an operational trajectory analysis code and to compare it with a standard method, eighth-order RKF. Results show that TS is 16.6 times faster on average and is more accurate in 87.5% of the cases presented.

Scott, James R.↗
NASA NTRS1978

Finite element concepts in computational aerodynamics

Finite element theory was employed to establish an implicit numerical solution algorithm for the time averaged unsteady Navier-Stokes equations. Both the multidimensional and a time-split form of the algorithm were considered, the latter of particular interest for problem specification on a regular mesh. A Newton matrix iteration procedure is outlined for solving the resultant nonlinear algebraic equation systems. Multidimensional discretization procedures are discussed with emphasis on automated generation of specific nonuniform solution grids and accounting of curved surfaces. The time-split algorithm was evaluated with regards to accuracy and convergence properties for hyperbolic equations on rectangular coordinates. An overall assessment of the viability of the finite element concept for computational aerodynamics is made.

Baker, A. J.↗
NASA NTRS2000

Information Power Grid: Distributed High-Performance Computing and Large-Scale Data Management for Science and Engineering

The term "Grid" refers to distributed, high performance computing and data handling infrastructure that incorporates geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. The vision for NASN's Information Power Grid - a computing and data Grid - is that it will provide significant new capabilities to scientists and engineers by facilitating routine construction of information based problem solving environments / frameworks that will knit together widely distributed computing, data, instrument, and human resources into just-in-time systems that can address complex and large-scale computing and data analysis problems. IPG development and deployment is addressing requirements obtained by analyzing a number of different application areas, in particular from the NASA Aero-Space Technology Enterprise. This analysis has focussed primarily on two types of users: The scientist / design engineer whose primary interest is problem solving (e.g., determining wing aerodynamic characteristics in many different operating environments), and whose primary interface to IPG will be through various sorts of problem solving frameworks. The second type of user if the tool designer: The computational scientists who convert physics and mathematics into code that can simulate the physical world. These are the two primary users of IPG, and they have rather different requirements. This paper describes the current state of IPG (the operational testbed), the set of capabilities being put into place for the operational prototype IPG, as well as some of the longer term R&D tasks.

Johnston, William E.↗
NASA NTRS2010

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

Current renewed interest in exploration of the moon, Mars, and other planetary objects is driving technology development in many fields of space system design. In particular, there is a desire to land both robotic and human missions on the moon and elsewhere. The landing guidance system must be able to deliver the vehicle to a desired soft landing while meeting several constraints necessary for the safety of the vehicle. Due to performance limitations of current launch vehicles, it is desired to minimize the amount of fuel used. In addition, the landing site may change in real-time in order to avoid previously undetected hazards which become apparent during the landing maneuver. This complicated maneuver can be broken into simpler subproblems that bound the full problem. One such subproblem is to find a minimum-fuel landing solution that meets constraints on the initial state, final state, and bounded thrust acceleration magnitude. With the assumptions of constant gravity and negligible atmosphere, the form of the optimal steering law is known, and the equations of motion can be integrated analytically, resulting in a system of five equations in five unknowns. It is shown that this system of equations can be reduced analytically to two equations in two unknowns. With an additional assumption of constant thrust acceleration magnitude, this system can be reduced further to one equation in one unknown. It is shown that these unknowns can be bounded analytically. An algorithm is developed to quickly and reliably solve the resulting one-dimensional bounded search, and it is used as a real-time guidance applied to a lunar landing test case.

Rea, Jeremy R.↗
NASA NTRS1974

Fast direct numerical solution of the nonhomogeneous Cauchy-Riemann equations

A fast direct (noniterative) 'Cauchy-Riemann Solver' is developed for solving the finite-difference equations representing systems of first-order elliptic partial differential equations in the form of the nonhomogeneous Cauchy-Riemann equations. The method is second-order accurate and requires approximately the same computer time as a fast cyclic-reduction Poisson solver. The accuracy and efficiency of the direct solver are demonstrated in an application to solving an example problem in aerodynamics: subsonic inviscid flow over a biconvex airfoil. The analytical small-perturbation solution contains singularities, which are captured well by the computational technique. The algorithm is expected to be useful in nonlinear subsonic and transonic aerodynamics.

Lomax, H.↗
NASA NTRS2021

An Approach to Reasoning Service Migration in Data and Reasoning Fabric (DRF) Implementation

In this paper we consider service migration problem for Data and Reasoning Fabric (DRF) enabled airspace operations assuming a fixed cloud/edge infrastructure with allocated computing, storage and power resources, where cloud/edge servers, and communication stations are in a wired connected network, while vehicles use a wireless network for communication. The objective is to automatically select the best location for the requested service execution, which achieves minimum cost while satisfying the user quality of service (QoS) and available resources constraints. To this end, estimates of the response time, consumed energy and total cost are defined for each potential compute location. A mixed-integer linear program is then formulated and solved to identify optimal compute locations given QoS constraints, network infrastructure limitations, with worst-case vehicle positioning. The approach is applied to trajectory re-planning use case to avoid a collision with an emergency vehicle in real time.

Air mobility↗
NASA NTRS1987

Mathematical programming formulations for satellite synthesis

The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.

Bhasin, Puneet↗
NASA NTRS1995

Comparative study of numerical schemes of TVD3, UNO3-ACM and optimized compact scheme

Three different schemes are employed to solve the benchmark problem. The first one is a conventional TVD-MUSCL (Monotone Upwind Schemes for Conservation Laws) scheme. The second scheme is a UNO3-ACM (Uniformly Non-Oscillatory Artificial Compression Method) scheme. The third scheme is an optimized compact finite difference scheme modified by us: the 4th order Runge Kutta time stepping, the 4th order pentadiagonal compact spatial discretization with the maximum resolution characteristics. The problems of category 1 are solved by using the second (UNO3-ACM) and third (Optimized Compact) schemes. The problems of category 2 are solved by using the first (TVD3) and second (UNO3-ACM) schemes. The problem of category 5 is solved by using the first (TVD3) scheme. It can be concluded from the present calculations that the Optimized Compact scheme and the UN03-ACM show good resolutions for category 1 and category 2 respectively.

Lee, Duck-Joo↗
NASA NTRS1983

Prediction of high speed propeller flow fields using a three-dimensional Euler analysis

To overcome the limitations of classical propeller theory, a computer program, NASPROP-E, was developed which solves for the flow field surrounding a multibladed propeller and axisymmetric nacelle combination using a finite difference method. The governing equations are the three dimensional unsteady Euler equations written in a cylindrical coordinate system. They are marched in time until a steady state solution is obtained. The Euler equations require no special treatment to model the blade work vorticity. The equations are solved using an implicit approximate factorization method. Numerical results are presented which have greatly increased the understanding of high speed propeller flow fields. Numerical results for swirl angle downstream of the propeller and propeller power coefficient are higher than experimental results. The radial variation of coefficient are higher than experimental results. The radial variation of swirl angle, however, is in reasonable agreement with the experimental results. The predicted variation of power coefficient with blade angle agrees very well with data.

Bober, L. J.↗
NASA NTRS1984

The evolution of large-scale magnetic fields in the ionosphere of Venus

Large-scale magnetic fields are often observed in the ionosphere of Venus by the magnetometer on the Pioneer Venus Orbiter, especially near the subsolar point or when the solar wind dynamic pressure is high. An equation for the time evolution of the magnetic field is derived which includes both a term representing the time rate of change of the field due to the convection of magnetic flux by plasma motions, and a magnetic diffusion/dissipation term. The ionospheric plasma velocities required by these equations were obtained by numerically solving the momentum equation. Numerical solutions to the magnetic field equation indicate that large-scale magnetic fields, which are not being actively maintained, decay with time scales ranging from tens of minutes to several hours. The vertical convection of magnetic flux enables magnetic field structures deep within the ionosphere to persist longer than would otherwise be expected. This vertical convection also explains the shape of these structures.

Cravens, T. E.↗