Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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 343 records · Page 19

Algorithm and code development for unsteady three-dimensional Navier-Stokes equations

A streamwise upwind algorithm for solving the unsteady 3-D Navier-Stokes equations was extended to handle the moving grid system. It is noted that the finite volume concept is essential to extend the algorithm. The resulting algorithm is conservative for any motion of the coordinate system. Two extensions to an implicit method were considered and the implicit extension that makes the algorithm computationally efficient is implemented into Ames's aeroelasticity code, ENSAERO. The new flow solver has been validated through the solution of test problems. Test cases include three-dimensional problems with fixed and moving grids. The first test case shown is an unsteady viscous flow over an F-5 wing, while the second test considers the motion of the leading edge vortex as well as the motion of the shock wave for a clipped delta wing. The resulting algorithm has been implemented into ENSAERO. The upwind version leads to higher accuracy in both steady and unsteady computations than the previously used central-difference method does, while the increase in the computational time is small.

Obayashi, Shigeru↗

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗

Generative Representations for Automated Design of Robots

A method of automated design of complex, modular robots involves an evolutionary process in which generative representations of designs are used. The term generative representations as used here signifies, loosely, representations that consist of or include algorithms, computer programs, and the like, wherein encoded designs can reuse elements of their encoding and thereby evolve toward greater complexity. Automated design of robots through synthetic evolutionary processes has already been demonstrated, but it is not clear whether genetically inspired search algorithms can yield designs that are sufficiently complex for practical engineering. The ultimate success of such algorithms as tools for automation of design depends on the scaling properties of representations of designs. A nongenerative representation (one in which each element of the encoded design is used at most once in translating to the design) scales linearly with the number of elements. Search algorithms that use nongenerative representations quickly become intractable (search times vary approximately exponentially with numbers of design elements), and thus are not amenable to scaling to complex designs. Generative representations are compact representations and were devised as means to circumvent the above-mentioned fundamental restriction on scalability. In the present method, a robot is defined by a compact programmatic form (its generative representation) and the evolutionary variation takes place on this form. The evolutionary process is an iterative one, wherein each cycle consists of the following steps: 1. Generative representations are generated in an evolutionary subprocess. 2. Each generative representation is a program that, when compiled, produces an assembly procedure. 3. In a computational simulation, a constructor executes an assembly procedure to generate a robot. 4. A physical-simulation program tests the performance of a simulated constructed robot, evaluating the performance according to a fitness criterion to yield a figure of merit that is fed back into the evolutionary subprocess of the next iteration. In comparison with prior approaches to automated evolutionary design of robots, the use of generative representations offers two advantages: First, a generative representation enables the reuse of components in regular and hierarchical ways and thereby serves a systematic means of creating more complex modules out of simpler ones. Second, the evolved generative representation may capture intrinsic properties of the design problem, so that variations in the representations move through the design space more effectively than do equivalent variations in a nongenerative representation. This method has been demonstrated by using it to design some robots that move, variously, by walking, rolling, or sliding. Some of the robots were built (see figure). Although these robots are very simple, in comparison with robots designed by humans, their structures are more regular, modular, hierarchical, and complex than are those of evolved designs of comparable functionality synthesized by use of nongenerative representations.

Homby, Gregory S.↗

Singular perturbation techniques for on-line optimal flight path control

This paper presents a partial evaluation on the use of singular perturbation methods for developing computer algorithms for on-line optimal control of aircraft. The evaluation is based on a study of the minimum time intercept problem using F-4 aerodynamic and propulsion data as a base line. The extensions over previous work on this subject are that aircraft turning dynamics (in addition to position and energy dynamics) are included in the analysis, the algorithm is developed for a moving end point and is adaptive to unpredictable target maneuvers, and short range maneuvers that do not have a cruise leg are included. Particular attention is given to identifying those quantities that can be precomputed and stored (as a function of aircraft total energy), thus greatly reducing the onboard computational load. Numerical results are given that illustrate the nature of the optimal intercept flight paths, and an estimate is given for the execution time and storage requirements of the control algorithm.

Calise, A. J.↗

ATTRACTOR: Autonomy Teaming and TRAjectories for Complex Trusted Operational Reliability

Autonomous systems (AS) are crucial to realizing the vision of new, complex transportation modes, such as advanced air mobility (AAM) and urban air mobility (UAM). A chief barrier to induction of AS into aviation is insufficient understanding of AS reliability in time-critical and safety-critical environments—an obstacle to certification. ATTRACTOR is aimed at building a basis for certification of classes of autonomous cyber-physical-human systems (CPHS) via establishing metrics and models of trustworthiness and trust in multi-agent team interactions, analyzable trajectories, explainability of computational algorithms (explainable artificial intelligence, or XAI), and persistent modeling and simulation, in the context of missions planning and operation. By “building a basis for certification,” we mean acquiring an understanding of when a system is trustworthy and developing computable means to estimate trustworthiness and trust in order to eventually inform functional requirements that contribute to certification. The outcomes are applicable not just to aviation but to all domains that rely on autonomous systems.

Autonomy↗

Optimum design of ninety degree bends

An algorithm for the optimum design of an internal flow component to obtain the maximum pressure rise is presented. Maximum pressure rise in a duct with simultaneous turning and diffusion is shown to be related to the control of flow separation on the passage walls. Such a flow is usually associated with downstream conditions that are desirable in turbomachinery and propulsion applications to ensure low loss and stable performance. The algorithm requires the solution of an 'adjoint' problem in addition to the 'direct' equations governing the flow in a body, which in the present analysis are assumed to be the laminar Navier-Stokes equations. The theoretical framework and computational algorithms presented in this study are for the steady Navier-Stokes equations. A procedure is developed for the numerical solution of the adjoint equations. This procedure is coupled with a direct solver in a design iteration loop, that provides a new shape with a higher pressure rise. This procedure is first validated for the design of optimum plane diffusers in two-dimensional flow. The direct Navier-Stokes and the 'adjoint' equations are solved using a finite volume formulation for spatial discretization in an artificial compressibility framework. A simplified version of the above approach is then utilized to design ninety degree diffusing bends. Calculations were carried out for a mean radius ratio at inlet of 2.5 and Reynolds numbers varying from 100 to 500. While at this stage laminar flows is assumed, it is shown that a similar approach can be conceived for turbulent flows.

Modi, Vijay↗

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗

Artificial Intelligence

Artificial intelligence is the study of intelligence agents as demonstrated by machines. It is an interdisciplinary field involving computer science as well as, various kinds of engineering and science, for example, robotics, bio-medical engineering, that accentuates automation of human acts and intelligence through machines. AI represents state-of-the-art use of machines to bring about algorithmic computation and understanding of tasks that include learning, problem solving, mapping, perception, and reasoning. Given the data and a description of its properties and relations between objects of interest, AI methods can perform the aforementioned tasks. Widely applied AI capabilities, e.g. learning, are now achievable at large scale through machine learning (ML), large volumes of data and specialized computational machines. ML encompasses learning without any kind of supervision (unsupervised learning) and learning with full supervision (supervised learning). Widely applied supervised learning techniques include deep learning and other machine learning methods that require less data than deep learning e.g. support vector machines, random forests. Unsupervised learning examples include dictionary learning, independent component analysis, and autoencoders. For application tasks with less labeled data, both supervised and unsupervised techniques can be adapted in a semi-supervised manner to produce accurate models and to increase the size of the labeled training data.

97 MATHEMATICS AND COMPUTING↗

Finite element representations for thin shell instability analysis

The development of finite element calculational procedures for thin-shell instability analysis has involved the definition of appropriate element representations (i.e. the geometric form of the element and the approximation of displacement and/or stress), constitutive expressions, and computational algorithms. Among these, the status of thin-shell finite element representations remains unsettled. This paper, therefore, emphasizes recent developments in the basic aspects of thin-shell finite element analysis and discusses one simplified approach in more detail. Formulative and computational procedures for elastic instability analysis are then summarized, and numerical results are shown for the simplified shell element formulation.

Gallagher, R. H.↗

A new technique to determine the correlation between the QT interval and heart-rate for control and SIDS babies

The ability of the autonomic nervous system to alter the QT interval in response to heart rate changes is essential to cardiovascular control. An accurate way to determine the relation between QT intervals and their corresponding RR intervals is described. A computer algorithm measures the RR intervals using digital filtering and cross-correlating the QRS sections of consecutive waveforms. The QT intervals is calculated by choosing a section of, the ECG that includes the T wave and cross-correlating it with all the consecutive T waves. At least 4000 pairs of QT-RR intervals are computed for each subject and a best fit correlation function determines the relations between the QT and RR intervals. This technique enables to establish a precise correlation between RR and QT in order to distinguish between control and SIDS babies.

Non-NASA Center↗

Biological production models as elements of coupled, atmosphere-ocean models for climate research

Process models of phytoplankton production are discussed with respect to their suitability for incorporation into global-scale numerical ocean circulation models. Exact solutions are given for integrals over the mixed layer and the day of analytic, wavelength-independent models of primary production. Within this class of model, the bias incurred by using a triangular approximation (rather than a sinusoidal one) to the variation of surface irradiance through the day is computed. Efficient computation algorithms are given for the nonspectral models. More exact calculations require a spectrally sensitive treatment. Such models exist but must be integrated numerically over depth and time. For these integrations, resolution in wavelength, depth, and time are considered and recommendations made for efficient computation. The extrapolation of the one-(spatial)-dimension treatment to large horizontal scale is discussed.

Platt, Trevor↗

An Algorithm to Generate Deep-Layer Temperatures from Microwave Satellite Observations for the Purpose of Monitoring Climate Change

An algorithm for generating deep-layer mean temperatures from satellite-observed microwave observations is presented. Unlike traditional temperature retrieval methods, this algorithm does not require a first guess temperature of the ambient atmosphere. By eliminating the first guess a potentially systematic source of error has been removed. The algorithm is expected to yield long-term records that are suitable for detecting small changes in climate. The atmospheric contribution to the deep-layer mean temperature is given by the averaging kernel. The algorithm computes the coefficients that will best approximate a desired averaging kernel from a linear combination of the satellite radiometer's weighting functions. The coefficients are then applied to the measurements to yield the deep-layer mean temperature. Three constraints were used in deriving the algorithm: (1) the sum of the coefficients must be one, (2) the noise of the product is minimized, and (3) the shape of the approximated averaging kernel is well-behaved. Note that a trade-off between constraints 2 and 3 is unavoidable. The algorithm can also be used to combine measurements from a future sensor (i.e., the 20-channel Advanced Microwave Sounding Unit (AMSU)) to yield the same averaging kernel as that based on an earlier sensor (i.e., the 4-channel Microwave Sounding Unit (MSU)). This will allow a time series of deep-layer mean temperatures based on MSU measurements to be continued with AMSU measurements. The AMSU is expected to replace the MSU in 1996.

Goldberg, Mitchell D.↗

Low-thrust guidance study Final report

Computer algorithm to determine minimum-time optimal control for continuous low-thrust propulsion systems operating in inverse-square gravity field

GRAVITATIONAL FIELD↗

Global electric field determination in the Earth's outer magnetosphere using charged particles

Although many properties of the Earth's magnetosphere have been measured and quantified in the past 30 years since it was discovered, one fundamental (for a zeroeth order magnetohydrodynamic (MHD) equilibrium) measurement was made infrequently and with poor spatial coverage: the global electric field. This oversight is in part due to the difficulty of measuring a plasma electric field, and in part due to the difficulty of measuring a plasma electric field, and in part due to the neglect of theorists. However, there is renewed interest in the convection electric field, since it has been realized that it is vital for understanding many aspects of the magnetosphere: the global MHD equilibrium, reconnection rates, Region 2 Birkeland currents, magnetosphere-ionosphere coupling, ring current and radiation belt transport, substorm injections, acceleration mechanisms, etc. Unfortunately the standard experimental methods have not been able to synthesize a global field (excepting the pioneering work of McIlwain's geostationary models), and we are left with an overly simplistic theoretical field, the Volland-Stern electric field mode. Again, single point measurements of the plasma pause were used to infer the appropriate amplitudes of the model, parameterized by Kp (Maynard & Chen, JGR 1975). Although this result was never intended to be the definitive electric field model, it has gone nearly unchanged for 15 years. However, the data sets being taken today require a great deal more accuracy than can be provided by the Volland-Stern model. Nor has the variability of the electric field shielding been properly addressed, although effects of penetrating magnetospheric electric fields has been seen in mid- and low-latitude ionospheric data sets. The growing interests in substorm dynamics also requires a much better assessment of the electric fields responsible for particle injections. Thus, we proposed and developed algorithms for extracting electric fields from particle data taken in the earth's magnetosphere. As a test of the effectiveness of these techniques, we analyzed data taken by the AMPTE/CCE spacecraft in equatorial orbit between 1984-1988. Some analytic tools had to be developed before construction of computer algorithms, and they are discussed.

Eastman, T.↗

Quantum computing hardware for HEP algorithms and sensing

Quantum information science harnesses the principles of quantum mechanics to realize computational algorithms with complexities vastly intractable by current computer platforms. Typical applications range from quantum chemistry to optimization problems and also include simulations for high energy physics. The recent maturing of quantum hardware has triggered preliminary explorations by several institutions (including Fermilab) of quantum hardware capable of demonstrating quantum advantage in multiple domains, from quantum computing to communications, to sensing. The Superconducting Quantum Materials and Systems (SQMS) Center, led by Fermilab, is dedicated to providing breakthroughs in quantum computing and sensing, mediating quantum engineering and HEP based material science. The main goal of the Center is to deploy quantum systems with superior performance tailored to the algorithms used in high energy physics. In this Snowmass paper, we discuss the two most promising superconducting quantum architectures for HEP algorithms, i.e. three-level systems (qutrits) supported by transmon devices coupled to planar devices and multi-level systems (qudits with arbitrary N energy levels) supported by superconducting 3D cavities. For each architecture, we demonstrate exemplary HEP algorithms and identify the current challenges, ongoing work and future opportunities. Furthermore, we discuss the prospects and complexities of interconnecting the different architectures and individual computational nodes. Finally, we review several different strategies of error protection and correction and discuss their potential to improve the performance of the two architectures. This whitepaper seeks to reach out to the HEP community and drive progress in both HEP research and QIS hardware.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Evolutionary Computation System Design Concept for Developing Controlled Closed Ecosystems: An Intelligent Systems Approach to Foster Gravitational Ecosystem Research for Developing Sustainable Communities in Space and on Earth

An adjustably-autonomous intelligent systems approach for developing Closed Ecosystems (CESs) is presented, which includes a design concept and preliminary design details for the Controlled Closed-Ecosystem Development System (CCEDS) and the Orbiting Modular Artificial-Gravity Spacecraft (OMAGS). The paper is divided into three sections: CESs, the CCEDS Design Concept, and Orbiting Fractional-Gravity Closed Ecosystems OMAGS design concept. The first section briefly describes Closed EcoSystems (CESs), complex adaptive systems, biomes, microbial microbiomes, and their relevance for the study of astrobiology. This section also discusses initial efforts in the development of Closed Environment Life Support Systems (CELSSs) for sustainable communities in space and on Earth. This section concludes with a discussion of the bioregenerative life support system challenge of and the corresponding consequences due to the inverse relationship of the very small human biomass/non-human biomass ratio overall on the Earth with respect to the extremely large human biomass/non-human-biomass ratio found in cities and the International Space Station. The second section describes the CCEDS design concept, which consists of a population of controlled colonies of CES Modules (CESMs), each an integrated CES, continually generating data for an intelligent system that operates the CESs and their CESMs. A variety of CESM types and their use are briefly described. The CCEDS intelligent system uses an evolutionary computation algorithm described in this section to develop and optimize these CESs to increase their viability duration and the size of the animals they support with the ultimate goal to support populations of humans, both on Earth and in space. The CCEDS architecture, its five control subsystems, and its five evolutionary computation levels are also discussed. The section concludes with a discussion of several CCEDS design strategies. The third section summarizes the OMAGS design concept for a spacecraft with a payload consisting of CESs in an orbiting spacecraft centrifuge that operates for at least 5 years. The spacecraft concept is described including its 150cm-radius centrifuge with a 2 ton & 3,000 liter bioscience payload capacity for 24 CESMs. The centrifuge design has four physical levels for its CESMs, each level subject to a different fractional gravity level. This section presents the spacecraft benefits of being designed and operated such that the spacecraft and payload centrifuge wheel counter-rotate resulting in net zero angular momentum and zero gyroscopic forces. Artificial-gravity generation by centripetal acceleration is also discussed. This section concludes by showing the external specifications of the CESMs and their layout in the centrifuge, followed by discussing the multi-payload module rationale. In tandem, the CCEDS and OMAGS systems can be used to foster gravitational ecosystem research for developing sustainable communities in space and on Earth.

Dorais, Gregory A.↗

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗