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 325 records · Page 18

The transonic aerofoil problem with embedded shocks.

The integral equation approach to the mixed flow problem of infinite wings at high subsonic speeds is adopted for non-circulatory and circulatory (lifting) flows. The solutions are determined from a system of non-linear algebraic equations and, to ensure always unique solutions, the method of differentiation with respect to a parameter has been applied. The resulting Cauchy problem is then solved with the linearised flow solution as the initial value vector. For the case of embedded shocks in the flow field, the method of steepest descent has been added to the calculation scheme. Results for subcritical and supercritical flows past aerofoils are given and compared with solutions obtained by finite-difference techniques.

Norstrud, H.↗

A three-dimensional algebraic grid generation scheme for gas turbine combustors with inclined slots

A 3D algebraic grid generation scheme is presented for generating the grid points inside gas turbine combustors with inclined slots. The scheme is based on the 2D transfinite interpolation method. Since the scheme is a 2D approach, it is very efficient and can easily be extended to gas turbine combustors with either dilution hole or slot configurations. To demonstrate the feasibility and the usefulness of the technique, a numerical study of the quick-quench/lean-combustion (QQ/LC) zones of a staged turbine combustor is given. Preliminary results illustrate some of the major features of the flow and temperature fields in the QQ/LC zones. Formation of co- and counter-rotating bulk flow and shape temperature fields can be observed clearly, and the resulting patterns are consistent with experimental observations typical of the confined slanted jet-in-cross flow. Numerical solutions show the method to be an efficient and reliable tool for generating computational grids for analyzing gas turbine combustors with slanted slots.

Yang, S. L.↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Multiple-Effector Control Allocation: Theory and Practice

Redundant controls are ubiquitous in many aerospace domains, including aircraft, spacecraft, and launch vehicles. Multiple control effectors having different capabilities (e.g., reaction controls, aerosurfaces, and vectored engines) must be optimally allocated to achieve high-performance and robust vehicle control, while considering different constraints, cost, or performance metrics associated with various control mixing schemes. These can include force or deflection limits, rate limits, propellant usage or drag penalties, cross-axis coupling, uncertainties, or even servoelastic interactions. This presentation introduces the fundamentals of control allocation theory, based on linear algebra and convex sets, using a handful of examples taken from the air and space vehicle domains. It is shown that even simple methods can provide verifiable and quantifiable performance benefits over ad-hoc approaches, and can support enhanced functions like fault tolerance and control reconfiguration.

Bill Benson↗

QLiG: Query Like a Graph For Subgraph Matching

A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.

Purohit, Sumit↗

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗

Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick

An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.

42 ENGINEERING↗

Generalized Flip-Flop Input Equations Based on a Four-Valued Boolean Algebra

A procedure is developed for obtaining generalized flip-flop input equations, and a concise method is presented for representing these equations. The procedure is based on solving a four-valued characteristic equation of the flip-flop, and can encompass flip-flops that are too complex to approach intuitively. The technique is presented using Karnaugh maps, but could easily be implemented in software.

Tucker, Jerry H.↗

Prediction of stall and post-stall behavior of airfoils at low and high Reynolds numbers

An interactive boundary-layer method, together with the e(super n)-approach to the calculation of transition, has been used to predict the stall and post-stall behavior of airfoils at low and high Reynolds numbers. The turbulence model is based on the Cebeci-Smith algebraic eddy-viscosity formulation with improvements for strong pressure gradient effects and transitional flows at low Reynolds numbers. Comparison of calculated results for incompressible flows indicate good agreement with experiment for a wide range of Reynolds numbers. Preliminary calculations for low Mach number flows with this interactive method with compressibility corrections to the panel method indicate that, at a Mach number of 0.3, the compressibility effect on (C sub Q)max is not negligible.

Cebeci, T.↗

Compressibility and Turbulence Effects Due to Airfoil Clocking in Axial Compressors

Axial compressors have inherently unsteady flow fields because of relative motion between rotor and stator airfoils. This relative motion leads to viscous and inviscid (potential) interactions between blade rows. As the number of stages increases in a turbomachine, the buildup of convected wakes can lead to progressively more complex wake/wake and wake/airfoil interactions. Variations in the relative circumferential positions of stators or rotors can change these interactions, leading to different unsteady forcing functions on airfoils and different compressor efficiencies. In addition, as the Mach number increases the interaction between blade rows is intensified due to potential effects. The current study uses an unsteady, two-dimensional Navier-Stokes approach to investigate the unsteady aerodynamics of stator clocking in a 1-1/2 stage compressor, typical of high-pressure compressors used in advanced commercial jet engines. The effects of turbulence are modeled with both algebraic and two-equation models. Results include surface pressures, efficiencies, boundary layer quantities and turbulence quantities. In addition, the growth of turbulence and the effects of compressibility on airfoil are discussed.

Dorney, Daniel J.↗

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗

Moment-Fourier approach to ion parallel fluid closures and transport for a toroidally confined plasma

A general method of solving the drift kinetic equation is developed for an axisymmetric magnetic field. Expanding a distribution function in general moments, a set of ordinary differential equations is obtained. Successively expanding the moments and magnetic-field involved quantities in Fourier series, a set of linear algebraic equations is obtained. The set of full (Maxwellian and non-Maxwellian) moment equations is solved to express the first-order density, temperature, and flow velocity in terms of radial gradients of the zeroth-order pressure and temperature. Closure relations that connect parallel heat flux density and viscosity to the radial gradients and parallel gradients of temperature and flow velocity are also obtained by solving the non-Maxwellian moment equations. The closure relations combined with the linearized fluid equations reproduce the same solution obtained directly from the full moment equations. Furthermore, the method can be generalized to derive closures and transport for an electron-ion plasma and a multi-ion plasma in a general magnetic field.

neoclassical transport↗

Spatial operator approach to under-actuated manipulator kinematics and dynamics

A study is made of the kinematics and dynamics of under-actuated manipulators. The presence of passive hinges causes the kinematics and dynamics of these manipulators to be considerably more complex when compared with fully actuated manipulators. Techniques from the spatial operator algebra are used to develop expressions for the generalized Jacobian, the mass matrix, and an efficient inverse dynamics computational algorithm.

Jain, A.↗

SCF Framework, HF Stability, and RPA Correlation for Jordan–Wigner-Transformed Spin Hamiltonians on Arbitrary Coupling Topologies

Mapping spins to fermions via the Jordan–Wigner (JW) transformation can render mean-field (Hartree–Fock, HF) descriptions effective for strongly correlated spin systems. As established in recent work, the application of such approaches is not limited by the nonlocal structure of JW strings or by site ordering because string operators can be absorbed into Thouless rotations of a Slater determinant, and the variational optimization of a unitary Lie-algebraic similarity transformation removes any ordering dependence. Leveraging these ideas, we develop a self-consistent field (SCF) scheme that expresses the mean-field energy as a functional of the single-particle density matrix, providing an alternative to gradient-based optimization of Thouless parameters. We derive the analytical orbital Hessian to diagnose HF stability and compute the ground-state correlation energy through the random-phase approximation (RPA). Benchmark results for the XXZ and J 1 –J 2 model on one- and two-dimensional lattices demonstrate that RPA significantly improves mean-field accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Threshold logic - a synthesis approach.

Book on threshold logic for logical design of digital systems including threshold element synthesis by iteration, tabulation and network synthesis

NETWORK SYNTHESIS↗

Reducing communication in algebraic multigrid with multi-step node aware communication

Algebraic multigrid (AMG) is often viewed as a scalable [Formula: see text] solver for sparse linear systems. Yet, AMG lacks parallel scalability due to increasingly large costs associated with communication, both in the initial construction of a multigrid hierarchy and in the iterative solve phase. This work introduces a parallel implementation of AMG that reduces the cost of communication, yielding improved parallel scalability. It is common in Message Passing Interface (MPI), particularly in the MPI-everywhere approach, to arrange inter-process communication, so that communication is transported regardless of the location of the send and receive processes. Performance tests show notable differences in the cost of intra- and internode communication, motivating a restructuring of communication. In this case, the communication schedule takes advantage of the less costly intra-node communication, reducing both the number and the size of internode messages. Node-centric communication extends to the range of components in both the setup and solve phase of AMG, yielding an increase in the weak and strong scaling of the entire method.

Computer Science↗

Toward an effective CFT 2 from $ \mathcal{N} $ = 4 super Yang-Mills and aspects of Hawking radiation

Using $ \mathcal{N} $ = 4 supersymmetric Yang-Mills theory we recover important aspects of the near-extremal thermodynamics of AdS 5 black holes including both the outer and the inner horizons with their corresponding entropy and energy. This $ \mathcal{N} $ = 4 supersymmetric Yang-Mills theory approach to black hole thermodynamics leads to an effective CFT 2 interpretation similar to the work by Callan and Maldacena. We corroborate this effective CFT 2 by implementing a particular near-horizon limit that geometrizes the Virasoro algebras as asymptotic symmetries. Using the effective CFT 2 picture, we discuss aspects of the Hawking radiation rate for a region of the near-extremal AdS 5 black hole quantum evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗