Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic approach”

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

Bounded motion design in the Earth zonal problem using differential algebra based normal form methods

Establishing long-term relative bounded motion between orbits in perturbed dynamics is a key challenge in astrodynamics to enable cluster flight with minimum propellant expenditure. Herein, we present an approach that allows for the design of long-term relative bounded motion considering a zonal gravitational model. Entire sets of orbits are obtained via high-order Taylor expansions of Poincarè return maps about reference fixed points. The high-order normal form algorithm is used to determine a change in expansion variables of the map into normal form space, in which the phase space behavior is circular and can be easily parameterized by action–angle coordinates. The action–angle representation of the normal form coordinates is then used to parameterize the original Poincarè return map and average it over a full phase space revolution by a path integral along the angle parameterization. As a result, the averaged nodal period and drift in the ascending node are obtained, for which the bounded motion conditions are straightforwardly imposed. Sets of highly accurate bounded orbits are obtained, extending over several thousand kilometers, and valid for decades.

79 ASTRONOMY AND ASTROPHYSICS↗

Navier-Stokes computations for circulation controlled airfoils

Navier-Stokes computations of subsonic to transonic flow past airfoils with augmented lift due to rearward jet blowing over a curved trailing edge are presented. The approach uses a spiral grid topology. Solutions are obtained using a Navier-Stokes code which employs an implicit finite difference method, an algebraic turbulence model, and developments which improve stability, convergence, and accuracy. Results are compared against experiments for no jet blowing and moderate jet pressures and demonstrate the capability to compute these complicated flows.

Pulliam, T. H.↗

Navier-Stokes computations for circulation control airfoils

Navier-Stokes computations of subsonic to transonic flow past airfoils with augmented lift due to rearward jet blowing over a curved trailing edge are presented. The approach uses a spiral grid topology. Solutions are obtained using a Navier-Stokes code which employs an implicit finite difference method, an algebraic turbulence model, and developments which improve stability, convergence, and accuracy. Results are compared against experiments for no jet blowing and moderate jet pressures and demonstrate the capability to compute these complicated flows.

Pulliam, Thomas H.↗

TIGGERC: Turbomachinery interactive grid generator energy distributor and restart code

A two dimensional multi-block grid generator was developed for a new design and analysis system for studying multi-blade row turbomachinery problems with an axisymmetric viscous/inviscid 'average passage' through flow code. TIGGERC is a mouse driven, fully interactive grid generation program which can be used to modify boundary coordinates and grid packing. TIGGERC generates grids using a hyperbolic tangent or algebraic distribution of grid points on the block boundaries and the interior points of each block grid are distributed using a transfinite interpolation approach. TIGGERC generates a blocked axisymmetric H grid, C grid, I grid, or O grid for studying turbomachinery flow problems. TIGGERC was developed for operation on small high speed graphic workstations.

Miller, David P.↗

Advances in Modeling Solar System Internet Structures and their Data Flows

With an ever-increasing presence in space, there is also an increasing burden on existing communications infrastructure. We are heading towards an inflection point where the traditional approach of scheduled, single-path communications for space will no longer be viable. One answer is Delay Tolerant Networking (DTN), which takes the once disparate system of point-to-point links and unifies them in a networked architecture, thereby making communications more scalable. However, much work remains for discovering and harnessing the underlying theory of DTN. For example, in the terrestrial setting the interplay between routing domains is well-understood, however this is not the case in DTNs. In this paper, we build up the fundamental foundations of DTN, with an emphasis on modeling time varying networks and data flows across them, with examples of cross-domain routing in a DTN. A lofty goal of DTN is to enable the so-called Solar System Internet (SSI), which implies a standardized and robust suite of protocols. These protocols include routing across disconnected networks using store, carry, and forward mechanisms, which is necessary due to the disconnections, delays, and mobility intrinsic to space networks. Due to these factors, each of which generalize traditional networking, there is a deep and rich theory of DTNs. Here we build off of past successes to broaden this theory while striving to keep actionable results a goal for future implementations and operations. The approach includes modeling the unicast, broadcast, and multicast communications using the language of hypergraphs, which capture the geometric properties of such networked communications algebraically. Also inherent to these networks is their time-varying nature, particularly given mobility, and hence we also cultivate modeling techniques that respect this time dependence. This leads us to develop models using tools from category theory and algebraic geometry, which provide a language well-suited to describing synchronization and optimization over such networks. We also introduce and study a novel generalization of curvature applicable to time-evolving networks, which provides quantitative controls on diffusion processes on the network. Because an interplanetary network would feature links with propagation delays the preclude discovery (feedback) mechanisms, they will always feature a scheduled component. However, it is beneficial to support discovery where possible. While DTNs do not yet have strong definitions for their analogues of autonomous systems or network areas, we show how to join dynamic and schedule-based routing domains, using the language of sheaves, which marks progress towards such definitions. We conclude with a discussion of the progress made, as well as suggestions for future work.

Delay Tolerant Networking↗

Time-explicit Darwin PIC algorithm

A new approach to Darwin particle-in-cell plasma simulation is described. Using a finite-element approach, the vector potential is assured to be exactly solenoidal. This allows writing the system of multi-species particles as an action-at-a-distance Hamiltonian system. Applying recently-developed explicit symplectic methods to this gives a time-explicit algorithm with all desired properties. Elliptic systems for the electrostatic and magneto-static portions of the problem are inverted efficiently by an algebraic multi-grid algorithm. The algorithm is implemented in a two-dimensional Cartesian-geometry code and tested by application to Weibel instability and to Alfvén wave dynamics. Results show the effectiveness of this approach. Extensions to arbitrary meshes and to a partially time-implicit scheme are briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Game-Theoretic Quantum Algorithm for Solving Magic Squares

Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game’s parity and consistency constraints, then optimize parameterize quantum circuits to minimize this cost. Our approach build on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure an interpretability. We validate our method through numerical experiments and outline generalizations to larger games.

Chehade, Sarah [ORNL]↗

Two-stage chain sampling inspection plans with different sample sizes in the two stages

A further generalization of the family of 'two-stage' chain sampling inspection plans is developed - viz, the use of different sample sizes in the two stages. Evaluation of the operating characteristics is accomplished by the Markov chain approach of the earlier work, modified to account for the different sample sizes. Markov chains for a number of plans are illustrated and several algebraic solutions are developed. Since these plans involve a variable amount of sampling, an evaluation of the average sampling number (ASN) is developed. A number of OC curves and ASN curves are presented. Some comparisons with plans having only one sample size are presented and indicate that improved discrimination is achieved by the two-sample-size plans.

Stephens, K. S.↗

Computational and experimental study of turbulent flows in 180 degree bends

A theoretical and experimental investigation of turbulent flows inside a 180-deg strongly curved channel is included in the present study. A 10 by 100 centimeter water channel with a 10 centimeter radius turn was employed for the experimental study. Data measured are velocity profiles and distributions of longitudinal turbulence intensity. Numerical investigations are performed by solving the incompressible Navier-Stokes equations and turbulence models using a finite difference flow solver in generalized curvilinear coordinate systems. A widely used two-equation turbulence model and its modified version, which includes the effect of strong curvature on the turbulence length scale through a relation of algebraic Reynolds stress model, are employed to predict the turbulence quantities inside the flow field. Improvements on the predictions are obtained using the present approach.

Chen, Y. S.↗

Aspects of efficient and reliable multibody system simulation

Multibody system equations can be generated in various forms. All of these may be interpreted as results of two basic approaches, the augmentation- and the elimination-method. The former method yields the descriptor form of the system motion, a set of differential-algebraic equations (DAE), and the latter the state space representation, a minimal set of ordinary differential equations (ODE). Both of these methods are surveyed. Particular emphasis is on the discussion of recursive computational schemes, generating the equations of motion with a number of operations, which is proportional to the number N of system bodies (O(N)-formulations). For simulation purposes one would like to create that set of system equations, which can be generated most efficiently and for which the most efficient and reliable solution techniques are available. Numerical solution techniques for ODE have been studied in great detail and they are well-developed. By contrast, DAE have not been investigated for such a long time. In view of new developments in the latter field the generation of all the equations required for an efficient and reliable solution of DAE describing multibody system motion is discussed. These methods, i.e., an O(N)-formulation and new techniques for solving DAE, are implemented in the SIMPACK code. Its capabilities are illustrated by simulation of multibody robot models.

Schwertassek, R.↗

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Mercadal, Mathieu↗

A Computing Method for Sound Propagation Through a Nonuniform Jet Stream

Understanding the principles of jet noise propagation is an essential ingredient of systematic noise reduction research. High speed computer methods offer a unique potential for dealing with complex real life physical systems whereas analytical solutions are restricted to sophisticated idealized models. The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions and a more suitable approach was needed. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Padula, S. L.↗

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Transonic flow past lifting wings.

Work conducted by Norstrud (1971) has been extended to lifting flows with the inclusion of embedded continuous supercritical regions. The approach taken follows some fundamental steps proposed for two-dimensional flows by Oswatitsch (1950). The governing integral equation is replaced by a system of nonlinear algebraic equations. The method of parametric differentiation is applied to the solution of this system of equations. The analytical analysis is discussed together with a numerical analysis in the case of a wing configuration with arbitrary thickness distribution.

Norstrud, H.↗

BFS Method for Alloys Optimized and Verified for the Study of Ordered Intermetallic Material

The aerospace industry has a need for new metallic alloys that are lightweight and have high strength at elevated temperatures. The BFS (Bozzolo, Ferrante, and Smith) method is a new, computationally efficient and physically sound quantum semi-perturbative approach for describing metals and their defects. Based on a simple interpretation of the alloy formation process that identifies strain and chemical contributions to the energy of the alloy, the method provides an atom-by-atom description of an alloy. Its implementation requires little more than algebra and the solution of transcendental equations. At the NASA Lewis Research Center, we have demonstrated that BFS can investigate the properties of a large number of alloys with a minimum computational effort on low-level computers. This screening allows the selection of the best alloy candidates for a particular application and, therefore, promises large cost savings over current approaches.

Source record↗

A rational approach to the use of Prandtl's mixing length model in free turbulent shear flow calculations

Prandtl's basic mixing length model was used to compute 22 test cases on free turbulent shear flows. The calculations employed appropriate algebraic length scale equations and single values of mixing length constant for planar and axisymmetric flows, respectively. Good agreement with data was obtained except for flows, such as supersonic free shear layers, where large sustained sensitivity changes occur. The inability to predict the more gradual mixing in these flows is tentatively ascribed to the presence of a significant turbulence-induced transverse static pressure gradient which is neglected in conventional solution procedures. Some type of an equation for length scale development was found to be necessary for successful computation of highly nonsimilar flow regions such as jet or wake development from thick wall flows.

Rudy, D. H.↗

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗

Solution of steady-state one-dimensional conservation laws by mathematical programming

Solution techniques for a class of steady-state scalar conservation laws are developed analytically. Discretization by finite-volume formulas is employed to obtain an overdetermined system of algebraic equations, which are then perturbed nonsingularly (with perturbation coefficient = epsilon) and solved using the l(1) mathematical-programming algorithm of Seneta and Steiger (1984); this approach limits the matrix bandwidth to two, so that an explicit solution can be found efficiently. It is shown that, for small values of epsilon, the l(1) solutions exhibit sharp correctly located shocks and are nonoscillatory O(epsilon) approximations of the physically relevant solutions.

Lavery, J. E.↗