Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Algebra”

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 1,765 records · Page 98

A Minimum Variance Algorithm for Overdetermined TOA Equations with an Altitude Constraint.

We present a direct (non-iterative) method for solving for the location of a radio frequency (RF) emitter, or an RF navigation receiver, using four or more time of arrival (TOA) measurements and an assumed altitude above an ellipsoidal earth. Both the emitter tracking problem and the navigation application are governed by the same equations, but with slightly different interpreta- tions of several variables. We treat the assumed altitude as a soft constraint, with a specified noise level, just as the TOA measurements are handled, with their respective noise levels. With 4 or more TOA measurements and the assumed altitude, the problem is overdetermined and is solved in the weighted least squares sense for the 4 unknowns, the 3-dimensional position and time. We call the new technique the TAQMV (TOA Altitude Quartic Minimum Variance) algorithm, and it achieves the minimum possible error variance for given levels of TOA and altitude estimate noise. The method algebraically produces four solutions, the least-squares solution, and potentially three other low residual solutions, if they exist. In the lightly overdermined cases where multiple local minima in the residual error surface are more likely to occur, this algebraic approach can produce all of the minima even when an iterative approach fails to converge. Algorithm performance in terms of solution error variance and divergence rate for bas eline (iterative) and proposed approach are given in tables.

97 MATHEMATICS AND COMPUTING↗

Masses of ground-state mesons and baryons, including those with heavy quarks

Using a confining, symmetry-preserving regularization of a vector x vector contact interaction, we compute the spectra of ground-state pseudoscalar and vector of ($f$$\bar{g}$) mesons, scalar and axial-vector ($fg$) diquarks, and $J^{P}$ = 1/2(+), 3/2(+) ($fgh$) baryons, where $f, g, h$ is an element of {$u, d, s, c, b$}. The diquark correlations are essentially dynamical and play a key role in formulating and solving the three-valence-quark baryon problems. The baryon spectrum obtained from this largely algebraic approach reproduces the 22 known experimental masses with an accuracy of 2.9(2.4)%. It also possesses the richness of states typical of constituent-quark models, predicting many heavy-quark baryons not yet observed. This study indicates that diquark correlations are an important component of all baryons; and owing to the dynamical character of the diquarks, it is typically the lightest allowed diquark correlation that defines the most important component of a baryon's Faddeev amplitude.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

ACCELERATED FITTING OF STELLAR SPECTRA

Stellar spectra are often modeled and fitted by interpolating within a rectilinear grid of synthetic spectra to derive the stars’ labels: stellar parameters and elemental abundances. However, the number of synthetic spectra needed for a rectilinear grid grows exponentially with the label space dimensions, precluding the simultaneous and self-consistent fitting of more than a few elemental abundances. Shortcuts such as fitting subsets of labels separately can introduce unknown systematics and do not produce correct error covariances in the derived labels. In this paper we present a new approach—Convex Hull Adaptive Tessellation (chat)—which includes several new ideas for inexpensively generating a sufficient stellar synthetic library, using linear algebra and the concept of an adaptive, data-driven grid. A convex hull approximates the region where the data lie in the label space. A variety of tests with mock data sets demonstrate that chat can reduce the number of required synthetic model calculations by three orders of magnitude in an eight-dimensional label space. The reduction will be even larger for higher dimensional label spaces. In chat the computational effort increases only linearly with the number of labels that are fit simultaneously. Around each of these grid points in the label space an approximate synthetic spectrum can be generated through linear expansion using a set of “gradient spectra” that represent flux derivatives at every wavelength point with respect to all labels. These techniques provide new opportunities to fit the full stellar spectra from large surveys with 15–30 labels simultaneously.

79 ASTRONOMY AND ASTROPHYSICS↗

An evaluation of several compressible turbulent boundary-layer models Effects of pressure gradient and Reynolds number

Computations, employing several turbulence models, are compared with a series of attached supersonic turbulent boundary-layer experiments over an extensive range of Reynolds numbers (11.7 x 10 to the 6th to 314 x 10 to the 6th). These experiments included measurements of surface pressure and skin friction for adverse pressure gradients ranging in magnitude from those of previous investigations to an order of magnitude greater. The turbulence models evaluated include algebraic and two-equation eddy-viscosity models and two full Reynolds stress models. In general all the models tested performed well independently of the magnitude of the pressure gradient or Reynolds number and could predict the measured skin friction for most cases with sufficient accuracy for engineering purposes.

Horstman, C. C.↗

Development of an Unstructured Mesh Code for Flows About Complete Vehicles

This report describes the research work undertaken at the Massachusetts Institute of Technology, under NASA Research Grant NAG4-157. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of flow simulations about complete vehicle configurations. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms, flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the code which incorporates real gas effects, has been produced. The FELISA system is also a component of the STARS aeroservoelastic system developed at NASA Dryden. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. We show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although this initial results were encouraging it became apparent that in order to develop a fully functional capability for viscous flows, several advances in solution accuracy, robustness and efficiency were required. In this grant we set out to investigate some novel methodologies that could lead to the required improvements. In particular we focused on two fronts: (1) finite element methods and (2) iterative algebraic multigrid solution techniques.

Peraire, Jaime↗

Isotropic N-point basis functions and their properties

Isotropic functions of positions r 1 , r 2 ,..., r N , i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch–Gordan coefficients. An orthonormal basis of such functions provides a formalism suitable for analyzing isotropic distributions such as those that arise in cosmology, for instance in the clustering of galaxies as revealed by large-scale structure surveys. The algebraic properties of the basis functions are conveniently expressed in terms of 6-j and 9-j symbols. Finally, the calculation of relations among the basis functions is facilitated by 'Yutsis' diagrams for the addition and recoupling of angular momenta.

97 MATHEMATICS AND COMPUTING↗

The Auxiliary Space Preconditioner for the de Rham Complex

Here we generalize the construction and analysis of auxiliary space preconditioners to the $n$-dimensional finite element subcomplex of the de Rham complex. These preconditioners are based on a generalization of a decomposition of Sobolev space functions into a regular part and a potential. A discrete version is easily established using the tools of finite element exterior calculus. We then discuss the four-dimensional de Rham complex in detail. By identifying forms in four dimensions with simple proxies, form operations are written out in terms of familiar algebraic operations on matrices, vectors, and scalars. This provides the basis for our implementation of the preconditioners in four dimensions. Extensive numerical experiments illustrate their performance, practical scalability, and parameter robustness, all in accordance with the theory.

4D↗

Performance Engineering Research Institute SciDAC-2 Enabling Technologies Institute Final Report

Enhancing the performance of SciDAC applications on petascale systems has high priority within DOE SC. As we look to the future, achieving expected levels of performance on high-end com-puting (HEC) systems is growing ever more challenging due to enormous scale, increasing archi-tectural complexity, and increasing application complexity. To address these challenges, PERI has implemented a unified, tripartite research plan encompassing: (1) performance modeling and prediction; (2) automatic performance tuning; and (3) performance engineering of high profile applications. The PERI performance modeling and prediction activity is developing and refining performance models, significantly reducing the cost of collecting the data upon which the models are based, and increasing model fidelity, speed and generality. Our primary research activity is automatic tuning (autotuning) of scientific software. This activity is spurred by the strong user preference for automatic tools and is based on previous successful activities such as ATLAS, which has automatically tuned components of the LAPACK linear algebra library, and other re-cent work on autotuning domain-specific libraries. Our third major component is application en-gagement, to which we are devoting approximately 30% of our effort to work directly with Sci-DAC-2 applications. This last activity not only helps DOE scientists meet their near-term per-formance goals, but also helps keep PERI research focused on the real challenges facing DOE computational scientists as they enter the Petascale Era.

97 MATHEMATICS AND COMPUTING↗

Time-domain finite elements in optimal control with application to launch-vehicle guidance

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Bless, Robert R.↗

Application of Hybrid Optimization-Expert System for Optimal Power Management on Board Space Power Station

The space power system has two sources of energy: photo-voltaic blankets and batteries. The optimal power management problem on-board has two broad operations: off-line power scheduling to determine the load allocation schedule of the next several hours based on the forecast of load and solar power availability. The nature of this study puts less emphasis on speed requirement for computation and more importance on the optimality of the solution. The second category problem, on-line power rescheduling, is needed in the event of occurrence of a contingency to optimally reschedule the loads to minimize the 'unused' or 'wasted' energy while keeping the priority on certain type of load and minimum disturbance of the original optimal schedule determined in the first-stage off-line study. The computational performance of the on-line 'rescheduler' is an important criterion and plays a critical role in the selection of the appropriate tool. The Howard University Center for Energy Systems and Control has developed a hybrid optimization-expert systems based power management program. The pre-scheduler has been developed using a non-linear multi-objective optimization technique called the Outer Approximation method and implemented using the General Algebraic Modeling System (GAMS). The optimization model has the capability of dealing with multiple conflicting objectives viz. maximizing energy utilization, minimizing the variation of load over a day, etc. and incorporates several complex interaction between the loads in a space system. The rescheduling is performed using an expert system developed in PROLOG which utilizes a rule-base for reallocation of the loads in an emergency condition viz. shortage of power due to solar array failure, increase of base load, addition of new activity, repetition of old activity etc. Both the modules handle decision making on battery charging and discharging and allocation of loads over a time-horizon of a day divided into intervals of 10 minutes. The models have been extensively tested using a case study for the Space Station Freedom and the results for the case study will be presented. Several future enhancements of the pre-scheduler and the 'rescheduler' have been outlined which include graphic analyzer for the on-line module, incorporating probabilistic considerations, including spatial location of the loads and the connectivity using a direct current (DC) load flow model.

Momoh, James↗

Global Dynamic Modeling of Space-Geodetic Data

The proposal had outlined a year for program conversion, a year for testing and debugging, and two years for numerical experiments. We kept to that schedule. In first (partial) year, author designed a finite element for isostatic thin-shell deformation on a sphere, derived all of its algebraic and stiffness properties, and embedded it in a new finite element code which derives its basic solution strategy (and some critical subroutines) from earlier flat-Earth codes. Also designed and programmed a new fault element to represent faults along plate boundaries. Wrote a preliminary version of a spherical graphics program for the display of output. Tested this new code for accuracy on individual model plates. Made estimates of the computer-time/cost efficiency of the code for whole-earth grids, which were reasonable. Finally, converted an interactive graphical grid-designer program from Cartesian to spherical geometry to permit the beginning of serious modeling. For reasons of cost efficiency, models are isostatic, and do not consider the local effects of unsupported loads or bending stresses. The requirements are: (1) ability to represent rigid rotation on a sphere; (2) ability to represent a spatially uniform strain-rate tensor in the limit of small elements; and (3) continuity of velocity across all element boundaries. Author designed a 3-node triangle shell element which has two different sets of basis functions to represent (vector) velocity and all other (scalar) variables. Such elements can be shown to converge to the formulas for plane triangles in the limit of small size, but can also applied to cover any area smaller than a hemisphere. The difficult volume integrals involved in computing the stiffness of such elements are performed numerically using 7 Gauss integration points on the surface of the sphere, beneath each of which a vertical integral is performed using about 100 points.

Bird, Peter↗

Proteus-MOC: A 3D deterministic solver incorporating 2D method of characteristics

A new transport solution methodology was developed by combining the two-dimensional method of characteristics with the discontinuous Galerkin method for the treatment of the axial variable. The method, which can be applied to arbitrary extruded geometries, was implemented in PROTEUS-MOC and includes parallelization in group, angle, plane, and space using a top level GMRES linear algebra solver. Verification tests were performed to show accuracy and stability of the method with the increased number of angular directions and mesh elements. Good scalability with parallelism in angle and axial planes is displayed. (authors)

97 MATHEMATICS AND COMPUTING↗

Scalability under a Power Bound using the GREMLINs Framework

With the move towards exascale, system and software developers will have to deal with issues of extreme parallelism. The system properties affected most by the increase in node and core count are the shared resources on node and across the system. The increase in parallelism leads to reduced memory and bandwidth when regarding individual cores. Since power is a limiting factor for supercomputers, and power is not fully utilized in current systems, overprovisioning compute resources is a viable approach to maximized power utilization. To maximize system performance in regard to these changing conditions, it is necessary to understand how resource restrictions impact performance and system behavior. For the purpose of understanding anticipated system properties the GREMLINs Framework was developed. The framework gives the opportunity to add power restrictions, hinder memory properties and introduce faults to study resilience, among others. These features give the opportunity to use current petascale technology to study problems system designers and software developers will have to face when moving towards exascale and beyond. This work describes the initial release of the GREMLINs Framework, developed for this work, and shows how it can be used to study the scaling behavior of proxy applications. These proxy applications represent a selection of HPC workloads important to the scientific community. The proxy applications studied are AMG2013, an algebraic multi-grid linear system solver, CoMD, a classical molecular dynamics proxy application and NEKBONE, an application that uses a high order spectral element method to solve the Navier-Stokes equations. The main interest of these studies lies in analysis regarding their power behavior at scale under a power bound. These findings show how the GREMLINs Framework can help systems and software designers to attain better application performance and can also be used as basis for CPU power balancing tools to use power more efficiently.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Is the Multigrid Method Fault Tolerant? The Two-Grid Case

The predicted reduced resiliency of next-generation high performance computers means that it will become necessary to take into account the effects of randomly occurring faults on numerical methods. Further, in the event of a hard fault occurring, a decision has to be made as to what remedial action should be taken in order to resume the execution of the algorithm. The action that is chosen can have a dramatic effect on the performance and characteristics of the scheme. Ideally, the resulting algorithm should be subjected to the same kind of mathematical analysis that was applied to the original, deterministic variant. The purpose of this work is to provide an analysis of the behaviour of the multigrid algorithm in the presence of faults. Multigrid is arguably the method of choice for the solution of large-scale linear algebra problems arising from discretization of partial differential equations and it is of considerable importance to anticipate its behaviour on an exascale machine. The analysis of resilience of algorithms is in its infancy and the current work is perhaps the first to provide a mathematical model for faults and analyse the behaviour of a state-of-the-art algorithm under the model. It is shown that the Two Grid Method fails to be resilient to faults. Attention is then turned to identifying the minimal necessary remedial action required to restore the rate of convergence to that enjoyed by the ideal fault-free method.

97 MATHEMATICS AND COMPUTING↗

Transonic aeroelastic analysis of launch vehicle configurations

A numerical study of the aeroelastic stability of typical launch vehicle configurations in transonic flight is performed. Recent computational fluid dynamics techniques are used to simulate the transonic aerodynamic flow fields, as opposed to relying on experimental data for the unsteady aerodynamic pressures. The flow solver is coupled to an appropriate structural representation of the vehicle. The aerodynamic formulation is based on the thin layer approximation to the Reynolds-Averaged Navier-Stokes equations, where the account for turbulent mixing is done by the two-layer Baldwin and Lomax algebraic eddy viscosity model. The structural-dynamic equations are developed considering free-free flexural vibration of an elongated beam with variable properties and are cast in modal form. Aeroelastic analyses are performed by integrating simultaneously in the two sets of equations. By tracing the growth or decay of a perturbed oscillation, the aeroelastic stability of a given constant configuration can be ascertained. The method is described in detail, and results that indicate its application are presented. Applications include some validation cases for the algorithm developed, as well as the study of configurations known to have presented flutter programs in the past.

Filgueirasdeazevedo, Joao Luiz↗

A Viscoelastic Hybrid Shell Finite Element

An elastic large displacement thick-shell hybrid finite element is modified to allow for the calculation of viscoelastic stresses. Internal strain variables are introduced at he element's stress nodes and are employed to construct a viscous material model. First order ordinary differential equations relate the internal strain variables to the corresponding elastic strains at the stress nodes. The viscous stresses are computed from the internal strain variables using viscous moduli which are a fraction of the elastic moduli. The energy dissipated by the action of the viscous stresses in included in the mixed variational functional. Nonlinear quasi-static viscous equilibrium equations are then obtained. Previously developed Taylor expansions of the equilibrium equations are modified to include the viscous terms. A predictor-corrector time marching solution algorithm is employed to solve the algebraic-differential equations. The viscous shell element is employed to numerically simulate a stair-step loading and unloading of an aircraft tire in contact with a frictionless surface.

Johnson, Arthur↗

Localized Pisot Matrices and Joint Approximations of Algebraic Numbers

A development of the simplex-module algorithm for expansion of algebraic numbers in multidimensional continued fractions is proposed. To this end, localized Pisot matrices are constructed, whose eigenvalues with moduli less than one are contained in an interval of small length. Such Pisot matrices generate continued fractions whose convergents are arbitrarily close to the best approximations.

97 MATHEMATICS AND COMPUTING↗