Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex 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.

At least 271 records · Page 15

Solution-adaptive program SADAP3D

A generic solution-adaptive grid program based on an error equi-distribution concept has been developed for use in complex multidimensional flows. The capability of a generic, user-friendly, multidimensional algorithm is demonstrated using several complex 3D flows in high-speed regimes. A simple scheme enforces the continuity of grid spacing along each currently adapted grid line as the computation proceeds. Calculation of normal vectors at each point of a grid plane is enhanced. The grid movement is automatically controlled by reinstating grid-spacing continuity locally in the mainstream of the unidirectional computation. It is concluded that the scheme can be readily coupled with many flow solvers to enhance accuracy and efficiency of solutions.

Djomehri, M. J.↗

Implementation of a Very Large Atmospheric Correction Lookup Table for ASTER Using a Relational Database Management System

The Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER)is designed to provide a high resolution map of the Earth in both visible, near-infrared, and thermal spectral regions of the electromagnetic spectrum. The ASTER Science Team has developed several standard data product algorithms, but the most complex aod computing-intensive of these is the estimation of surface radiance and reflectance values, which is done by modeling and correcting for the effects of the atmosphere. The algorithm for atmospheric correction in the visible bands sensed by ASTER calls for use of a very large Atmospheric Correction Look Up Table (ACLUT).

ASTER↗

Conservative Patch Algorithm and Mesh Sequencing for PAB3D

A mesh-sequencing algorithm and a conservative patched-grid-interface algorithm (hereafter Patch Algorithm ) have been incorporated into the PAB3D code, which is a computer program that solves the Navier-Stokes equations for the simulation of subsonic, transonic, or supersonic flows surrounding an aircraft or other complex aerodynamic shapes. These algorithms are efficient, flexible, and have added tremendously to the capabilities of PAB3D. The mesh-sequencing algorithm makes it possible to perform preliminary computations using only a fraction of the grid cells (provided the original cell count is divisible by an integer) along any grid coordinate axis, independently of the other axes. The patch algorithm addresses another critical need in multi-block grid situation where the cell faces of adjacent grid blocks may not coincide, leading to errors in calculating fluxes of conserved physical quantities across interfaces between the blocks. The patch algorithm, based on the Stokes integral formulation of the applicable conservation laws, effectively matches each of the interfacial cells on one side of the block interface to the corresponding fractional cell area pieces on the other side. This approach is comprehensive and unified such that all interface topology is automatically processed without user intervention. This algorithm is implemented in a preprocessing code that creates a cell-by-cell database that will maintain flux conservation at any level of full or reduced grid density as the user may choose by way of the mesh-sequencing algorithm. These two algorithms have enhanced the numerical accuracy of the code, reduced the time and effort for grid preprocessing, and provided users with the flexibility of performing computations at any desired full or reduced grid resolution to suit their specific computational requirements.

Pao, S. P.↗

A Unique Computational Algorithm to Simulate Probabilistic Multi-Factor Interaction Model Complex Material Point Behavior

The Multi-Factor Interaction Model (MFIM) is used to evaluate the divot weight (foam weight ejected) from the launch external tanks. The multi-factor has sufficient degrees of freedom to evaluate a large number of factors that may contribute to the divot ejection. It also accommodates all interactions by its product form. Each factor has an exponent that satisfies only two points--the initial and final points. The exponent describes a monotonic path from the initial condition to the final. The exponent values are selected so that the described path makes sense in the absence of experimental data. In the present investigation, the data used was obtained by testing simulated specimens in launching conditions. Results show that the MFIM is an effective method of describing the divot weight ejected under the conditions investigated.

Chamis, Christos C.↗

Stimulation of a turbofan engine for evaluation of multivariable optimal control concepts

The development of control systems for jet engines requires a real-time computer simulation. The simulation provides an effective tool for evaluating control concepts and problem areas prior to actual engine testing. The development and use of a real-time simulation of the Pratt and Whitney F100-PW100 turbofan engine is described. The simulation was used in a multi-variable optimal controls research program using linear quadratic regulator theory. The simulation is used to generate linear engine models at selected operating points and evaluate the control algorithm. To reduce the complexity of the design, it is desirable to reduce the order of the linear model. A technique to reduce the order of the model; is discussed. Selected results between high and low order models are compared. The LQR control algorithms can be programmed on digital computer. This computer will control the engine simulation over the desired flight envelope.

Seldner, K.↗

Development and evaluation of packet video schemes

Reflecting the two tasks proposed for the current year, namely a feasibility study of simulating the NASA network, and a study of progressive transmission schemes, are presented. The view of the NASA network, gleaned from the various technical reports made available to use, is provided. Also included is a brief overview of how the current simulator could be modified to accomplish the goal of simulating the NASA network. As the material in this section would be the basis for the actual simulation, it is important to make sure that it is an accurate reflection of the requirements on the simulator. Brief descriptions of the set of progressive transmission algorithms selected for the study are contained. The results available in the literature were obtained under a variety of different assumptions, not all of which are stated. As such, the only way to compare the efficiency and the implementational complexity of the various algorithms is to simulate them.

Sayood, Khalid↗

A chimera grid scheme

A mesh system composed of multiple overset body-conforming grids is described for adapting finite-difference procedures to complex aircraft configurations. In this so-called 'chimera mesh,' a major grid is generated about a main component of the configuration and overset minor grids are used to resolve all other features. Methods for connecting overset multiple grids and modifications of flow-simulation algorithms are discussed. Computational tests in two dimensions indicate that the use of multiple overset grids can simplify the task of grid generation without an adverse effect on flow-field algorithms and computer code complexity.

Steger, J. L.↗

Studying Turbulence Using Numerical Simulation Databases: Proceedings of the Summer Program - No. 7

The Seventh Summer Program of the Center for Turbulence Research took place in the four-week period, July 5 to July 31, 1998. This was the largest CTR Summer Program to date, involving thirty-six participants from the U. S. and nine other countries. Thirty-one Stanford and NASA-Ames staff members facilitated and contributed to most of the Summer projects. A new feature, and perhaps a preview of the future programs, was that many of the projects were executed on non-NASA computers. These included supercomputers located in Europe as well as those operated by the Departments of Defense and Energy in the United States. In addition, several simulation programs developed by the visiting participants at their home institutions were used. Another new feature was the prevalence of lap-top personal computers which were used by several participants to carry out some of the work that in the past were performed on desk-top workstations. We expect these trends to continue as computing power is enhanced and as more researchers (many of whom CTR alumni) use numerical simulations to study turbulent flows. CTR's main role continues to be in providing a forum for the study of turbulence for engineering analysis and in facilitating intellectual exchange among the leading researchers in the field. Once again the combustion group was the largest. Turbulent combustion has enjoyed remarkable progress in using simulations to address increasingly complex and practically more relevant questions. The combustion group's studies included such challenging topics as fuel evaporation, soot chemistry, and thermonuclear reactions. The latter study was one of three projects related to the Department of Energy's ASCI Program (www.llnl.gov/asci); the other two (rocket propulsion and fire safety) were carried out in the turbulence modeling group. The flow control and acoustics group demonstrated a successful application of the so-called evolution algorithms which actually led to a previously unknown forcing strategy for jets yielding increased spreading rate. A very efficient algorithm for flow in complex geometries with moving boundaries based on the immersed boundary forcing technique was tested with very encouraging results. Also a new strategy for the destruction of aircraft trailing vortices was introduced and tested. The Reynolds Averaged Modeling (RANS) group demonstrated that the elliptic relaxation concept for RANS calculations is also applicable to transonic flows with shocks; however, prediction of laminar/turbulent transition remains an important pacing item. A large fraction of the LES effort was devoted to the development and testing of a new algorithmic procedure (as opposed to phenomenological model) for subgrid scale modeling based on regularized de-filtering of the flow variables. This appears to be a very promising approach, and a significant effort is currently underway to assess its robustness in high Reynolds number flows and in conjunction with numerical methods for complex flows. As part of the Summer Program two review tutorials were given on Turbulent structures in hydrocarbon pool fires (Sheldon Tieszen), and Turbulent combustion modeling: from RANS to LES via DNS (Luc Vervisch); and two seminars entitled Assessment of turbulence models for engineering applications (Paul Durbin) and Subgrid-scale modeling for non-premixed, turbulent reacting flows (James Riley) were presented. A number of colleagues from universities, government agencies, and industry attended the final presentations of the participants on July 31 and participated in the discussions. There are twenty-six papers in this volume grouped in five areas. Each group is preceded with an overview by its coordinator.

Source record↗

Rapid near-optimal trajectory generation and guidance law development for single-stage-to-orbit airbreathing vehicles

General problems associated with on-board trajectory optimization, propulsion system cycle selection, and with the synthesis of guidance laws were addressed for an ascent to low-earth-orbit of an air-breathing single-stage-to-orbit vehicle. The NASA Generic Hypersonic Aerodynamic Model Example and the Langley Accelerator aerodynamic sets were acquired and implemented. Work related to the development of purely analytic aerodynamic models was also performed at a low level. A generic model of a multi-mode propulsion system was developed that includes turbojet, ramjet, scramjet, and rocket engine cycles. Provisions were made in the dynamic model for a component of thrust normal to the flight path. Computational results, which characterize the nonlinear sensitivity of scramjet performance to changes in vehicle angle of attack, were obtained and incorporated into the engine model. Additional trajectory constraints were introduced: maximum dynamic pressure; maximum aerodynamic heating rate per unit area; angle of attack and lift limits; and limits on acceleration both along and normal to the flight path. The remainder of the effort focused on required modifications to a previously derived algorithm when the model complexity cited above was added. In particular, analytic switching conditions were derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another for two cases: the case in which engine cycle operations can overlap, and the case in which engine cycle operations are mutually exclusive. The resulting guidance algorithm was implemented in software and exercised extensively. It was found that the approximations associated with the assumed time scale separation employed in this work are reasonable except over the Mach range from roughly 5 to 8. This phenomenon is due to the very large thrust capability of scramjets in this Mach regime when sized to meet the requirement for ascent to orbit. By accounting for flight path angle and flight path angle rate in construction of the flight path over this Mach range, the resulting algorithm provides the means for rapid near-optimal trajectory generation and propulsion cycle selection over the entire Mach range from take-off to orbit.

Calise, A. J.↗

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n1/4) rounds of communication and O ̃(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees​

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n 1/4 ) rounds of communication and O ̃(n 9/4 ) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

Performance Analysis of a Hardware Implemented Complex Signal Kurtosis Radio-Frequency Interference Detector

In the field of microwave radiometry, Radio Frequency Interference (RFI) consistently degrades the value of scientific results. Through the use of digital receivers and signal processing, the effects of RFI on scientific measurements can be reduced depending on certain circumstances. As technology allows us to implement wider band digital receivers for radiometry, the problem of RFI mitigation changes. Our work focuses on finding a detector that outperforms real kurtosis in wide band scenarios. The algorithm implemented is a complex signal kurtosis detector which was modeled and simulated. The performance of both complex and real signal kurtosis is evaluated for continuous wave, pulsed continuous wave, and wide band quadrature phase shift keying (QPSK) modulations. The use of complex signal kurtosis increased the detectability of interference.

microwaves↗

Where are the parallel algorithms?

Four paradigms that can be useful in developing parallel algorithms are discussed. These include computational complexity analysis, changing the order of computation, asynchronous computation, and divide and conquer. Each is illustrated with an example from scientific computation, and it is shown that computational complexity must be used with great care or an inefficient algorithm may be selected.

Voigt, R. G.↗

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Sen, Syamal K.↗

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

Physics-Guided Deep Learning for Complex System Health Management and Decision Making

The landscape of complex engineered systems is rapidly evolving, from smart manufacturing facilities to next-generation transportation vehicles. As these systems become increasingly sophisticated and interconnected, the need for advanced health management systems grows ever more critical. These systems must go beyond simple monitoring, actively predicting potential failures before they occur. This paradigm shift from fixed maintenance schedules to condition-based predictions is key to optimizing system performance, enhancing safety, and paving the way for autonomous decision-making across various industries. Whether in industrial processes, energy systems, or advanced transportation, the ability to anticipate and prevent failures is becoming a cornerstone of operational excellence. To accurately predict the future health of any complex system, knowledge of its current health state and future operational conditions is essential. Recent advancements in data-driven algorithms have generated growing interest in artificial intelligence for industrial applications. However, the limitations of pure data-driven methods, particularly in industries where data acquisition is costly and limited, have become apparent. This has led to a focus on blending physics with data-driven algorithms, mitigating the drawbacks of both approaches while emphasizing their respective advantages. This research proposes a novel framework for integrating physics-based performance models with deep learning algorithms for the prognostics of complex safety-critical systems. In this approach, physics-based models serve as a blueprint, capturing fundamental system behaviors, while deep learning algorithms, leveraging real-world sensor data, fill in gaps and identify subtle patterns indicative of potential problems. This hybrid methodology, utilizing techniques such as Physics-Informed Neural Networks (PINNs), offers a powerful solution for predicting system health. By fusing domain knowledge with data-driven insights, this approach promises more accurate, adaptable, and reliable models for health prediction. The resulting framework is versatile, applicable across various sectors including aerospace, manufacturing, and energy systems, ultimately contributing to safer, more efficient operations in our increasingly complex technological landscape.

Diagnostics↗

Carbon monoxide mixing ratio inference from gas filter radiometer data

A new algorithm has been developed which permits, for the first time, real time data reduction of nadir measurements taken with a gas filter correlation radiometer to determine tropospheric carbon monoxide concentrations. The algorithm significantly reduces the complexity of the equations to be solved while providing accuracy comparable to line-by-line calculations. The method is based on a regression analysis technique using a truncated power series representation of the primary instrument output signals to infer directly a weighted average of trace gas concentration. The results produced by a microcomputer-based implementation of this technique are compared with those produced by the more rigorous line-by-line methods. This algorithm has been used in the reduction of Measurement of Air Pollution from Satellites, Shuttle, and aircraft data.

Wallio, H. A.↗