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.

SourceResearch connectionFrom yearThrough year

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

At least 1,189 records · Page 66

All sources NASA NTRS DOE OSTI

NASA NTRS1991

New developments in astrodynamics algorithms for autonomous rendezvous

A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.

Klumpp, Allan R.↗

NASA NTRS1972

Unsteady radiant heating of conical foil receptors.

The time dependent thermal equations of two types of conical radiation detectors are discussed and solved for a step function application of radiation parallel to the axis of the cases. The first type has a heat sink at the base and the second has the vertex buried in a heat sink to a variable proportion of its total height. It is found that the first case has the lower sensitivity and better time response. The time response of the second case is improved by more deeply burying the vertex, but to the detriment of sensitivity. At no value of this inclusion can both a superior sensitivity and time response be achieved for the second case.

Saunders, R. C., Jr.↗

NASA NTRSDate not supplied

Molecular flow venting of a volume with an outgassing or desorbing source

A venting equation commonly used to describe the transient evolution of pressure within a volume containing an outgassing or offgassing source and a restrictive vent conductance under conditions of molecular flow has been solved analytically. Solutions are found for sources of finite thickness characterized by classical diffusion-limited behavior (proportional to inverse square root of time), as well as responses for thick material sources often observed in testing that are characterized by a more general form of power-law decay, up to inverse time behavior associated with surface desorption. Solutions involve evaluating integrals where both numerators and denominators of the integrands diverge with time, making wide-ranging transient solutions difficult to directly compute numerically. Usually, one can avoid evaluating these integrals by assuming quasistatic conditions at long time scales. A novel approach is used in this work to analytically produce solutions by generating bespoke mathematical functions, some of which solve integrals that have apparently had no previous analytical solution.

Michael Woronowicz↗

NASA NTRSDate not supplied

Molecular flow venting of a volume with an outgassing or desorbing source

"A venting equation commonly used to describe the transient evolution of pressure within a volume containing an outgassing or offgassing source and a restrictive vent conductance under conditions of molecular flow has been solved analytically. Solutions are found for sources of finite thickness characterized by classical diffusion-limited behavior (proportional to inverse square root of time), as well as responses for thick material sources often observed in testing that are characterized by a more general form of power-law decay, up to inverse time behavior associated with surface desorption. Solutions involve evaluating integrals where both numerators and denominators of the integrands diverge with time, making wide-ranging transient solutions difficult to directly compute numerically. Usually, one can avoid evaluating these integrals by assuming quasistatic conditions at long time scales. A novel approach is used in this work to analytically produce solutions by generating bespoke mathematical functions, some of which solve integrals that have apparently had no previous analytical solution."

Michael Woronowicz↗

NASA NTRS1990

Numerical study of vortical flow over a sideslipping delta wing

The three-dimensional vortical viscous flow past a sideslipping delta wing at a high angle of attack is numerically investigated. A computational method for calculating low-speed viscous flowfields is developed. The time-iterative method uses an implicit upwind-relaxation finite-difference algorithm with a nonsingular eigensystem to solve the preconditioned, three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. An algebraic turbulence model is implemented to account for the eddy viscosity. The technique of local time stepping is incorporated to accelerate the rate of convergence to a steady-state solution. Computed results are compared with experimental data.

Hsu, C.-H.↗

NASA NTRS1972

Control system estimation and design for aerospace vehicles with time delay

The problems of estimation and control of discrete, linear, time-varying systems are considered. Previous solutions to these problems involved either approximate techniques, open-loop control solutions, or results which required excessive computation. The estimation problem is solved by two different methods, both of which yield the identical algorithm for determining the optimal filter. The partitioned results achieve a substantial reduction in computation time and storage requirements over the expanded solution, however. The results reduce to the Kalman filter when no delays are present in the system. The control problem is also solved by two different methods, both of which yield identical algorithms for determining the optimal control gains. The stochastic control is shown to be identical to the deterministic control, thus extending the separation principle to time delay systems. The results obtained reduce to the familiar optimal control solution when no time delays are present in the system.

Allgaier, G. R.↗

NASA NTRS2016

Introducing a Degree of Freedom in the Family of Generalized Logarithmic Spirals

The versatility of the family of generalized logarithmic spirals is improved by introducing a degree of freedom in the solution. The low-thrust acceleration profile now includes a control term that affects both the magnitude and the direction of the thrust. Exact and fully analytic solutions to the trajectory, the velocity, the time of flight, etc. are made available. Two integrals of motion are preserved. The first one is a generalization of the equation of the energy and depends on the values of the control parameter. The second one relates to the equation of the angular momentum. The problem of finding spiral transfers between two arbitrary state vectors reduces to solving one algebraic equation with one unknown. The degree of freedom allows fixing the time of flight of the transfer. If the time of flight is fixed, then there are two equations with two unknowns. No other iterative procedures are required. Coast arcs can be introduced in the solution naturally. An explicit expression for the maximum acceleration reached along the transfer is provided. Thanks to the symmetry properties of the solution a simple algorithm for generating periodic orbits is presented. An arbitrary number of intermediate nodes can be introduced to improve the flexibility of the solution when facing optimization problems. An example of a low-thrust gravity-assist Earth-Mars-Ceres trajectory shows that the solution is comparable to that obtained with other preliminary design techniques.

Roa, Javier↗

NASA NTRS2013

Mixed Linear/Square-Root Encoded Single-Slope Ramp Provides Low-Noise ADC with High Linearity for Focal Plane Arrays

Single-slope analog-to-digital converters (ADCs) are particularly useful for onchip digitization in focal plane arrays (FPAs) because of their inherent monotonicity, relative simplicity, and efficiency for column-parallel applications, but they are comparatively slow. Squareroot encoding can allow the number of code values to be reduced without loss of signal-to-noise ratio (SNR) by keeping the quantization noise just below the signal shot noise. This encoding can be implemented directly by using a quadratic ramp. The reduction in the number of code values can substantially increase the quantization speed. However, in an FPA, the fixed pattern noise (FPN) limits the use of small quantization steps at low signal levels. If the zero-point is adjusted so that the lowest column is onscale, the other columns, including those at the center of the distribution, will be pushed up the ramp where the quantization noise is higher. Additionally, the finite frequency response of the ramp buffer amplifier and the comparator distort the shape of the ramp, so that the effective ramp value at the time the comparator trips differs from the intended value, resulting in errors. Allowing increased settling time decreases the quantization speed, while increasing the bandwidth increases the noise. The FPN problem is solved by breaking the ramp into two portions, with some fraction of the available code values allocated to a linear ramp and the remainder to a quadratic ramp. To avoid large transients, both the value and the slope of the linear and quadratic portions should be equal where they join. The span of the linear portion must cover the minimum offset, but not necessarily the maximum, since the fraction of the pixels above the upper limit will still be correctly quantized, albeit with increased quantization noise. The required linear span, maximum signal and ratio of quantization noise to shot noise at high signal, along with the continuity requirement, determines the number of code values that must be allocated to each portion. The distortion problem is solved by using a lookup table to convert captured code values back to signal levels. The values in this table will be similar to the intended ramp value, but with a correction for the finite bandwidth effects. Continuous-time comparators are used, and their bandwidth is set below the step rate, which smoothes the ramp and reduces the noise. No settling time is needed, as would be the case for clocked comparators, but the low bandwidth enhances the distortion of the non-linear portion. This is corrected by use of a return lookup table, which differs from the one used to generate the ramp. The return lookup table is obtained by calibrating against a stepped precision DC reference. This results in a residual non-linearity well below the quantization noise. This method can also compensate for differential non-linearity (DNL) in the DAC used to generate the ramp. The use of a ramp with a combination of linear and quadratic portions for a single-slope ADC is novel. The number of steps is minimized by keeping the step size just below the photon shot noise. This in turn maximizes the speed of the conversion. High resolution is maintained by keeping small quantization steps at low signals, and noise is minimized by allowing the lowest analog bandwidth, all without increasing the quantization noise. A calibrated return lookup table allows the system to maintain excellent linearity.

Wrigley, Chris J.↗

NASA NTRS1995

The large discretization step method for time-dependent partial differential equations

A new method for the acceleration of linear and nonlinear time dependent calculations is presented. It is based on the Large Discretization Step (LDS) approximation, defined in this work, which employs an extended system of low accuracy schemes to approximate a high accuracy discrete approximation to a time dependent differential operator. Error bounds on such approximations are derived. These approximations are efficiently implemented in the LDS methods for linear and nonlinear hyperbolic equations, presented here. In these algorithms the high and low accuracy schemes are interpreted as the same discretization of a time dependent operator on fine and coarse grids, respectively. Thus, a system of correction terms and corresponding equations are derived and solved on the coarse grid to yield the fine grid accuracy. These terms are initialized by visiting the fine grid once in many coarse grid time steps. The resulting methods are very general, simple to implement and may be used to accelerate many existing time marching schemes.

Haras, Zigo↗

NASA NTRS1982

A time-dependent ice sheet model - Preliminary results

A numerical model of ice sheet flow is developed, and preliminary results are described. This model includes vertical resolution of temperature, stress, and strain rate which represents a considerable improvement over previous vertically averaged ice sheet models. The model follows the flow of ice along a flow line within an ice sheet drainage basin. Longitudinal stresses and basal sliding are included. Basal sliding is dependent on the base shear stress and a specified distribution of basal water pressure. The numerical methods used to solve the coupled set of stress and velocity equations for the static and time-evolutionary cases are discussed. A steady state profile simulating an ice stream is calculated for a particular set of input parameters, and changes in the profile are examined for different choices of parameters. Preliminary studies of response behavior are completed using a simplified ice sheet geometry with a fixed terminus or grounding line. The results of these studies illustrate ice sheet thinning in response to a lowered sea level or to a reduction in the extent of ice rises (or pinning points) within ice shelves.

Bindschadler, R. A.↗

NASA NTRS2010

Reactive Collision Avoidance Algorithm

The reactive collision avoidance (RCA) algorithm allows a spacecraft to find a fuel-optimal trajectory for avoiding an arbitrary number of colliding spacecraft in real time while accounting for acceleration limits. In addition to spacecraft, the technology can be used for vehicles that can accelerate in any direction, such as helicopters and submersibles. In contrast to existing, passive algorithms that simultaneously design trajectories for a cluster of vehicles working to achieve a common goal, RCA is implemented onboard spacecraft only when an imminent collision is detected, and then plans a collision avoidance maneuver for only that host vehicle, thus preventing a collision in an off-nominal situation for which passive algorithms cannot. An example scenario for such a situation might be when a spacecraft in the cluster is approaching another one, but enters safe mode and begins to drift. Functionally, the RCA detects colliding spacecraft, plans an evasion trajectory by solving the Evasion Trajectory Problem (ETP), and then recovers after the collision is avoided. A direct optimization approach was used to develop the algorithm so it can run in real time. In this innovation, a parameterized class of avoidance trajectories is specified, and then the optimal trajectory is found by searching over the parameters. The class of trajectories is selected as bang-off-bang as motivated by optimal control theory. That is, an avoiding spacecraft first applies full acceleration in a constant direction, then coasts, and finally applies full acceleration to stop. The parameter optimization problem can be solved offline and stored as a look-up table of values. Using a look-up table allows the algorithm to run in real time. Given a colliding spacecraft, the properties of the collision geometry serve as indices of the look-up table that gives the optimal trajectory. For multiple colliding spacecraft, the set of trajectories that avoid all spacecraft is rapidly searched on-line. The optimal avoidance trajectory is implemented as a receding-horizon model predictive control law. Therefore, at each time step, the optimal avoidance trajectory is found and the first time step of its acceleration is applied. At the next time step of the control computer, the problem is re-solved and the new first time step is again applied. This continual updating allows the RCA algorithm to adapt to a colliding spacecraft that is making erratic course changes.

Scharf, Daniel↗

NASA NTRS2003

Mixing and Transport in the Solar Nebula

Boss & Vanhala (2000, 2001) prepared reviews of triggered collapse and injection models, using Prudence Foster's finite differences code at very high spatial resolution (440 x 1440 cells) to demonstrate the convergence of the R-T fingers in triggered injection models. A two dimensional hydrodynamical calculation with unprecedentedly high spatial resolution (960 x 2880 zones, or almost 3 million grid points) demonstrated that it suitable shock front can both trigger the collapse of an otherwise stable presolar cloud, and inject shock front particles into the collapsing cloud through the formation of what become Rayleigh-Taylor fingers of compressed fluid layers falling into the gravitational potential well of the growing protostar. These calculations suggest that heterogeneity derived from these R-T fingers will persist down to the scale of their injection onto the surface of the solar nebula. Haghighipour developed a numerical code capable of calculating the orbital evolution of dust grains of varied sizes in a gaseous nebula, subject to Epstein and Stokes drag as well as the self-gravity of the disk. In collaboration with the PI and George W. Wetherill, Haghighipour has been involved in development of a new idea on the possibility of rapid formation of ice giant planets via the disk instability mechanism. Haghighipour studied the stability of a five-body system consisting of the Sun and four protoplanets by numerically integrating their equations of motions. Using Levison and Duncan s SWIFT integrator, Haghighipour showed that, depending on the orbital parameters of the bodies, such a system can be stable for 0.1-10 Myr. Time periods of 1 Myr or more are long enough to be consistent with the time scale proposed for the formation of giant planets by the disk instability mechanism and the photoevaporation of the gaseous envelopes of the outermost protoplanets by a nearby OB star, resulting in the formation of ice giant planets. The PI has used his three dimensional models of marginally gravitationally unstable disks to study the preservation of isotopic heterogeneity in evolving protoplanetary disks. Such heterogeneity might arise from the infall onto the disk s surface of solids processed in the X-wind region of the disk, or derived from stellar nucleosynthesis and injected by R-T fingers. The technique used consists of solving a color equation, identical to the gas continuity equation, which follows the time evolution in three space dimensions of an arbitrarily placed initial color field, i.e., a dye inserted the disk. The models show that significant concentrations of color could persist for time periods of about a thousand years or more, even in the most dynamically active region of such a disk. Such a time period might be long enough for solids to coagulate and grow to significant sizes while retaining the isotopic signature of their birth region in the nebula.

Boss, Alan P.↗

NASA NTRS1992

Electromagnetic scattering calculations on the Intel Touchstone Delta

During the first year's operation of the Intel Touchstone Delta system, software which solves the electric field integral equations for fields scattered from arbitrarily shaped objects has been transferred to the Delta. To fully realize the Delta's resources, an out-of-core dense matrix solution algorithm that utilizes some or all of the 90 Gbyte of concurrent file system (CFS) has been used. The largest calculation completed to date computes the fields scattered from a perfectly conducting sphere modeled by 48,672 unknown functions, resulting in a complex valued dense matrix needing 37.9 Gbyte of storage. The out-of-core LU matrix factorization algorithm was executed in 8.25 h at a rate of 10.35 Gflops. Total time to complete the calculation was 19.7 h-the additional time was used to compute the 48,672 x 48,672 matrix entries, solve the system for a given excitation, and compute observable quantities. The calculation was performed in 64-b precision.

Cwik, Tom↗

NASA NTRS1986

Time-dependent numerical modeling of dust halo formation at comets

The evolution of gas and dust distributions following a spatially and temporally localized comet outburst was calculated using a hybrid kinetic-hydrodynamic method. In the inner coma the time-dependent continuity, momentum, and energy equations of the dusty gas flow were solved simultaneously using 12 dust sizes. Beyond 300 km a three-dimensional kinetic model was used to calculate the trajectory of each individual dust grain. It was found that following the onset of the comet outburst a gas-dust blast wave propagates outward in the inner coma. About 15 minutes after the increased gas and dust production was initiated at the nucleus, a new equilibrium was reached in the inner coma. The most important feature of this new steady state was the significant increase of the dust terminal velocities. These higher terminal velocity values resulted in larger apex distances for dust particles emitted during the outburst. The dust particles spend a relatively long time near their apex points; therefore, the outburst generates long-lasting distinct dust envelopes in front of the regular dust coma.

Gombosi, T. I.↗

NASA NTRSDate not supplied

Extreme Problem Solving: The New Challenges of Deep Space Exploration

On the International Space Station today, the crew has the near real-time support of a large group of system experts on the ground when dealing with problems on-board. For exploration beyond Low Earth Orbit, however, intermittent and delayed communication with ground will force small crews to take the lead in responding to vehicle anomalies. Enabling a flight crew of roughly four astronauts to perform the job that has traditionally been done by a ground crew of over 80 experts will require a fundamental rethinking of human-systems integration. Through observations of anomaly resolution processes, interviews with system experts and astronauts, and analyses of problem-solving models, we have identified the capabilities that are not currently available on-board but will be needed to enable safe exploration further away from Earth. These include increased data access, just-in-time training tools and technologies, and troubleshooting decision support. Important questions remain on how these technologies can be designed and implemented for increased crew autonomy. We present this critical challenge for deep space exploration to the human-computer interaction research community to reflect on the areas identified by our needs analysis and contemplate how they might be manifested as solutions.

autonomy↗

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

Kumar, Renjith R.↗

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