Search NASA⌕ Search

SEARCH · Search NASA

Results for “algebraic methods”

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 145 records · Page 8

Euler solutions for high-speed flow about complex three-dimensional configurations

A numerical algorithm based on a finite-volume explicit scheme with Runge-Kutta time integration of the Euler equations is presented for calculating high-speed three-dimensional flow about complex aerospace configurations. The use of enhancing factors such as artificial dissipative terms, enthalpy damping and local time-stepping are described. An algebraic method for generating quasi-three-dimensional computational grids for realistic aerospace configurations is presented. Computed results for various three-dimensional bodies at different Mach numbers and angles of attack have been obtained using the methods for grid-generation and flow simulation. Comparison of computed and experimental data for an advanced tactical aircraft-like configuration is presented, and a reasonable agreement of the data is noticed.

Moitra, A.↗

Robustness issues in boundary feedback of flexible structures

Transfer function models for basic structural elements with boundary control reveal certain inherent properties relevant to questions of control system realization, design, and analysis of robustness. The transfer functions involved are not strictly proper, may be nonminimum phase (except for the special case of colocated actuation and sensing), and often have large number of poles on the imaginary axis. In this paper these basic questions are considered in terms of modeling and control system design for robustness. The application of algebraic methods for computing stabilizing control, based on certain exact, irrational transfer functions is investigated. Boundary control of the wave equation is considered and extension of the method to more general problems is suggested. Special attention is given to implementation issues associated with a class of infinite dimensional control laws.

Bennett, W. H.↗

Implementation of control point form of algebraic grid-generation technique

The control point form (CPF) provides explicit control of physical grid shape and grid spacing through the movement of the control points. The control point array, called a control net, is a space grid type arrangement of locations in physical space with an index for each direction. As an algebraic method CPF is efficient and works well with interactive computer graphics. A family of menu-driven, interactive grid-generation computer codes (TURBO) is being developed by using CPF. Key features of TurboI (a TURBO member) are discussed and typical results are presented. TurboI runs on any IRIS 4D series workstation.

Choo, Yung K.↗

GridMan: A grid manipulation system

GridMan is an interactive grid manipulation system. It operates on grids to produce new grids which conform to user demands. The input grids are not constrained to come from any particular source. They may be generated by algebraic methods, elliptic methods, hyperbolic methods, parabolic methods, or some combination of methods. The methods are included in the various available structured grid generation codes. These codes perform the basic assembly function for the various elements of the initial grid. For block structured grids, the assembly can be quite complex due to a large number of clock corners, edges, and faces for which various connections and orientations must be properly identified. The grid generation codes are distinguished among themselves by their balance between interactive and automatic actions and by their modest variations in control. The basic form of GridMan provides a much more substantial level of grid control and will take its input from any of the structured grid generation codes. The communication link to the outside codes is a data file which contains the grid or section of grid.

Eiseman, Peter R.↗

Implementation of control point form of algebraic grid-generation technique

The control point form (CPF) provides explicit control of physical grid shape and grid spacing through the movement of the control points. The control point array, called a control net, is a space grid type arrangement of locations in physical space with an index for each direction. As an algebraic method CPF is efficient and works well with interactive computer graphics. A family of menu-driven, interactive grid-generation computer codes (TURBO) is being developed by using CPF. Key features of TurboI (a TURBO member) are discussed and typical results are presented. TurboI runs on any IRIS 4D series workstation.

Choo, Yung K.↗

The harmonic oscillator and nuclear physics

The three-dimensional harmonic oscillator plays a central role in nuclear physics. It provides the underlying structure of the independent-particle shell model and gives rise to the dynamical group structures on which models of nuclear collective motion are based. It is shown that the three-dimensional harmonic oscillator features a rich variety of coherent states, including vibrations of the monopole, dipole, and quadrupole types, and rotations of the rigid flow, vortex flow, and irrotational flow types. Nuclear collective states exhibit all of these flows. It is also shown that the coherent state representations, which have their origins in applications to the dynamical groups of the simple harmonic oscillator, can be extended to vector coherent state representations with a much wider range of applicability. As a result, coherent state theory and vector coherent state theory become powerful tools in the application of algebraic methods in physics.

Rowe, D. J.↗

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↗

Pose Estimation in the Geometric Algebra G (3, 0, 1)

Using techniques from Geometric Algebra, methods for solving attitude determination problems are extended to the problem of simultaneously estimating attitude and location, i.e. pose, from direct or indirect measurements of geometric objects including points, lines, and planes. Wahba’s problem is generalized for the solution of initial pose. The multiplicative extended Kalman filter is generalized for the maintenance of pose solutions. Farrankopf’s model for biases in rotation rate sensors is generalized to biases in twist rate measurements. A multiplicative extended Kalman filter for pose in the presence of such biases is developed.

Sensor Bias Modeling↗

Cognitive Foundry v. 3.0 (OSS)

The Cognitive Foundry is a unified collection of tools designed for research and applications that use cognitive modeling, machine learning, or pattern recognition. The software library contains design patterns, interface definitions, and default implementations of reusable software components and algorithms designed to support a wide variety of research and development needs. The library contains three main software packages: the Common package that contains basic utilities and linear algebraic methods, the Cognitive Framework package that contains tools to assist in implementing and analyzing theories of cognition, and the Machine Learning package that provides general algorithms and methods for populating Cognitive Framework components from domain-relevant data.

Basilico, Justin↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

A dynamic model of once-through steam generator (OTSG) for prototypical advanced reactor - 374

new design of Small Modular Reactor, the Prototypical Advanced Reactor (PAR), features two sodium primary systems each connected to dedicated steam generators (SGs) and sharing a balance of plant (BOP) system. PAR adopts once-through steam generators (OTSG) for its compact structure. The existence of superheated steam in a OTSG improves turbine design by eliminating the need of bulky moisture separator in SG. The two cores and SGs' design enable PAR to adjust power flexibly, as a result, introduce more challenges to the control. Therefore, a fast simulation model with high accuracy OTSG model is needed. In this paper, a dynamic model is built for OTSG of PAR based on the conservation of mass, momentum, and energy. The OTSG is simulated as lumped pipe and divided into subcooled, evaporating, and superheated regions by moving boundaries. SIMULINK is adopted to this OTSG simulation to be merged into existing PAR system models easily. The steady state results show that key parameters are rational. The 5% step increase of feedwater enthalpy transient demonstrates that the model is capable to respond to the perturbations. Since the basic laws and algebraic method used in this paper are suitable for other fluids, the model can be easily applied to any other OTSG. Future work will also focus on model optimization, merging and improved control. The final aim is to perform full scope realtime simulations for PAR under normal operational transients. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A grid spacing control technique for algebraic grid generation methods

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

Smith, R. E.↗

Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

Yang, Jiann-Cherng↗

Adaptive Algebraic Smoothers

methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.

99 GENERAL AND MISCELLANEOUS↗

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

Improved Blending-Function Algebraic Generation Of Grids

Method of algebraic generation of grids used in computing flows incorporates blending-function techniques to obtain high degree of orthogonality of each grid on its bounding surfaces and to blend grid smoothly, making it conform to all boundaries. Demonstrated in two dimensions, and applied in continuing development of software for real-time interactive generation of three-dimensional grids with color graphical displays. Software used routinely in generating grids for computing flows of practical interest.

Ching-Chung Luh, Raymond↗