Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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,423 records · Page 79

Pterodactyl: The Development and Performance of Guidance Algorithms for a Mechanically Deployed Entry Vehicle

Pterodactyl is a NASA Space Technology Mission Directorate (STMD) project focused on developing a design capabilityfor optimal, scalable, Guidance and Control (G&C) solutions that enable precision targeting for Deployable Entry Vehicles(DEVs). This feasibility study is unique in that it focuses on the rapid integration of targeting performance analysis withstructural &packaging analysis, which is especially challenging for new vehicle and mission designs. This paper will detailthe guidance development and trajectory design process for a lunar return mission, selected to stress the vehicle designsand encourage future scalability. For the five G&C configurations considered, the Fully Numerical Predictor-CorrectorEntry Guidance (FNPEG) was selected for configurations requiring bank angle guidance and FNPEG with Uncoupled

Johnson, Breanna↗

Exploiting Machine Learning in Multiscale Modelling of Materials

Recent developments in efficient machine learning algorithms have spurred significant interest in the materials community. The inherently complex and multiscale problems in Materials Science and Engineering pose a formidable challenge. The present scenario of machine learning research in Materials Science has a clear lacunae, where efficient algorithms are being developed as a separate endeavour, while such methods are being applied as ‘black-box’ models by others. The present article aims to discuss pertinent issues related to the development and application of machine learning algorithms for various aspects of multiscale materials modelling. The authors present an overview of machine learning of equivariant properties, machine learning-aided statistical mechanics, the incorporation of ab initio approaches in multiscale models of materials processing and application of machine learning in uncertainty quantification. In addition to the above, the applicability of Bayesian approach for multiscale modelling will be discussed. Critical issues related to the multiscale materials modelling are also discussed.

42 ENGINEERING↗

Concurrent processing in nonlinear structural stability

A concurrent processing algorithm is developed for materially nonlinear stability analysis of imperfect columns with biaxial partial rotational end restraints. The algorithm for solving the governing nonlinear ordinary differential equations is implemented on a multiprocessor computer called the 'Finite Element Machine', developed at the NASA Langley Research Center. Numerical results are obtained on up to nine concurrent processors. A substantial computational gain is achieved in using the parallel processing approach.

Darbhamulla, S. P.↗

Satellite-Based Stratospheric and Tropospheric Measurements: Determination of Global Ozone and other Trace Species

This report summarizes research done under NASA Grant NAG5-3461 from November 1, 1996 through December 31, 2000. The research performed during this reporting period includes development and maintenance of scientific software for the GOME retrieval algorithms, consultation on operational software development for GOME, sensitivity and instrument studies to help finalize the definition of the SCIAMACHY instrument, leading the development of the SCIAMACHY Scientific Requirements Document for Data and Algorithm Development, consultation and development for SCIAMACHY near-real-time (NRT) and off-line (OL) data products, radiative transfer model development for utilization in GOME, SCIAMACHY and other programs, development of infrared line-by-line atmospheric modeling and retrieval capability for SCIAMACHY, and participation in GOME and SCIAMACHY validation studies. The Global Ozone Monitoring Experiment was successfully launched on the ERS-2 satellite on April 20, 1995, and remains working in normal fashion. SCIAMACHY is currently planned for launch in late 2001 on the ESA Envisat satellite. Three GOME-2 instruments are now scheduled to fly on the Metop series of operational meteorological satellites (Eumetsat). K. Chance is a member of the reconstituted GOME Scientific Advisory Group, which will guide the GOME-2 program as well as the continuing ERS-2 GOME program.

Chance, K. V.↗

A grid-embedding transonic flow analysis computer program for wing/nacelle configurations

An efficient grid-interfacing zonal algorithm was developed for computing the three-dimensional transonic flow field about wing/nacelle configurations. the algorithm uses the full-potential formulation and the AF2 approximate factorization scheme. The flow field solution is computed using a component-adaptive grid approach in which separate grids are employed for the individual components in the multi-component configuration, where each component grid is optimized for a particular geometry such as the wing or nacelle. The wing and nacelle component grids are allowed to overlap, and flow field information is transmitted from one grid to another through the overlap region using trivariate interpolation. This report represents a discussion of the computational methods used to generate both the wing and nacelle component grids, the technique used to interface the component grids, and the method used to obtain the inviscid flow solution. Computed results and correlations with experiment are presented. also presented are discussions on the organization of the wing grid generation (GRGEN3) and nacelle grid generation (NGRIDA) computer programs, the grid interface (LK) computer program, and the wing/nacelle flow solution (TWN) computer program. Descriptions of the respective subroutines, definitions of the required input parameters, a discussion on interpretation of the output, and the sample cases illustrating application of the analysis are provided for each of the four computer programs.

Atta, E. H.↗

Development of an explicit multigrid algorithm for quasi-three-dimensional viscous flows in turbo-machinery

A rapid quasi three-dimensional analysis was developed for blade-to-blade flows in turbomachinery. The analysis solves the unsteady Euler or thin layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stream-surface thickness. The Baldwin-Lomax eddy-viscosity model is used for turbulent flows. The equations which are solved by a two-stage Runge-Kutta scheme made efficient by use of vectorization, a variable time-step, and a flux-based multigrid scheme, are described. A stability analysis is presented for the two-stage scheme. Results for a flat-plate model problem show the applicability of the method to axial, radial, and rotating geometries. Results for a centrifugal impeller and a radial diffuser show that the quasi three-dimensional viscous analysis can be a practical design tool.

Chima, R. V.↗

A Taylor-Galerkin finite element algorithm for transient nonlinear thermal-structural analysis

A Taylor-Galerkin finite element solution algorithm for transient nonlinear thermal-structural analysis of large, complex structural problems subjected to rapidly applied thermal-structural loads is described. The two-step Taylor-Galerkin algorithm is an application of an algorithm recently developed for problems in compressible fluid dynamics. The element integrals that appear in the algorithm can be evaluated in closed form for two and three dimensional elements.

Thornton, Earl A.↗

Efficient multiplication algorithms over the finite fields GF(q sup m), where q equals 3,5

Finite field multiplication is central to coding theory. For this application, there is a need for a multiplication algorithm which can be realized easily on VLSI chips. A new algorithm is developed which is based on the Babylonian multiplication technique utilizing tables of squares. This algorithm is applied to the finite fields GF(q sup m), where q equals 3 and 5. It is also shown that this multiplier can be used to compute complex multiplications defined on the direct sum of two identical copies of such Galois fields.

Truong, T. K.↗

Implementation of an algorithm for cylindrical object identification using range data

One of the problems in 3-D object identification and localization is addressed. In robotic and navigation applications the vision system must be able to distinguish cylindrical or spherical objects as well as those of other geometric shapes. An algorithm was developed to identify cylindrical objects in an image when range data is used. The algorithm incorporates the Hough transform for line detection using edge points which emerge from a Sobel mask. Slices of the data are examined to locate arcs of circles using the normal equations of an over-determined linear system. Current efforts are devoted to testing the computer implementation of the algorithm. Refinements are expected to continue in order to accommodate cylinders in various positions. A technique is sought which is robust in the presence of noise and partial occlusions.

Bozeman, Sylvia T.↗

A fast, uncoupled, compressible, two-dimensional, unsteady boundary layer algorithm with separation for engine inlets

A finite difference boundary layer algorithm was developed to model viscous effects when an inviscid core flow solution is given. This algorithm solved each boundary layer equation separately, then iterated to find a solution. Solving the boundary layer equations sequentially was 2.4 to 4.0 times faster than solving the boundary layer equations simultaneously. This algorithm used a modified Baldwin-Lomax turbulence model, a weighted average of forward and backward differencing of the pressure gradient, and a backward sweep of the pressure. With these modifications, the boundary layer algorithm was able to model flows with and without separation. The number of grid points used in the boundary layer algorithm affected the stability of the algorithm as well as the accuracy of the predictions of friction coefficients and momentum thicknesses. Results of this boundary layer algorithm compared well with experimental observations of friction coefficients and momentum thicknesses. In addition, when used interactively with an inviscid flow algorithm, this boundary layer algorithm corrected for viscous effects to give a good match with experimental observations for pressures in a supersonic inlet.

Roach, Robert L.↗

A 3D finite element multigrid solver for the Euler equations

A low storage, computationally efficient algorithm for the solution of the compressible Euler equations on unstructured tetrahedral meshes is developed. The algorithm takes the form of a centered scheme with the explicit addition of a high accuracy artificial viscosity and the solution is advanced to steady state by means of a multistage timestepping method. The side-based data structure which is employed enables a clear connection to be established between the proposed algorithm and upwind cell vertex schemes for unstructured meshes. The computational efficiency of the procedure is improved by incorporating an unstructured multigrid acceleration procedure. A number of flows of practical interest are analyzed to demonstrate the numerical performance of the proposed approach.

Peraire, J.↗

A fast, uncoupled, compressible, two-dimensional, unsteady boundary layer algorithm with separation for engine inlets

A finite difference boundary layer algorithm was developed to model viscous effects when an inviscid core flow solution is given. This algorithm solved each boundary layer equation separately, then iterated to find a solution. Solving the boundary layer equations sequentially was 2.4 to 4.0 times faster than solving the boundary layer equations simultaneously. This algorithm used a modified Baldwin-Lomax turbulence model, a weighted average of forward and backward differencing of the pressure gradient, and a backward sweep of the pressure. With these modifications, the boundary layer algorithm was able to model flows with and without separation. The number of grid points used in the boundary layer algorithm affected the stability of the algorithm affected the stability of the algorithm as well as the accuracy of the predictions of friction coefficients and momentum thicknesses. Results of this boundary layer algorithm compared well with experimental observations of friction coefficients and momentum thicknesses. In addition, when used interactively with an inviscid flow algorithm, this boundary layer algorithm corrected for viscous effects to give a good match with experimental observations for pressures in a supersonic inlet.

Roach, Robert L.↗

Traffic routing for multicomputer networks with virtual cut-through capability

Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

Kandlur, Dilip D.↗

A new algorithm for L2 optimal model reduction

In this paper the quadratically optimal model reduction problem for single-input, single-output systems is considered. The reduced order model is determined by minimizing the integral of the magnitude-squared of the transfer function error. It is shown that the numerator coefficients of the optimal approximant satisfy a weighted least squares problem and, on this basis, a two-step iterative algorithm is developed combining a least squares solver with a gradient minimizer. Convergence of the proposed algorithm to stationary values of the quadratic cost function is proved. The formulation is extended to handle the frequency-weighted optimal model reduction problem. Three examples demonstrate the optimization algorithm.

Spanos, J. T.↗

Global Retrieval of Cloud Particle Size and Optical Thickness Using ISCCP Data

The primary thrust of this investigation is to develop an algorithm to retrieve cloud particle sizes using ISCCP data. The research under this grant has been successful in obtaining initial results of global distribution of ice-particle sizes. Further research about possible problems caused by nonsphericity of ice particle sizes is currently underway. An algorithm of retrieving ice-cloud particle sizes using ISCCP CX data has been developed. The first survey of ice-particle size in a near-global scale has been completed. Comparison with in situ measurements of ice crystal sizes during FIRE I shows good agreement. The initial results show that the global mean size of ice crystals (De) is about 60 micron. This result is consistent with the range of in situ measurements all over the world if definitions of effective particle size are unified (see next section). The survey also shows that there is no distinct difference of ice-particle sizes between continental and maritime ice-clouds. There are many different definitions of effective particle size used in ice-cloud research. Simple comparisons between values of in situ measurement and satellite remote sensing are misleading and may lead to incorrect conclusions. We reviewed different definitions of effective particle sizes used in the literature and compared their relative magnitudes.

Welch, Ronald M.↗

Measurements With a Split-Fiber Probe in Complex Unsteady Flows

A split-fiber probe was used to acquire unsteady data in a research compressor. A calibration method was devised for a split-fiber probe, and a new algorithm was developed to decompose split-fiber probe signals into velocity magnitude and direction. The algorithm is based on the minimum value of a merit function that is built over the entire range of flow velocities for which the probe was calibrated. The split-fiber probe performance and signal decomposition was first verified in a free-jet facility by comparing the data from three thermo-anemometric probes, namely a single-wire, a single-fiber, and the split-fiber probe. All three probes performed extremely well as far as the velocity magnitude was concerned. However, there are differences in the peak values of measured velocity unsteadiness in the jet shear layer. The single-wire probe indicates the highest unsteadiness level, followed closely by the split-fiber probe. The single-fiber probe indicates a noticeably lower level of velocity unsteadiness. Experiments in the NASA Low Speed Axial Compressor facility revealed similar results. The mean velocities agreed well, and differences in the velocity unsteadiness are similar to the case of a free jet. A reason for these discrepancies is in the different frequency response characteristics of probes used. It follows that the single-fiber probe has the slowest frequency response. In summary, the split-fiber probe worked reliably during the entire program. The acquired data averaged in time followed closely data acquired by conventional pneumatic probes.

Lepicovsky, Jan↗

Efficient Jitter Analysis for Spacecraft

Typically in space missions, the science instruments require a specific degree of pointing accuracy as well as dynamical quietness. This dynamical quietness, which is needed to allow the instruments to make measurements (remote sensing applications) or perform other functions, is usually characterized in terms of jitter and stability specifications. In order to insure that the spacecraft meets the requirements of its instruments, several jitter analyses are performed throughout the design phase of the spacecraft and beyond as the models of the spacecraft, its components, and disturbances mature. Each such analysis involves the simulation of the spacecraft and instrument dynamical response to all known disturbance scenarios, followed by the computation of jitter values for each instrument based on the specified jitter time windows. The direct approach for computing jitter values by sweeping maxima and minima throughout the time history may be costly in the computational sense as the size and number of the time histories involved could be quite large. Keeping in mind that typical spacecraft simulation time histories may easily involve hundreds of thousands or millions of points, it is imperative that a jitter analysis algorithm be developed which is more efficient than the direct approach. This paper presents a vectorized algorithm for efficient computation of spacecraft jitter values. The algorithm identifies the extreme points in the time history, which are the points that may dominate the jitter values depending on the location of the jitter window along the time history. The span of influence of each extremum is then computed by the algorithm and used in an efficient and vectorized fashion to obtain the jitter values. The algorithm deals with the multiple jitter windows 2 sequentially, first computing jitter values for the smallest time window, then looping over the remaining time windows until all jitter values are computed. A numerical example is carried out to demonstrate the efficiency and feasibility of the proposed jitter analysis technique.

Maghami, Peiman G.↗

Automatic Segmentation of Building Envelope Point Cloud Data Using Machine Learning

About 50% of buildings in the US were constructed before energy codes were introduced. Modular overclad panel retrofits, in which a new envelope is constructed over the existing building, are a promising solution given that it minimizes occupant disruption and shortens construction time at the jobsite. Current state-of-the-art retrofit panel layout and dimensioning consists of three steps: 1) 3D point cloud data generation of the building envelope using commonly available surveying equipment, 2) manual segmentation of 3D point cloud data by a trained professional to identify and dimension window openings, door openings, and other architectural features, and 3) modular panel layout optimization and dimensioning by an architect or engineer. Among these steps, the second one remains the most difficult and costly because it is very labor-intensive. We propose a methodology to automatically label 3D point cloud data to reduce the time and expense spent in manual segmentation. Machine learning methods were employed to classify the point cloud data into distinct groups, each of which corresponds to different features of the building envelope. After classification, a segmentation algorithm was developed to perform boundary detection and separate the components of the façade. Finally, the algorithm returns the relative positions and dimensions of the features in the building envelope. The measurements obtained with the proposed automated method were compared against the actual dimensions to determine the overall algorithm accuracy. The proposed algorithm can then be used to reduce manual efforts for 3D point cloud labeling before modular panel layout optimization is performed.

Maldonado Puente, Bryan↗