Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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 595 records · Page 33

Thermosolutal convection and macrosegregation in dendritic alloys

A mathematical model of solidification, that simulates the formation of channel segregates or freckles, is presented. The model simulates the entire solidification process, starting with the initial melt to the solidified cast, and the resulting segregation is predicted. Emphasis is given to the initial transient, when the dendritic zone begins to develop and the conditions for the possible nucleation of channels are established. The mechanisms that lead to the creation and eventual growth or termination of channels are explained in detail and illustrated by several numerical examples. A finite element model is used for the simulations. It uses a single system of equations to deal with the all-liquid region, the dendritic region, and the all-solid region. The dendritic region is treated as an anisotropic porous medium. The algorithm uses the bilinear isoparametric element, with a penalty function approximation and a Petrov-Galerkin formulation. The major task was to develop the solidification model. In addition, other tasks that were performed in conjunction with the modeling of dendritic solidification are briefly described.

Poirier, David R.↗

A stable second order method for training back propagation networks

A simple method for improving the learning rate of the back-propagation algorithm is described. The basis of the method is that approximate second order corrections can be incorporated in the output units. The extended method leads to significant improvements in the convergence rate.

Nachtsheim, Philip R.↗

Variable-Complexity Multidisciplinary Optimization on Parallel Computers

This report covers work conducted under grant NAG1-1562 for the NASA High Performance Computing and Communications Program (HPCCP) from December 7, 1993, to December 31, 1997. The objective of the research was to develop new multidisciplinary design optimization (MDO) techniques which exploit parallel computing to reduce the computational burden of aircraft MDO. The design of the High-Speed Civil Transport (HSCT) air-craft was selected as a test case to demonstrate the utility of our MDO methods. The three major tasks of this research grant included: development of parallel multipoint approximation methods for the aerodynamic design of the HSCT, use of parallel multipoint approximation methods for structural optimization of the HSCT, mathematical and algorithmic development including support in the integration of parallel computation for items (1) and (2). These tasks have been accomplished with the development of a response surface methodology that incorporates multi-fidelity models. For the aerodynamic design we were able to optimize with up to 20 design variables using hundreds of expensive Euler analyses together with thousands of inexpensive linear theory simulations. We have thereby demonstrated the application of CFD to a large aerodynamic design problem. For the predicting structural weight we were able to combine hundreds of structural optimizations of refined finite element models with thousands of optimizations based on coarse models. Computations have been carried out on the Intel Paragon with up to 128 nodes. The parallel computation allowed us to perform combined aerodynamic-structural optimization using state of the art models of a complex aircraft configurations.

Grossman, Bernard↗

Heat Transfer in High-Temperature Fibrous Insulation

The combined radiation/conduction heat transfer in high-porosity, high-temperature fibrous insulations was investigated experimentally and numerically. The effective thermal conductivity of fibrous insulation samples was measured over the temperature range of 300-1300 K and environmental pressure range of 1.33 x 10(exp -5)-101.32 kPa. The fibrous insulation samples tested had nominal densities of 24, 48, and 72 kilograms per cubic meter and thicknesses of 13.3, 26.6 and 39.9 millimeters. Seven samples were tested such that the applied heat flux vector was aligned with local gravity vector to eliminate natural convection as a mode of heat transfer. Two samples were tested with reverse orientation to investigate natural convection effects. It was determined that for the fibrous insulation densities and thicknesses investigated no heat transfer takes place through natural convection. A finite volume numerical model was developed to solve the governing combined radiation and conduction heat transfer equations. Various methods of modeling the gas/solid conduction interaction in fibrous insulations were investigated. The radiation heat transfer was modeled using the modified two-flux approximation assuming anisotropic scattering and gray medium. A genetic-algorithm based parameter estimation technique was utilized with this model to determine the relevant radiative properties of the fibrous insulation over the temperature range of 300-1300 K. The parameter estimation was performed by least square minimization of the difference between measured and predicted values of effective thermal conductivity at a density of 24 kilograms per cubic meters and at nominal pressures of 1.33 x 10(exp -4) and 99.98 kPa. The numerical model was validated by comparison with steady-state effective thermal conductivity measurements at other densities and pressures. The numerical model was also validated by comparison with a transient thermal test simulating reentry aerodynamic heating conditions.

Daryabeigi, Kamran↗

Monte Carlo predictions of DNA fragment-size distributions for large sizes after HZE particle irradiation

DSBs (double-strand breaks) produced by densely ionizing space radiation are not located randomly in the genome: recent data indicate DSB clustering along chromosomes. DSB clustering at large scales, from >100 Mbp down to approximately 2 kbp, is modeled using a Monte-Carlo algorithm. A random-walk model of chromatin is combined with a track model, that predicts the radial distribution of energy from an ion, and the RLC (randomly-located-clusters) formalism, in software called DNAbreak. This model generalizes the random-breakage model, whose broken-stick fragment-size distribution is applicable to low-LET radiation. DSB induction due to track interaction with the DNA volume depends on the radiation quality parameter Q. This dose-independent parameter depends only weakly on LET. Multi-track, high-dose effects depend on the cluster intensity parameter lambda, proportional to fluence as defined by the RLC formalism. After lambda is determined by a numerical experiment, the model reduces to one adjustable parameter Q. The best numerical fits to the experimental data, determining Q, are obtained. The knowledge of lambda and Q allows us to give biophysically based extrapolations of high-dose DNA fragment-size data to low doses or to high LETs.

NASA Center JSC↗

An Implicit Upwind Algorithm for Computing Turbulent Flows on Unstructured Grids

An implicit, Navier-Stokes solution algorithm is presented for the computation of turbulent flow on unstructured grids. The inviscid fluxes are computed using an upwind algorithm and the solution is advanced in time using a backward-Euler time-stepping scheme. At each time step, the linear system of equations is approximately solved with a point-implicit relaxation scheme. This methodology provides a viable and robust algorithm for computing turbulent flows on unstructured meshes. Results are shown for subsonic flow over a NACA 0012 airfoil and for transonic flow over a RAE 2822 airfoil exhibiting a strong upper-surface shock. In addition, results are shown for 3 element and 4 element airfoil configurations. For the calculations, two one equation turbulence models are utilized. For the NACA 0012 airfoil, a pressure distribution and force data are compared with other computational results as well as with experiment. Comparisons of computed pressure distributions and velocity profiles with experimental data are shown for the RAE airfoil and for the 3 element configuration. For the 4 element case, comparisons of surface pressure distributions with experiment are made. In general, the agreement between the computations and the experiment is good.

Anerson, W. Kyle↗

On a finite element CFD algorithm for compressible, viscous and turbulent aerodynamic flows

This paper develops and analyses individual construction aspects of an efficient and accurate finite element algorithm for prediction of viscous and turbulent flow fields of impact in aerodynamics. The theoretical construction employs a Taylor weak statement (TWS) for coincident embedding of stability mechanisms within a classic Galerkin finite element formulation of semidiscrete approximation error orthogonalization. A wide variety of the stabilizing mechanisms of independently derived CFD algorithms are contained within the TWS theory. An implicit construction that meets the requirement of efficient convergence to steady state is developed. The theoretical asymptotic error estimates of the TWS finite element algorithm for supersonic and viscous boundary layer flows are verified. Application to a three-dimensional turbulent flow is cited.

Baker, A. J.↗

SeaWiFS technical report series. Volume 4: An analysis of GAC sampling algorithms. A case study

The Sea-viewing Wide Field-of-view Sensor (SeaWiFS) instrument will sample at approximately a 1 km resolution at nadir which will be broadcast for reception by realtime ground stations. However, the global data set will be comprised of coarser four kilometer data which will be recorded and broadcast to the SeaWiFS Project for processing. Several algorithms for degrading the one kilometer data to four kilometer data are examined using imagery from the Coastal Zone Color Scanner (CZCS) in an effort to determine which algorithm would best preserve the statistical characteristics of the derived products generated from the one kilometer data. Of the algorithms tested, subsampling based on a fixed pixel within a 4 x 4 pixel array is judged to yield the most consistent results when compared to the one kilometer data products.

Yeh, Eueng-Nan↗

Stacking sequence optimization of simply supported laminates with stability and strain constraints

An integer programming formulation for the design of symmetric and balanced rectangular composite laminates with simply supported boundary conditions subject to buckling and strain constraints is presented. The design variables that define the stacking sequence of the laminate are ply-identity zero-one integers. The buckling constraint is linear in terms of the ply-identity design variables, but strains are nonlinear functions of these variables. A linear approximation is developed for the strain constraints so that the problem can be solved by sequential linearization using the branch and bound algorithm. Examples of graphite-epoxy plates under biaxial compression are presented. Optimum stacking sequences obtained using the linear approximation are compared with global optimum designs obtained using a genetic search procedure.

Nagendra, S.↗

Approximate estimation for systems with quantized data.

Estimation of the state of a nonlinear discrete-time system using quantized data is considered. An exact solution for the maximum likelihood estimate is expressed as the solution of a nonlinear two-point boundary-value problem. Approximate recursive solutions for both the maximum likelihood and the conditional-mean estimates are obtained. The results of Monte-Carlo simulations are presented in which the performance of these two algorithms is compared with that of a Kalman filter in which the quantization error is approximated by white noise.-

Clements, K. A.↗

Formulation and implementation of nonstationary adaptive estimation algorithm with applications to air-data reconstruction

The dynamics model and data sources used to perform air-data reconstruction are discussed, as well as the Kalman filter. The need for adaptive determination of the noise statistics of the process is indicated. The filter innovations are presented as a means of developing the adaptive criterion, which is based on the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of the filter innovations is presented. The algorithm as developed is applied to air-data reconstruction for the space shuttle, and data obtained from the third landing are presented. To verify the performance of the adaptive algorithm, the reconstruction is also performed using a constant covariance Kalman filter. The results of the reconstructions are compared, and the adaptive algorithm exhibits better performance.

Whitmore, S. A.↗

Formulation and implementation of nonstationary adaptive estimation algorithm with applications to air-data reconstruction

The dynamics model and data sources used to perform air-data reconstruction are discussed, as well as the Kalman filter. The need for adaptive determination of the noise statistics of the process is indicated. The filter innovations are presented as a means of developing the adaptive criterion, which is based on the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of the filter innovations is presented. The algorithm as developed is applied to air-data reconstruction for the Space Shuttle, and data obtained from the third landing are presented. To verify the performance of the adaptive algorithm, the reconstruction is also performed using a constant covariance Kalman filter. The results of the reconstructions are compared, and the adaptive algorithm exhibits better performance.

Whitmore, S. A.↗

Effect of grid aspect ratio on convergence

The effects of high-aspect-ratio grids on algorithm convergence are considered by means of vector stability theory and computational experiments. The results indicate that approximately factored implicit schemes experience convergence deterioration because of nonoptimum local time-stepping procedures and increased need for viscous preconditioning. Based on this insight, an enhanced algorithm is devised using improved selection of the local time step, appropriate definition of the viscous preconditioning matrix, and proper implementation of the boundary conditions. The new algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

nu-Anomica: A Fast Support Vector Based Novelty Detection Technique

In this paper we propose nu-Anomica, a novel anomaly detection technique that can be trained on huge data sets with much reduced running time compared to the benchmark one-class Support Vector Machines algorithm. In -Anomica, the idea is to train the machine such that it can provide a close approximation to the exact decision plane using fewer training points and without losing much of the generalization performance of the classical approach. We have tested the proposed algorithm on a variety of continuous data sets under different conditions. We show that under all test conditions the developed procedure closely preserves the accuracy of standard one-class Support Vector Machines while reducing both the training time and the test time by 5 - 20 times.

Das, Santanu↗

GOES-17 Magnetometer On-Orbit Calibration Design and Results

The Geostationary Operational Environmental Satellite-R (GOES-R) is a series of four NOAA weather satellites. Each spacecraft flies a Magnetometer instrument which includes two boom mounted fluxgate sensors located 6.3 and 8.5 meters from the spacecraft. Sensor readings are corrupted by both internal (bias and scale factor) and external (spacecraft emitted fields and misalignments) error sources. In order to estimate the bias, an on-orbit calibration is performed, slewing the spacecraft about multiple axes and then performing a fit of the data to determine zero offset and misalignment terms. The first satellite in the series, GOES-16 was launched in November 2016. Its magnetometer calibration maneuver was found to be inadequate providing insufficient rotation about orthogonal axes. The uncertainty in the estimated biases was found to be in the 3-5 nanotesla range, exceeding the magnetometer accuracy requirement of 1.0 nanotesla. Based on lessons learned, the maneuver was redesigned to provide multiple 360 degree rotations about two orthogonal axes, providing optimal visibility into bias and misalignment. Varying ambient fields over the duration of the calibration maneuvers, corrupts the ability to accurately determine parameters of interest. To address this issue, rather than assuming a constant field for the duration of the maneuver, a non-linear least squares filter was employed that uses a series of spline functions to better fit the ambient field. The number of splines can be varied to minimize the least squares filter residuals. Simulations were performed using 360 days of GOES-16 data to bound the uncertainty in the biases for given residuals of the fit to the ambient field. Following the launch of the second satellite in the series, GOES-17 in March 2018, the new calibration maneuver and enhanced bias estimation algorithm were exercised twice. Based on the residuals of the fit, the uncertainty of the estimated zero offset was reduced by an order of magnitude from 3-5 nanotesla to approximately 0.4 nanotesla per axis. This paper provides details of the maneuver design and the innovative algorithm used to estimate the GOES-17 biases and misalignments.

GOES-17↗

Solution to the hidden-line problem

It is pointed out that realistic three-dimensional renderings of solid objects or surfaces by computers have long been needed. The NASA Dryden Flight Research Center will soon publish a report and the computer program on an algorithm that solves for hidden lines. The computer program is written in FORTRAN IV and its size is approximately 35N + 9500 words, where N is the number of elements. A number of pictures are presented which were drawn by a computer using the algorithm.

Hedgley, D. R.↗

Description of a Normal-Force In-Situ Turbulence Algorithm for Airplanes

A normal-force in-situ turbulence algorithm for potential use on commercial airliners is described. The algorithm can produce information that can be used to predict hazardous accelerations of airplanes or to aid meteorologists in forecasting weather patterns. The algorithm uses normal acceleration and other measures of the airplane state to approximate the vertical gust velocity. That is, the fundamental, yet simple, relationship between normal acceleration and the change in normal force coefficient is exploited to produce an estimate of the vertical gust velocity. This simple approach is robust and produces a time history of the vertical gust velocity that would be intuitively useful to pilots. With proper processing, the time history can be transformed into the eddy dissipation rate that would be useful to meteorologists. Flight data for a simplified research implementation of the algorithm are presented for a severe turbulence encounter of the NASA ARIES Boeing 757 research airplane. The results indicate that the algorithm has potential for producing accurate in-situ turbulence measurements. However, more extensive tests and analysis are needed with an operational implementation of the algorithm to make comparisons with other algorithms or methods.

Stewart, Eric C.↗