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 901 records · Page 50

All sources NASA NTRS DOE OSTI

NASA NTRS2018

Atmospheric Chemistry Modeling Using a Regression Forest Model

Atmospheric chemistry is central to many environmental issues such as air pollution, climate change, and stratospheric ozone loss. Chemistry Transport Models (CTM) are a central tool for understanding these issues, whether for research or for forecasting. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a CTM. We have investigated a machine learning approach to solving the differential equations instead of solving them numerically. From an annual simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry. This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, centennial scale climate simulations etc. We discuss our approches' speed and accuracy, and highlight some potential future directions for improving this approach.

Keller, Christoph A.↗

NASA NTRS2019

Atmospheric Chemistry Modeling Using Machine Learning

Atmospheric chemistry models are a central tool to study the impact of chemical constituents on the environment, vegetation and human health. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a chemistry model. We have investigated a machine learning approach to emulate the chemistry instead of solving the differential equations numerically. From a one-month simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry. This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, etc. We discuss speed and accuracy of our approach, and highlight some potential future directions for improving it.

Keller, Christoph A.↗

NASA NTRS2019

Atmospheric Chemistry Modeling and Air Quality Forecasting Using Machine Learning

Atmospheric chemistry models are a central tool to study the impact of chemical constituents on the environment, vegetation and human health. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a chemistry model.We have investigated a machine learning approach to emulate the chemistry instead of solving the differential equations numerically. From a one-month simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry.This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, etc. We discuss speed and accuracy of our approach, and highlight some potential future directions for improving it.

Keller, Christoph A.↗

NASA NTRS1972

Applications of NASTRAN to nuclear problems

The extent to which suitable solutions may be obtained for one physics problem and two engineering type problems is traced. NASTRAN appears to be a practical tool to solve one-group steady-state neutron diffusion equations. Transient diffusion analysis may be performed after new levels that allow time-dependent temperature calculations are developed. NASTRAN piecewise linear anlaysis may be applied to solve those plasticity problems for which a smooth stress-strain curve can be used to describe the nonlinear material behavior. The accuracy decreases when sharp transitions in the stress-strain relations are involved. Improved NASTRAN usefulness will be obtained when nonlinear material capabilities are extended to axisymmetric elements and to include provisions for time-dependent material properties and creep analysis. Rigid formats 3 and 5 proved to be very convenient for the buckling and normal-mode analysis of a nuclear fuel element.

Spreeuw, E.↗

NASA NTRSDate not supplied

Numerical Behaviour of a Smooth Local Correlation-based Transition Model in a Newton-Krylov Flow Solver

The numerical behaviour of transport-equation-based transition models, including both iterative and grid convergence, is influenced by the source terms. Transition models contain source terms that are large and highly nonlinear, and can be destabilizing in a strong implicit solver. Linearization strategies with varying levels of coupling are evaluated in conjunction with a source-term time step restriction to determine best-practices for solving the SA-sLM2015smooth local correlation-based transition model in an implicit Newton-Krylov flow solver. Achieving deep iterative convergence facilitates a detailed investigation of the grid convergence of these free-transition simulations, which are evaluated relative to fully-turbulent simulations performed using the Spalart-Allmaras turbulence model. Simulations of the NLF0416 general aviation airfoil, VA-2 supercritical airfoil, and NASA CRM-NLF wing-body geometry are performed over a range of grid levels. The results demonstrate that both a fully-coupled linearization strategy and a source-term time step restriction improve nonlinear convergence as the complexity of the free-transition simulations increases. In general, additional grid resolution is required for free-transition simulations relative to fully-turbulent simulations in order to achieve a similar level of accuracy, with the grid convergence of free-transition simulations sensitive to the streamwise grid spacings in the transition regions.

AATT↗

NASA NTRS1980

Computation of supersonic turbulent flows over an inclined ogive-cylinder-flare

A supersonic turbulent flow over an ogive-cylinder-flare has been solved numerically. Initially, the parabolized Navier-Stokes equations are solved for the ogive cylinder back to a location upstream of the shock-wave and boundary-layer interaction. Then, the time-dependent Navier-Stokes equations with a thin-layer approximation are solved for the remaining cylinder-flare portion. Results for a Mach number of 2.9 and a unit Reynolds number of 11.42 x 10 to the 6th/m are obtained for angles of attack alpha = 0, 4, and 8 deg. Good agreement has been found between computed and experimental results of the surface pressure on the ogive-cylinder portion, and for the interaction region at alpha = 0 and 4 deg. The role of circumferential communication in a three-dimensional shock-wave and boundary-layer interaction flow field is discussed.

Hung, C. M.↗

NASA NTRS1981

Computation of Supersonic Turbulent Flows over an Inclined Ogive-Cylinder-Flare

A supersonic turbulent flow over an ogive-cylinder-flare has been solved numerically. The calculations proceed in two parts. Initially, the parabolized Navier-Stokes equations are solved for the ogive cylinder back to a location upstream of the shock-wave and boundary-layer interaction. Then, the time-dependent Navier-Stokes equations with a thin-layer approximation are solved for the remaining cylinder-flare portion. Results for a Mach number of 2.0 and a unit Reynolds number of 11.42 x 10(exp 6)/m are obtained for angles of attack alpha = 0, 4, and 8 deg. Good agreement has been found between computed and experimental results of the surface pressure on the ogive-cylinder portion and for the interaction region at alpha = 0 and 4 deg. The role of circumferential communication in a three-dimensional shock-wave and boundary-layer interaction flowfield is discussed.

Hung, C. M.↗

NASA NTRS1989

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗

NASA NTRS1993

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 2: User's guide

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the User's Guide, and describes the program's features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗

NASA NTRS1993

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 1: Analysis description

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the Analysis Description, and presents the equations and solution procedure. The governing equations, the turbulence model, the linearization of the equations and boundary conditions, the time and space differencing formulas, the ADI solution procedure, and the artificial viscosity models are described in detail.

Towne, Charles E.↗

NASA NTRS1993

Proteus three-dimensional Navier-Stokes computer code, version 1.0. Volume 2: User's guide

A computer code called Proteus 3D was developed to solve the three-dimensional, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This User's Guide describes the program's features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗

NASA NTRS1993

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 3: Programmer's reference

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. The Programmer's Reference contains detailed information useful when modifying the program. The program structure, the Fortran variables stored in common blocks, and the details of each subprogram are described.

Towne, Charles E.↗

NASA NTRS1990

Randomly Sampled-Data Control Systems

The purpose is to solve the Linear Quadratic Regulator (LQR) problem with random time sampling. Such a sampling scheme may arise from imperfect instrumentation as in the case of sampling jitter. It can also model the stochastic information exchange among decentralized controllers to name just a few. A practical suboptimal controller is proposed with the nice property of mean square stability. The proposed controller is suboptimal in the sense that the control structure is limited to be linear. Because of i. i. d. assumption, this does not seem unreasonable. Once the control structure is fixed, the stochastic discrete optimal control problem is transformed into an equivalent deterministic optimal control problem with dynamics described by the matrix difference equation. The N-horizon control problem is solved using the Lagrange's multiplier method. The infinite horizon control problem is formulated as a classical minimization problem. Assuming existence of solution to the minimization problem, the total system is shown to be mean square stable under certain observability conditions. Computer simulations are performed to illustrate these conditions.

Han, Kuoruey↗

NASA NTRS1992

Finite element Euler calculations of unsteady transonic cascade flows

A Galerkin finite element procedure incorporating an explicit Runge-Kutta time-stepping scheme has been developed in this work to solve unsteady transonic flow in cascades. The computational domain is discretized by a globally unstructured but locally structured blade-fitted deformable mesh. The Galerkin approximation is applied to the unsteady Euler equations based on a mixed Eulerian-Lagrangian description. The semi-discretized equations are integrated forward in time using a multistage Runge-Kutta scheme. An artificial dissipation operator of the type proposed by Jameson is adapted in the current scheme to capture shocks and suppress nonphysical oscillations. Phase-shifted boundary conditions are used to reduce the computational domain to a single reference passage. Results for both steady and unsteady transonic flows through cascades are presented and compared to existing finite volume solutions.

Hsiao, Chingteng↗

NASA NTRS1975

Numerical computation of three-dimensional blunt body flow fields with an impinging shock

A time-marching finite-difference method was used to solve the compressible Navier-Stokes equations for the three-dimensional wing-leading-edge shock impingement problem. The bow shock was treated as a discontinuity across which the exact shock jump conditions were applied. All interior shock layer detail such as shear layers, shock waves, jets, and the wall boundary layer were automatically captured in the solution. The impinging shock was introduced by discontinuously changing the freestream conditions across the intersection line at the bow shock. A special storage-saving procedure for sweeping through the finite-difference mesh was developed which reduces the required amount of computer storage by at least a factor of two without sacrificing the execution time. Numerical results are presented for infinite cylinder blunt body cases as well as the three-dimensional shock impingement case. The numerical results are compared with existing experimental and theoretical results.

Holst, T. L.↗

NASA NTRS2006

Solving the Swath Segment Selection Problem

Several artificial-intelligence search techniques have been tested as means of solving the swath segment selection problem (SSSP) -- a real-world problem that is not only of interest in its own right, but is also useful as a test bed for search techniques in general. In simplest terms, the SSSP is the problem of scheduling the observation times of an airborne or spaceborne synthetic-aperture radar (SAR) system to effect the maximum coverage of a specified area (denoted the target), given a schedule of downlinks (opportunities for radio transmission of SAR scan data to a ground station), given the limit on the quantity of SAR scan data that can be stored in an onboard memory between downlink opportunities, and given the limit on the achievable downlink data rate. The SSSP is NP complete (short for "nondeterministic polynomial time complete" -- characteristic of a class of intractable problems that can be solved only by use of computers capable of making guesses and then checking the guesses in polynomial time).

Knight, Russell↗

NASA NTRS2013

Electro-Optic Time-to-Space Converter for Optical Detector Jitter Mitigation

A common problem in optical detection is determining the arrival time of a weak optical pulse that may comprise only one to a few photons. Currently, this problem is solved by using a photodetector to convert the optical signal to an electronic signal. The timing of the electrical signal is used to infer the timing of the optical pulse, but error is introduced by random delay between the absorption of the optical pulse and the creation of the electrical one. To eliminate this error, a time-to-space converter separates a sequence of optical pulses and sends them to different photodetectors, depending on their arrival time. The random delay, called jitter, is at least 20 picoseconds for the best detectors capable of detecting the weakest optical pulses, a single photon, and can be as great as 500 picoseconds. This limits the resolution with which the timing of the optical pulse can be measured. The time-to-space converter overcomes this limitation. Generally, the time-to-space converter imparts a time-dependent momentum shift to the incoming optical pulses, followed by an optical system that separates photons of different momenta. As an example, an electro-optic phase modulator can be used to apply longitudinal momentum changes (frequency changes) that vary in time, followed by an optical spectrometer (such as a diffraction grating), which separates photons with different momenta into different paths and directs them to impinge upon an array of photodetectors. The pulse arrival time is then inferred by measuring which photodetector receives the pulse. The use of a time-to-space converter mitigates detector jitter and improves the resolution with which the timing of an optical pulse is determined. Also, the application of the converter enables the demodulation of a pulse position modulated signal (PPM) at higher bandwidths than using previous photodetector technology. This allows the creation of a receiver for a communication system with high bandwidth and high bits/photon efficiency.

Birnbaum, Kevin↗

NASA NTRS1993

FD-TD modeling of 2-D dielectric waveguides for propagation and scattering of femtosecond optical solitons

Experimentalists have produced all-optical switches capable of 100-fs responses. To adequately model such switches, nonlinear effects in optical materials (both instantaneous and dispersive) must be included. In principle, the behavior of electromagnetic fields in nonlinear dielectrics can be determined by solving Maxwell's equations subject to the assumption that the electric polarization has a nonlinear relation to the electric field. However, until our previous work, the resulting nonlinear Maxwell's equations have not been solved directly. Rather, approximations have been made that result in a class of generalized nonlinear Schrodinger equations (GNLSE) that solve only for the envelope of the optical pulses. In this paper, we present first-time calculations from the vector nonlinear Maxwell's equations of femtosecond soliton propagation and scattering, including carrier waves, in two-dimensional systems of dielectric waveguides exhibiting the Kerr and Raman quantum effects. We use the finite-difference time-domain (FD-TD) method in an extension of our 1-D work. There, in a fundamental innovation, we treated the linear and nonlinear convolutions for the electric polarization as new dependent variables. By differentiating these convolutions in the time domain, we derived an equivalent system of coupled, nonlinear second-order ODE's. These equations together with Maxwell's equations form the system that is solved to determine the electromagnetic fields in inhomogeneous nonlinear dispersive media. Backstorage in time is limited to only that needed by the time-integration algorithm for the ODE's, rather than that needed to store the time-history of the kernel functions of the convolutions (1000-10,000 time steps). Thus, a 2-D nonlinear optics model from Maxwell's equations is now feasible.

Joseph, Rose↗