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,441 records · Page 80
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

A Comparison of Filter-based Approaches for Model-based Prognostics

Model-based prognostics approaches use domain knowledge about a system and its failure modes through the use of physics-based models. Model-based prognosis is generally divided into two sequential problems: a joint state-parameter estimation problem, in which, using the model, the health of a system or component is determined based on the observations; and a prediction problem, in which, using the model, the stateparameter distribution is simulated forward in time to compute end of life and remaining useful life. The first problem is typically solved through the use of a state observer, or filter. The choice of filter depends on the assumptions that may be made about the system, and on the desired algorithm performance. In this paper, we review three separate filters for the solution to the first problem: the Daum filter, an exact nonlinear filter; the unscented Kalman filter, which approximates nonlinearities through the use of a deterministic sampling method known as the unscented transform; and the particle filter, which approximates the state distribution using a finite set of discrete, weighted samples, called particles. Using a centrifugal pump as a case study, we conduct a number of simulation-based experiments investigating the performance of the different algorithms as applied to prognostics.

prognostics↗
NASA NTRS2025

Generalized Reference Targeting for Spaceflight

For spaceflight programs to achieve some of the aggressive exploration initiatives such as visiting and landing on other celestial bodies, rendezvousing with other orbiting vehicles, and ultimately returning crew safely to Earth, an assortment of targeting algorithms to compute the necessary burns to strategically maneuver a spacecraft to a variety of destinations are required. Numerous examples exist, but rather than creating and implementing multiple targeting solutions, is it possible to have a general targeting model that can accommodate a variety of applications? Originally motivated for mission design and analysis purposes, this paper outlines a generalized reference targeting algorithm for spaceflight that may also have applications in on-orbit flight software. It accommodates arbitrary flight dynamics and both impulsive and finite burns for either absolute or relative targeting applications. It also allows for an arbitrary number of targeting design parameters such as multiple discrete correction burns or finite thrust parameters to satisfy numerous combinations of targeting constraints that can have fixed or variable time epochs. Given a reference trajectory, this targeting technique provides a general framework to quickly solve an assortment of targeting problems that may be well-defined, over-determined, or under-determined while naturally producing metrics providing insight into the controllability for a given problem formulation. Due to the derivation, speed, and accuracy of the algorithm, it lends to supporting rapid linear covariance analysis and robust trajectory design applications for a variety of flight phases such as rendezvous and docking, cislunar transfer, interplanetary flight, orbit maintenance, de-orbit, and powered descent and landing.

Targeting↗
NASA NTRS1995

FDTD-ANT User Manual

This manual explains the theory and operation of the finite-difference time domain code FDTD-ANT developed by Analex Corporation at the NASA Lewis Research Center in Cleveland, Ohio. This code can be used for solving electromagnetic problems that are electrically small or medium (on the order of 1 to 50 cubic wavelengths). Calculated parameters include transmission line impedance, relative effective permittivity, antenna input impedance, and far-field patterns in both the time and frequency domains. The maximum problem size may be adjusted according to the computer used. This code has been run on the DEC VAX and 486 PC's and on workstations such as the Sun Sparc and the IBM RS/6000.

Zimmerman, Martin L.↗
NASA NTRS1976

Similarity solution of the boundary-layer equations for laser heated flows

The laminar boundary-layer equations with local similarity approximation are solved in order to estimate the heat transfer rate to the wall in a laser-heated rocket thruster using pure hydrogen, where the average temperature of the hot plasma core is about 14,000 K and the core Reynolds number based on nozzle throat diameter is about 2000. Under these conditions, the density-viscosity product at the wall can be 10 times the freestream value, and the hydrogen is completely dissociated. Hence the boundary layer equations with variable transport properties are solved by a quasi-linearization technique, and the equilibrium properties of hydrogen are used in the calculations. Velocity profiles are obtained, and the wall shear and wall stagnation enthalpy gradient are plotted against the pressure gradient parameter.

Wu, P. K.↗
NASA NTRS1989

Small Mercury Relativity Orbiter

The accuracy of solar system tests of gravitational theory could be very much improved by range and Doppler measurements to a Small Mercury Relativity Orbiter. A nearly circular orbit at roughly 2400 km altitude is assumed in order to minimize problems with orbit determination and thermal radiation from the surface. The spacecraft is spin-stabilized and has a 30 cm diameter de-spun antenna. With K-band and X-band ranging systems using a 50 MHz offset sidetone at K-band, a range accuracy of 3 cm appears to be realistically achievable. The estimated spacecraft mass is 50 kg. A consider-covariance analysis was performed to determine how well the Earth-Mercury distance as a function of time could be determined with such a Relativity Orbiter. The minimum data set is assumed to be 40 independent 8-hour arcs of tracking data at selected times during a two year period. The gravity field of Mercury up through degree and order 10 is solved for, along with the initial conditions for each arc and the Earth-Mercury distance at the center of each arc. The considered parameters include the gravity field parameters of degree 11 and 12 plus the tracking station coordinates, the tropospheric delay, and two parameters in a crude radiation pressure model. The conclusion is that the Earth-Mercury distance can be determined to 6 cm accuracy or better. From a modified worst-case analysis, this would lead to roughly 2 orders of magnitude improvement in the knowledge of the precession of perihelion, the relativistic time delay, and the possible change in the gravitational constant with time.

Bender, Peter L.↗
NASA NTRS2011

Receptivity to Roughness, Acoustic, and Vortical Disturbances in Supersonic Boundary Layers Over Swept Wings

The receptivity and interaction of stationary and traveling crossflow instability of three-dimensional supersonic boundary layers over a swept biconvex wing with a blunt leading edge are numerically investigated for a freestream Mach number of 3. The steady and unsteady flow fields are obtained by solving the full Navier-Stokes equations. The receptivity of the boundary layer to surface roughness, freestream acoustic waves, and freestream vorticity waves are numerically investigated. The initial amplitudes of the stationary vortices generated by 1 micron roughness elements is about 2000 times larger than the initial amplitudes of the traveling disturbances generated by vortical disturbances. The interaction of stationary and traveling disturbances was investigated by solving the equations with both surface roughness and vortical disturbances. When the initial amplitudes of the stationary disturbances are large compared to the traveling disturbances, the stationary vortex dominates the perturbation field. When the amplitudes are comparable, the traveling vortex prevails and the stationary vortex is suppressed.

Balakumar, Ponnampalam↗
NASA NTRS2001

Textbook Multigrid Efficiency for Computational Fluid Dynamics Simulations

Considerable progress over the past thirty years has been made in the development of large-scale computational fluid dynamics (CFD) solvers for the Euler and Navier-Stokes equations. Computations are used routinely to design the cruise shapes of transport aircraft through complex-geometry simulations involving the solution of 25-100 million equations; in this arena the number of wind-tunnel tests for a new design has been substantially reduced. However, simulations of the entire flight envelope of the vehicle, including maximum lift, buffet onset, flutter, and control effectiveness have not been as successful in eliminating the reliance on wind-tunnel testing. These simulations involve unsteady flows with more separation and stronger shock waves than at cruise. The main reasons limiting further inroads of CFD into the design process are: (1) the reliability of turbulence models; and (2) the time and expense of the numerical simulation. Because of the prohibitive resolution requirements of direct simulations at high Reynolds numbers, transition and turbulence modeling is expected to remain an issue for the near term. The focus of this paper addresses the latter problem by attempting to attain optimal efficiencies in solving the governing equations. Typically current CFD codes based on the use of multigrid acceleration techniques and multistage Runge-Kutta time-stepping schemes are able to converge lift and drag values for cruise configurations within approximately 1000 residual evaluations. An optimally convergent method is defined as having textbook multigrid efficiency (TME), meaning the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in the discretized system of equations (residual equations). In this paper, a distributed relaxation approach to achieving TME for Reynolds-averaged Navier-Stokes (RNAS) equations are discussed along with the foundations that form the basis of this approach. Because the governing equations are a set of coupled nonlinear conservation equations with discontinuities (shocks, slip lines, etc.) and singularities (flow- or grid-induced), the difficulties are many. This paper summarizes recent progress towards the attainment of TME in basic CFD simulations.

Brandt, Achi↗
NASA NTRS2018

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

Corbetta, M.↗
NASA NTRS2019

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

stochastic calculus↗
NASA NTRS2008

Oxidation Behavior of Carbon Fiber-Reinforced Composites

OXIMAP is a numerical (FEA-based) solution tool capable of calculating the carbon fiber and fiber coating oxidation patterns within any arbitrarily shaped carbon silicon carbide composite structure as a function of time, temperature, and the environmental oxygen partial pressure. The mathematical formulation is derived from the mechanics of the flow of ideal gases through a chemically reacting, porous solid. The result of the formulation is a set of two coupled, non-linear differential equations written in terms of the oxidant and oxide partial pressures. The differential equations are solved simultaneously to obtain the partial vapor pressures of the oxidant and oxides as a function of the spatial location and time. The local rate of carbon oxidation is determined at each time step using the map of the local oxidant partial vapor pressure along with the Arrhenius rate equation. The non-linear differential equations are cast into matrix equations by applying the Bubnov-Galerkin weighted residual finite element method, allowing for the solution of the differential equations numerically.

Sullivan, Roy M.↗
NASA NTRS1993

Space station static and dynamic analyses using parallel methods

Algorithms for high-performance parallel computers are applied to perform static analyses of large-scale Space Station finite-element models (FEMs). Several parallel-vector algorithms under development at NASA Langley are assessed. Sparse matrix solvers were found to be more efficient than banded symmetric or iterative solvers for the static analysis of large-scale applications. In addition, new sparse and 'out-of-core' solvers were found superior to substructure (superelement) techniques which require significant additional cost and time to perform static condensation during global FEM matrix generation as well as the subsequent recovery and expansion. A method to extend the fast parallel static solution techniques to reduce the computation time for dynamic analysis is also described. The resulting static and dynamic algorithms offer design economy for preliminary multidisciplinary design optimization and FEM validation against test modes. The algorithms are being optimized for parallel computers to solve one-million degrees-of-freedom (DOF) FEMs. The high-performance computers at NASA afforded effective software development, testing, efficient and accurate solution with timely system response and graphical interpretation of results rarely found in industry. Based on the author's experience, similar cooperation between industry and government should be encouraged for similar large-scale projects in the future.

Gupta, V.↗
NASA NTRS1978

Albedo climatology analysis and the determination of fractional cloud cover

Monthly and zonally averaged surface cover climatology data are presented which are used to construct monthly and zonally averaged surface albedos. The albedo transformations are then applied to the surface albedos, using solar zenith angles characteristic of the Nimbus 6 satellite local sampling times, to obtain albedos at the top of clear and totally cloud covered atmospheres. These albedos are then combined with measured albedo data to solve for the monthly and zonally averaged fractional cloud cover. The measured albedo data were obtained from the wide field of view channels of the Nimbus 6 Earth Radiation Budget experiment, and consequently the fractional cloud cover results are representative of the local sampling times. These fractional cloud cover results are compared with recent studies. The cloud cover results not only show peaks near the intertropical convergence zone, but the monthly migration of the position of these peaks follows general predictions of atmospheric circulation studies.

Curran, R. J.↗
NASA NTRS2015

A New Architecture for Extending the Capabilities of the Copernicus Trajectory Optimization Program

This paper describes a new plugin architecture developed for the Copernicus spacecraft trajectory optimization program. Details of the software architecture design and development are described, as well as examples of how the capability can be used to extend the tool in order to expand the type of trajectory optimization problems that can be solved. The inclusion of plugins is a significant update to Copernicus, allowing user-created algorithms to be incorporated into the tool for the first time. The initial version of the new capability was released to the Copernicus user community with version 4.1 in March 2015, and additional refinements and improvements were included in the recent 4.2 release. It is proving quite useful, enabling Copernicus to solve problems that it was not able to solve before.

Williams, Jacob↗
NASA NTRS2001

Numerical Simulation of Two Phase Flows

Two phase flows can be found in broad situations in nature, biology, and industry devices and can involve diverse and complex mechanisms. While the physical models may be specific for certain situations, the mathematical formulation and numerical treatment for solving the governing equations can be general. Hence, we will require information concerning each individual phase as needed in a single phase. but also the interactions between them. These interaction terms, however, pose additional numerical challenges because they are beyond the basis that we use to construct modern numerical schemes, namely the hyperbolicity of equations. Moreover, due to disparate differences in time scales, fluid compressibility and nonlinearity become acute, further complicating the numerical procedures. In this paper, we will show the ideas and procedure how the AUSM-family schemes are extended for solving two phase flows problems. Specifically, both phases are assumed in thermodynamic equilibrium, namely, the time scales involved in phase interactions are extremely short in comparison with those in fluid speeds and pressure fluctuations. Details of the numerical formulation and issues involved are discussed and the effectiveness of the method are demonstrated for several industrial examples.

Liou, Meng-Sing↗
NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗
NASA NTRS1990

Architecture independent environment for developing engineering software on MIMD computers

Engineers are constantly faced with solving problems of increasing complexity and detail. Multiple Instruction stream Multiple Data stream (MIMD) computers have been developed to overcome the performance limitations of serial computers. The hardware architectures of MIMD computers vary considerably and are much more sophisticated than serial computers. Developing large scale software for a variety of MIMD computers is difficult and expensive. There is a need to provide tools that facilitate programming these machines. First, the issues that must be considered to develop those tools are examined. The two main areas of concern were architecture independence and data management. Architecture independent software facilitates software portability and improves the longevity and utility of the software product. It provides some form of insurance for the investment of time and effort that goes into developing the software. The management of data is a crucial aspect of solving large engineering problems. It must be considered in light of the new hardware organizations that are available. Second, the functional design and implementation of a software environment that facilitates developing architecture independent software for large engineering applications are described. The topics of discussion include: a description of the model that supports the development of architecture independent software; identifying and exploiting concurrency within the application program; data coherence; engineering data base and memory management.

Valimohamed, Karim A.↗
NASA NTRS1998

Parallelization of the Pipelined Thomas Algorithm

In this study the following questions are addressed. Is it possible to improve the parallelization efficiency of the Thomas algorithm? How should the Thomas algorithm be formulated in order to get solved lines that are used as data for other computational tasks while processors are idle? To answer these questions, two-step pipelined algorithms (PAs) are introduced formally. It is shown that the idle processor time is invariant with respect to the order of backward and forward steps in PAs starting from one outermost processor. The advantage of PAs starting from two outermost processors is small. Versions of the pipelined Thomas algorithms considered here fall into the category of PAs. These results show that the parallelization efficiency of the Thomas algorithm cannot be improved directly. However, the processor idle time can be used if some data has been computed by the time processors become idle. To achieve this goal the Immediate Backward pipelined Thomas Algorithm (IB-PTA) is developed in this article. The backward step is computed immediately after the forward step has been completed for the first portion of lines. This enables the completion of the Thomas algorithm for some of these lines before processors become idle. An algorithm for generating a static processor schedule recursively is developed. This schedule is used to switch between forward and backward computations and to control communications between processors. The advantage of the IB-PTA over the basic PTA is the presence of solved lines, which are available for other computations, by the time processors become idle.

Povitsky, A.↗
NASA NTRSDate not supplied

Optimization Algorithms as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) have the potential to demonstrate significant run-time performance benefits over current state-of-the-art solutions. Using existing methods for characterizing classical optimization algorithms, we analyze solution quality obtained by solving Max-Cut problems using a quantum annealing device and gate-model quantum simulators and devices. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through effective visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. The framework is an enhancement to the existing open-source QED-C Application-Oriented Benchmark suite and can connect to the open-source analysis libraries. The suite can be executed on various quantum simulators and quantum hardware systems.

benchmarking↗