Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic structures”

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

Structural synthesis: Precursor and catalyst

More than twenty five years have elapsed since it was recognized that a rather general class of structural design optimization tasks could be properly posed as an inequality constrained minimization problem. It is suggested that, independent of primary discipline area, it will be useful to think about: (1) posing design problems in terms of an objective function and inequality constraints; (2) generating design oriented approximate analysis methods (giving special attention to behavior sensitivity analysis); (3) distinguishing between decisions that lead to an analysis model and those that lead to a design model; (4) finding ways to generate a sequence of approximate design optimization problems that capture the essential characteristics of the primary problem, while still having an explicit algebraic form that is matched to one or more of the established optimization algorithms; (5) examining the potential of optimum design sensitivity analysis to facilitate quantitative trade-off studies as well as participation in multilevel design activities. It should be kept in mind that multilevel methods are inherently well suited to a parallel mode of operation in computer terms or to a division of labor between task groups in organizational terms. Based on structural experience with multilevel methods general guidelines are suggested.

Schmit, L. A.↗

A Semi-Algebraic Two Level Solver

We develop a simple semi-algebraic 2-level solver built on traditional multigrid ideas. It is designed to be easily incorporated into existing simulation software. It exhibits good convergence for many classes of challenging problems including discontinuous diffusion, convection- diffusion, and Helmholtz equations. It has built-in structure that makes it simple to generalize in several interesting directions.

97 MATHEMATICS AND COMPUTING↗

Diffraction of a plane pulse by a three-dimensional corner.

The conical solutions for the incidence of a plane pulse on a three-dimensional corner are presented. The corner is represented by a trihedron with one edge perpendicular to the other two. Both the boundary condition of the first kind and that of the second kind are considered. Outside the characteristic sphere of the vertex of the corner, the solution is represented by the well-known conical solutions in two variables. Inside the characteristic sphere, the problem involves three conical variables. By the separation of variables, the problem is reduced to that of an eigenvalue problem with an irregular boundary which is in turn reduced to a system of homogeneous algebraic equations. The eigenvalues are then determined numerically. By the superposition of the conical solutions for plane pulses, the solution for the incidence of a plane wave is obtained. Numerical examples simulating the incidence of a sonic boom on the corner of a structure are presented.

Ting, L.↗

Experiments with conjugate gradient algorithms for homotopy curve tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Irani, Kashmira M.↗

Systolic VLSI for Kalman filters

A novel two-dimensional parallel computing method for real-time Kalman filtering is presented. The mathematical formulation of a Kalman filter algorithm is rearranged to be the type of Faddeev algorithm for generalizing signal processing. The data flow mapping from the Faddeev algorithm to a two-dimensional concurrent computing structure is developed. The architecture of the resulting processor cells is regular, simple, expandable, and therefore naturally suitable for VLSI chip implementation. The computing methodology and the two-dimensional systolic arrays are useful for Kalman filter applications as well as other matrix/vector based algebraic computations.

Yeh, H.-G.↗

Application of a lower-upper implicit scheme and an interactive grid generation for turbomachinery flow field simulations

A finite-volume lower-upper (LU) implicit scheme is used to simulate an inviscid flow in a tubine cascade. This approximate factorization scheme requires only the inversion of sparse lower and upper triangular matrices, which can be done efficiently without extensive storage. As an implicit scheme it allows a large time step to reach the steady state. An interactive grid generation program (TURBO), which is being developed, is used to generate grids. This program uses the control point form of algebraic grid generation which uses a sparse collection of control points from which the shape and position of coordinate curves can be adjusted. A distinct advantage of TURBO compared with other grid generation programs is that it allows the easy change of local mesh structure without affecting the grid outside the domain of independence. Sample grids are generated by TURBO for a compressor rotor blade and a turbine cascade. The turbine cascade flow is simulated by using the LU implicit scheme on the grid generated by TURBO.

Choo, Yung K.↗

Application of a lower-upper implicit scheme and an interactive grid generation for turbomachinery flow field simulations

A finite-volume lower-upper (LU) implicit scheme is used to simulate an inviscid flow in a turbine cascade. This approximate factorization scheme requires only the inversion of sparse lower and upper triangular matrices, which can be done efficiently without extensive storage. As an implicit scheme it allows a large time step to reach the steady state. An interactive grid generation program (TURBO), which is being developed, is used to generate grids. This program uses the control point form of algebraic grid generation which uses a sparse collection of control points from which the shape and position of coordinate curves can be adjusted. A distinct advantage of TURBO compared with other grid generation programs is that it allows the easy change of local mesh structure without affecting the grid outside the domain of dependence. Sample grids are generated by TURBO for a compressor rotor blade and a turbine cascade. The turbine cascade flow is simulated by using the LU implicit scheme on the grid generated by TURBO.

Choo, Yung K.↗

SpaRibs Geometry Parameterization for Wings with Multiple Sections using Single Design

The SpaRibs topology of an aircraft wing has a significant effect on its structural behavior and stability as well as the flutter performance. The development of additive manufacturing techniques like Electron Beam Free Form Fabrication (EBF3) has made it feasible to manufacture aircraft wings with curvilinear spars, ribs (SpaRibs) and stiffeners. In this article a new global-local optimization framework for wing with multiple sections using curvilinear SpaRibs is described. A single design space is used to parameterize the SpaRibs geometry. This method has been implemented using MSC-PATRAN to create a broad range of SpaRibs topologies using limited number of parameters. It ensures C0 and C1 continuities in SpaRibs geometry at the junction of two wing sections with airfoil thickness gradient discontinuity as well as mesh continuity between all structural components. This method is advantageous in complex multi-disciplinary optimization due to its potential to reduce the number of design variables. For the global-local optimization the local panels are generated by an algorithm which is totally based on a set algebra on the connectivity matrix data. The great advantage of this method is that it is completely independent of the coordinates of the nodes of the finite element model. It is also independent of the order in which the elements are distributed in the FEM. The code is verified by optimizing of the CRM Baseline model at trim condition at Mach number equal to 0.85 for five different angle of attack (-2deg, 0deg,2deg,4deg and 6deg). The final weight of the wing is 19,090.61 lb. This value is comparable to that obtained by Qiang et al. 6 (19,269 lb).

wing sections↗

GENIE(++): A Multi-Block Structured Grid System

The computer code GENIE++ is a continuously evolving grid system containing a multitude of proven geometry/grid techniques. The generation process in GENIE++ is based on an earlier version. The process uses several techniques either separately or in combination to quickly and economically generate sculptured geometry descriptions and grids for arbitrary geometries. The computational mesh is formed by using an appropriate algebraic method. Grid clustering is accomplished with either exponential or hyperbolic tangent routines which allow the user to specify a desired point distribution. Grid smoothing can be accomplished by using an elliptic solver with proper forcing functions. B-spline and Non-Uniform Rational B-splines (NURBS) algorithms are used for surface definition and redistribution. The built in sculptured geometry definition with desired distribution of points, automatic Bezier curve/surface generation for interior boundaries/surfaces, and surface redistribution is based on NURBS. Weighted Lagrance/Hermite transfinite interpolation methods, interactive geometry/grid manipulation modules, and on-line graphical visualization of the generation process are salient features of this system which result in a significant time savings for a given geometry/grid application.

Williams, Tonya↗

Structure of pressure-gradient-driven current singularity in ideal magnetohydrodynamic equilibrium

Abstract Singular currents typically appear on rational surfaces in non-axisymmetric ideal magnetohydrodynamic (MHD) equilibria with a continuum of nested flux surfaces and a continuous rotational transition. These currents have two components: a surface current (Dirac δ -function in flux surface labeling) that prevents the formation of magnetic islands, and an algebraically divergent Pfirsch–Schlüter current density when a pressure gradient is present across the rational surface. On flux surfaces adjacent to the rational surface, the traditional treatment gives the Pfirsch–Schlüter current density scaling as J ∼ 1 / Δ ι , where Δ ι is the difference of the rotational transform relative to the rational surface. If the distance s between flux surfaces is proportional to Δ ι , the scaling relation J ∼ 1 / Δ ι ∼ 1 / s will lead to a paradox that the Pfirsch–Schlüter current is not integrable. In this work, we investigate this issue by considering the pressure-gradient-driven singular current in the Hahm–Kulsrud–Taylor problem, which is a prototype for singular currents arising from resonant magnetic perturbations. We show that not only the Pfirsch–Schlüter current density but also the diamagnetic current density are divergent as ∼ 1 / Δ ι . However, due to the formation of a Dirac δ -function current sheet at the rational surface, the neighboring flux surfaces are strongly packed with s ∼ ( Δ ι ) 2 . Consequently, the singular current density J ∼ 1 / s , making the total current finite, thus resolving the paradox. Furthermore, the strong packing of flux surfaces causes a steepening of the pressure gradient near the rational surface, with ∇ p ∼ d p / d s ∼ 1 / s . In general non-axisymmetric MHD equilibrium, contrary to Grad’s conjecture that the pressure profile is flat around densely distributed rational surfaces, our result suggests a pressure profile that densely steepens around them.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

User's guide for NASCRIN: A vectorized code for calculating two-dimensional supersonic internal flow fields

A computer program NASCRIN has been developed for analyzing two-dimensional flow fields in high-speed inlets. It solves the two-dimensional Euler or Navier-Stokes equations in conservation form by an explicit, two-step finite-difference method. An explicit-implicit method can also be used at the user's discretion for viscous flow calculations. For turbulent flow, an algebraic, two-layer eddy-viscosity model is used. The code is operational on the CDC CYBER 203 computer system and is highly vectorized to take full advantage of the vector-processing capability of the system. It is highly user oriented and is structured in such a way that for most supersonic flow problems, the user has to make only a few changes. Although the code is primarily written for supersonic internal flow, it can be used with suitable changes in the boundary conditions for a variety of other problems.

Kumar, A.↗

Computing Aerodynamic Performance of a 2D Iced Airfoil: Blocking Topology and Grid Generation

The ice accrued on airfoils can have enormously complicated shapes with multiple protruded horns and feathers. In this paper, several blocking topologies are proposed and evaluated on their ability to produce high-quality structured multi-block grid systems. A transition layer grid is introduced to ensure that jaggedness on the ice-surface geometry do not to propagate into the domain. This is important for grid-generation methods based on hyperbolic PDEs (Partial Differential Equations) and algebraic transfinite interpolation. A 'thick' wrap-around grid is introduced to ensure that grid lines clustered next to solid walls do not propagate as streaks of tightly packed grid lines into the interior of the domain along block boundaries. For ice shapes that are not too complicated, a method is presented for generating high-quality single-block grids. To demonstrate the usefulness of the methods developed, grids and CFD solutions were generated for two iced airfoils: the NLF0414 airfoil with and without the 623-ice shape and the B575/767 airfoil with and without the 145m-ice shape. To validate the computations, the computed lift coefficients as a function of angle of attack were compared with available experimental data. The ice shapes and the blocking topologies were prepared by NASA Glenn's SmaggIce software. The grid systems were generated by using a four-boundary method based on Hermite interpolation with controls on clustering, orthogonality next to walls, and C continuity across block boundaries. The flow was modeled by the ensemble-averaged compressible Navier-Stokes equations, closed by the shear-stress transport turbulence model in which the integration is to the wall. All solutions were generated by using the NPARC WIND code.

Chi, X.↗

Graph coarsening: from scientific computing to machine learning

Abstract The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take a broad look into coarsening techniques that have been successfully deployed in scientific computing and see how similar principles are finding their way in more recent applications related to machine learning. In scientific computing, coarsening plays a central role in algebraic multigrid methods as well as the related class of multilevel incomplete LU factorizations. In machine learning, graph coarsening goes under various names, e.g., graph downsampling or graph reduction. Its goal in most cases is to replace some original graph by one which has fewer nodes, but whose structure and characteristics are similar to those of the original graph. As will be seen, a common strategy in these methods is to rely on spectral properties to define the coarse graph.

Chen, Jie↗

Holography and unitarity

If holography is an equivalence between quantum theories, one might expect it to be described by a map that is a bijective isometry between bulk and boundary Hilbert spaces, preserving the hamiltonian and symmetries. Holography has been believed to be a property of gravitational (or string) theories, but not of non-gravitational theories; specifically Marolf has argued that it originates from the gauge symmetries and constraints of gravity. These observations suggest study of the assumed holographic map as a function of the gravitational coupling G . The zero coupling limit gives ordinary quantum field theory, and is therefore not necessarily expected to be holographic. This, and the structure of gravity at non-zero G , raises important questions about the full map. In particular, construction of a holographic map appears to require as input a solution of the nonperturbative analog of the bulk gravitational constraints, that is, the unitary bulk evolution. Moreover, examination of the candidate boundary algebra, including the boundary hamiltonian, reveals commutators that don’t close in the usual fashion expected for a boundary theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗

Numerical simulation of backward step and jet exhaust flows

Preparatory to a continuing study of efficient, high resolution flow structure capture on patched mesh systems, turbulent flowfield solutions for a tactical missile base flow problem are computed on two first level composite grids of differing topologies. One mesh is of the wraparound character and the other is a step mesh on the Cartesian topology. A simplified Baldwin-Lomax algebraic eddy viscosity model is applied in the wake region. Results for the two meshes are compared with each other and with other computations reported in the literature. The totality of results suggest both mesh topology and resolution are important factors in the accuracy of predictive results as well as turbulence modeling. Related to interests in high altitude laminar flows bluff bodies such as the AOTV, the paper also presents results from a solution from laminar flow over a backward facing step and makes comparison with the available classical experiment of Chapman, et al.

Lombard, C. K.↗

Heterotic backgrounds via generalised geometry: moment maps and moduli

We describe the geometry of generic heterotic backgrounds preserving minimal supersymmetry in four dimensions using the language of generalised geometry. They are characterised by an SU(3) × Spin(6 + n) structure within O(6, 6 + n) x $\mathbb{R}$ + generalised geometry. Supersymmetry of the background is encoded in the existence of an involutive subbundle of the generalised tangent bundle and the vanishing of a moment map for the action of diffeomorphisms and gauge symmetries. We give both the superpotential and the Kähler potential for a generic background, showing that the latter defines a natural Hitchin functional for heterotic geometries. Intriguingly, this formulation suggests new connections to geometric invariant theory and an extended notion of stability. Finally we show that the analysis of infinitesimal deformations of these geometric structures naturally reproduces the known cohomologies that count the massless moduli of supersymmetric heterotic backgrounds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Current-driven magnetohydrodynamic thermal instabilities in sheared fields

Approximate analytic solutions are sought for the dispersion relation for the MHD stability of magnetized medium in current-driven filamentation modes such as those observed in the solar atmosphere. The magnetic field is assumed to have a self-consistent sheared equilibrium structure. The analysis is carried out in the small wavenumber regime, where shear length is similar to the mode wavelength. Instability is found to depend on the ratio between the thermal and magnetic diffusivities, i.e., the Prandtl number, which identifies the unstable transverse wavenumbers. The instability conditions are expressed in an algebraic equation amenable to numerical solution. Results are provided from use of the model to determine the maximum growth rate and typical scale lengths of instabilities in a precoronal atmosphere and the lower transition region.

Bodo, G.↗