Characterization of Additively Manufactured Circular Disks Using Traditional Computed Tomography Volume Segmentation and Machine Learning Algorithms.
Abstract not provided.
Miers, John Carter↗
SEARCH · Engineering Papers
Results for “Computer algorithms”
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.
Adaptive computing techniques
Adaptive local algorithm and convergence speed of multimodal multidimensional function
Schmitt, E.↗
Computer program for fast Karhunen Loeve transform algorithm
The fast KL transform algorithm was applied for data compression of a set of four ERTS multispectral images and its performance was compared with other techniques previously studied on the same image data. The performance criteria used here are mean square error and signal to noise ratio. The results obtained show a superior performance of the fast KL transform coding algorithm on the data set used with respect to the above stated perfomance criteria. A summary of the results is given in Chapter I and details of comparisons and discussion on conclusions are given in Chapter IV.
Jain, A. K.↗
Implementation on a nonlinear concrete cracking algorithm in NASTRAN
A computer code for the analysis of reinforced concrete structures was developed using NASTRAN as a basis. Nonlinear iteration procedures were developed for obtaining solutions with a wide variety of loading sequences. A direct access file system was used to save results at each load step to restart within the solution module for further analysis. A multi-nested looping capability was implemented to control the iterations and change the loads. The basis for the analysis is a set of mutli-layer plate elements which allow local definition of materials and cracking properties.
Herting, D. N.↗
F100 Multivariable Control Synthesis Program. Computer Implementation of the F100 Multivariable Control Algorithm
As turbofan engines become more complex, the development of controls necessitate the use of multivariable control techniques. A control developed for the F100-PW-100(3) turbofan engine by using linear quadratic regulator theory and other modern multivariable control synthesis techniques is described. The assembly language implementation of this control on an SEL 810B minicomputer is described. This implementation was then evaluated by using a real-time hybrid simulation of the engine. The control software was modified to run with a real engine. These modifications, in the form of sensor and actuator failure checks and control executive sequencing, are discussed. Finally recommendations for control software implementations are presented.
Soeder, J. F.↗
An economical semi-analytical orbit theory for micro-computer applications
An economical algorithm is presented for predicting the position of a satellite perturbed by drag and zonal harmonics J2 through J4. Simplicity being of the essence, drag is modeled as a secular decay rate in the semimajor axis (retarded motion) with the zonal perturbations modeled from a modified version of Brouwers formulas. The algorithm is developed as an alternative on-board orbit predictor; a back up propagator requiring low energy consumption; or a ground based propagator for microcomputer applications (e.g., at the foot of an antenna). An O(J2) secular retarded state partial matrix (matrizant) is also given to employ with state estimation. The theory has been implemented in BASIC on an inexpensive microcomputer, the program occupying under 8K bytes of memory. Simulated trajectory data and real tracking data are employed to illustrate the theory's ability to accurately accommodate oblateness and drag effects.
Gordon, R. A.↗
An economical semi-analytical orbit theory for micro-computer applications
An economical algorithm is presented for predicting the position of a satellite perturbed by drag and zonal harmonics J sub 2 through J sub 4. Simplicity being of the essence, drag is modeled as a secular decay rate in the semi-axis (retarded motion); with the zonal perturbations modeled from a modified version of the Brouwers formulas. The algorithm is developed as: an alternative on-board orbit predictor; a back up propagator requiring low energy consumption; or a ground based propagator for microcomputer applications (e.g., at the foot of an antenna). An O(J sub 2) secular retarded state partial matrix (matrizant) is also given to employ with state estimation. The theory was implemented in BASIC on an inexpensive microcomputer, the program occupying under 8K bytes of memory. Simulated trajectory data and real tracking data are employed to illustrate the theory's ability to accurately accommodate oblateness and drag effects.
Gordon, R. A.↗
A multidimensional model for aerosols - Description of computational analogs
The numerical algorithms used to simulate the advection, diffusion, sedimentation, coagulation, and condensational growth of atmospheric aerosols are described. The model can be used in one, two, or three spatial dimensions. The continuity equation in a generalized horizontal and vertical coordinate system is developed, which allows the model to be quickly adapted to a wide variety of dynamical models of global or regional scale. Algorithms are developed to treat the various physical processes, and the results of simulations are presented, which show the strengths and weaknesses of these algorithms. Although the emphasis is on the modeling of aerosols, the work is also applicable to the simulations of the transport of gases.
Toon, O. B.↗
Knowledge-based low-level image analysis for computer vision systems
Two algorithms for entry-level image analysis and preliminary segmentation are proposed which are flexible enough to incorporate local properties of the image. The first algorithm involves pyramid-based multiresolution processing and a strategy to define and use interlevel and intralevel link strengths. The second algorithm, which is designed for selected window processing, extracts regions adaptively using local histograms. The preliminary segmentation and a set of features are employed as the input to an efficient rule-based low-level analysis system, resulting in suboptimal meaningful segmentation.
Dhawan, Atam P.↗
Parallel Architectures and Parallel Algorithms for Integrated Vision Systems
Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is a system that uses vision algorithms from all levels of processing to perform for a high level application (e.g., object recognition). An IVS normally involves algorithms from low level, intermediate level, and high level vision. Designing parallel architectures for vision systems is of tremendous interest to researchers. Several issues are addressed in parallel architectures and parallel algorithms for integrated vision systems.
Choudhary, Alok Nidhi↗
Numerical algorithm comparison for the accurate and efficient computation of high-incidence vortical flow
Computations from two Navier-Stokes codes, NSS and F3D, are presented for a tangent-ogive-cylinder body at high angle of attack. Features of this steady flow include a pair of primary vortices on the leeward side of the body as well as secondary vortices. The topological and physical plausibility of this vortical structure is discussed. The accuracy of these codes are assessed by comparison of the numerical solutions with experimental data. The effects of turbulence model, numerical dissipation, and grid refinement are presented. The overall efficiency of these codes are also assessed by examining their convergence rates, computational time per time step, and maximum allowable time step for time-accurate computations. Overall, the numerical results from both codes compared equally well with experimental data, however, the NSS code was found to be significantly more efficient than the F3D code.
Chaderjian, Neal M.↗
Scheme For Finite-Difference Computations Of Waves
Compact algorithms generating and solving finite-difference approximations of partial differential equations for propagation of waves obtained by new method. Based on concept of discrete dispersion relation. Used in wave propagation to relate frequency to wavelength and is key measure of wave fidelity.
Davis, Sanford↗
The computation of three-dimensional flows using unstructured grids
A general method is described for automatically discretizing, into unstructured assemblies of tetrahedra, the three-dimensional solution domains of complex shape which are of interest in practical computational aerodynamics. An algorithm for the solution of the compressible Euler equations which can be implemented on such general unstructured tetrahedral grids is described. This is an explicit cell-vertex scheme which follows a general Taylor-Galerkin philosophy. The approach is employed to compute a transonic inviscid flow over a standard wing and the results are shown to compare favorably with experimental observations. As a more practical demonstration, the method is then applied to the analysis of inviscid flow over a complete modern fighter configuration. The effect of using mesh adaptivity is illustrated when the method is applied to the solution of high speed flow in an engine inlet.
Morgan, K.↗
Adaptive remeshing for three-dimensional compressible flow computations
A practical solution algorithm for steady 3D Euler flows is presented. This algorithm employs coupling of a surface triangulator, an automatic tetrahedral mesh generator, an unstructured grid flow solver, and an error estimation procedure. The performance of the method is illustrated using a shock interaction problem in high Mach number flow over a swept circular cylinder.
Peraire, J.↗
Improvements to GlennICE Collection Efficiency Algorithm
GlennICE (Glenn Icing Computational Environment) is a computational tool designed to calculate ice growth on complex three-dimensional geometries using the input from a user-supplied computational fluid dynamics (CFD) solution for the geometry of interest. The NASA John H. Glenn Research Center at Lewis Field is developing this tool to aid those evaluating, designing and certifying aircraft, engines, and aircraft components for flight in icing conditions. This domestically available software is being developed to enable the introduction of new icing physics into a computational environment in a manner that is open for evaluation and eventual use by industry, academia, and other government organizations. This paper will document recent improvements that reduce the number of trajectories needed to converge on collection efficiency. These improvements are documented using example cases with complex geometries.
Aircraft Icing↗
Improvements to GlennICE Collection Efficiency Algorithm
GlennICE (Glenn Icing Computational Environment) is a computational tool designed to calculate ice growth on complex three-dimensional geometries using the input from a user-supplied computational fluid dynamics (CFD) solution for the geometry of interest. The NASA John H. Glenn Research Center at Lewis Field is developing this tool to aid those evaluating, designing and certifying aircraft, engines, and aircraft components for flight in icing conditions. This domestically available software is being developed to enable the introduction of new icing physics into a computational environment in a manner that is open for evaluation and eventual use by industry, academia, and other government organizations. This paper will document recent improvements that reduce the number of trajectories needed to converge on collection efficiency. These improvements are documented using example cases with complex geometries.
Aircraft Icing↗
Computation of multi-dimensional viscous supersonic jet flow
A new method has been developed for two- and three-dimensional computations of viscous supersonic flows with embedded subsonic regions adjacent to solid boundaries. The approach employs a reduced form of the Navier-Stokes equations which allows solution as an initial-boundary value problem in space, using an efficient noniterative forward marching algorithm. Numerical instability associated with forward marching algorithms for flows with embedded subsonic regions is avoided by approximation of the reduced form of the Navier-Stokes equations in the subsonic regions of the boundary layers. Supersonic and subsonic portions of the flow field are simultaneously calculated by a consistently split linearized block implicit computational algorithm. The results of computations for a series of test cases relevant to internal supersonic flow is presented and compared with data. Comparison between data and computation are in general excellent thus indicating that the computational technique has great promise as a tool for calculating supersonic flow with embedded subsonic regions. Finally, a User's Manual is presented for the computer code used to perform the calculations.
Kim, Y. N.↗
Quantum optimization algorithms: Energetic implications
Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.
97 MATHEMATICS AND COMPUTING↗