Ordering of implicants.
Correspondence between logical relations of Boolean function implicants and numerical relations between identifiers
BOOLEAN ALGEBRA↗
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.
Computer-developed construction of analytic expressions for the coordinates and partial derivatives of Jupiter's Galilean satellites
A method for improving Sampson's (1910, 1912, 1921) original work in developing series expressions for accurate coordinates of the Galilean satellites is discussed. The method, which utilizes computer-based algebraic manipulation software, was developed to reconstruct Sampson's theory, remove existing errors, introduce neglected effects, and provide analytic expressions for the coordinates as well as for the partial derivatives with respect to orbital parameters, Jupiter's mass and oblateness, the satellite masses, and Jupiter's pole and rotation period. The software system, capable of handling Poisson series with up to 73 polynomial variables and 28 trigonometric arguments, is described. The preliminary solution is presented, and procedures are outlined for calculating perturbations and eliminating auxiliary parameters.
Lieske, J. H.↗
Minimum-weight codewords in the (128,64) BCH
Techniques of combinational algebra and computer simulation are combined to determine the number of weight 22 codewords in the (128,64) BCH code which is being studied for use on future deep-space missions.
Baumert, L. D.↗
Application of advanced reliability methods to local strain fatigue analysis
When design factors are considered as random variables and the failure condition cannot be expressed by a closed form algebraic inequality, computations of risk (or probability of failure) might become extremely difficult or very inefficient. This study suggests using a simple, and easily constructed, second degree polynomial to approximate the complicated limit state in the neighborhood of the design point; a computer analysis relates the design variables at selected points. Then a fast probability integration technique (i.e., the Rackwitz-Fiessler algorithm) can be used to estimate risk. The capability of the proposed method is demonstrated in an example of a low cycle fatigue problem for which a computer analysis is required to perform local strain analysis to relate the design variables. A comparison of the performance of this method is made with a far more costly Monte Carlo solution. Agreement of the proposed method with Monte Carlo is considered to be good.
Wu, T. T.↗
Advanced reliability method for fatigue analysis
When design factors are considered as random variables and the failure condition cannot be expressed by a closed form algebraic inequality, computations of risk (or probability of failure) may become extremely difficult or very inefficient. This study suggests using a simple and easily constructed second degree polynomial to approximate the complicated limit state in the neighborhood of the design point; a computer analysis relates the design variables at selected points. Then a fast probability integration technique (i.e., the Rackwitz-Fiessler algorithm) can be used to estimate risk. The capability of the proposed method is demonstrated in an example of a low cycle fatigue problem for which a computer analysis is required to perform local strain analysis to relate the design variables. A comparison of the performance of this method is made with a far more costly Monte Carlo solution. Agreement of the proposed method with Monte Carlo is considered to be good.
Wu, Y.-T.↗
Physical optics analysis of a four-reflector antenna, part 1
Concern has been raised for the 64-m to 70-m antenna upgrade project that the 70-m system may experience greater S-band beam-pointing perturbations than the 64-m system. The S-band perturbations are due to minor (higher order) mode generation, causing subtle cross-polarization fields affecting beam pointing direction, as described herein. For the antennas in their present configuration (64 m), a slight S-band gain degradation of about 0.05 dB can be attributed to these effects. Therefore, a full physical optics analysis was performed for the present-day 64-m system, as described herein. The results were compared with past analyses and experimental observations in order to verify the algebra and computer code with the intent of deriving a valid analysis method for accurately analyzing the 70-m shaped dual reflector Cassegrainian antenna. The results of the new analysis appear to be in excellent agreement with previous analyses and experimental data.
Cha, A. G.↗
Physical optics analysis of a four-reflector antenna
Concern has been raised for the 64-m to 70-m antenna upgrade project that the 70-m system may experience greater S-band beam-pointing perturbations than the 64-m system. The S-band perturbations are due to minor (higher order) mode generation, causing subtle cross-polarization fields affecting beam pointing direction, as described herein. For the antennas in their present configuration (64 m), a slight S-band gain degradation of about 0.05 dB can be attributed to these effects. Therefore, a full physical optics analysis was performed for the present-day 64-m system, as described herein. The results were compared with past analyses and experimental observations in order to verify the algebra and computer code with the intent of deriving a valid analysis method for accurately analyzing the 70-m shaped dual reflector Cassegrainian antenna. The results of the new analysis appear to be in excellent agreement with previous analyses and experimental data.
Cha, A. G.↗
Simultaneous expansion and orthogonalization of measured modes for structure identification
Tests of large structures on-orbit will be performed with measurements at a relatively few structure points. Values for the unmeasured degrees of freedom (dofs) can be estimated based on measured dofs and analytical model dynamic information. These 'expanded' mode shapes are useful for optimal-update identification and damage location as well as test/analysis correlation. A new method of expansion for test mode shape vectors is developed from the orthogonal Procrustes problem from computational linear algebra. A subspace defined by the set of measured dofs is compared to a subspace defined by mode shapes from an analytical model of the structure. The method simultaneously expands and orthogonalizes the mode shape vectors. Two demonstration problems are used to compare the new method to current expansion techniques. One demonstration uses test data from a laboratory scale-model truss structure. Performance of the new method is comparable or superior to that of the previous expansion methods which require separate orthogonalization.
Smith, Suzanne Weaver↗
An abbreviated Reynolds stress turbulence model for airfoil flows
An abbreviated Reynolds stress turbulence model is presented for solving turbulent flow over airfoils. The model consists of two partial differential equations, one for the Reynolds shear stress and the other for the turbulent kinetic energy. The normal stresses and the dissipation rate of turbulent kinetic energy are computed from algebraic relationships having the correct asymptotic near wall behavior. This allows the model to be integrated all the way to the wall without the use of wall functions. Results for a flat plate at zero angle of attack, a NACA 0012 airfoil and a RAE 2822 airfoil are presented.
Gaffney, R. L., Jr.↗
Recent trends in numerical linear algebra: Avoiding communication and tolerating computer hardware faults.
Abstract not provided.
Hoemmen, Mark Frederick↗
Novel Solver Algorithms for Nearly Singular Linear Systems Arising in Combustion Modelling
Direct Numerical Simulations of realistic combustion devices are extremely challenging due to the wide separation of scales in the simulation, for example an internal combustion (IC) engine chamber, and the flame thickness of a high-pressure flame. The PeleLMeX solver uses adaptive mesh refinement (AMR) to evolve multi-species reacting flows in the low Mach number limit at the Exascale and relies on an embedded boundary (EB) approach to represent complex geometries. In that framework, the EB geometries often give rise to very small cut-cells along the boundary, which translate into extreme ill-conditioning of the pressure-projection, with eigenvalues that span 15-16 orders of magnitude. In this talk, we focus on the case of a typical IC piston bowl geometry for which we present on a novel approach towards solving these nearly singular linear systems with ILU-based, C-AMG smoothers on massively parallel architectures. In particular, we use scaling and equilibration algorithms to handle the non-normality of the upper triangular factors. This enables us to approximate the highly sequential triangular solve algorithm, embedded in the AMG smoothing-solve phase, with Jacobi iterations. This approximation can be written as a convergent Neumann series whose terms are composed of highly parallel sparse matrix vector multiplications. The result is an algorithm that substantially decreases setup and solve time, compared to state-of-the-art, for these challenging linear systems.
combustion modelling↗
Variational projection methods for gradient crystal plasticity using Lie algebras
Summary A computational method is developed for evaluating the plastic strain gradient hardening term within a crystal plasticity formulation. While such gradient terms reproduce the size effects exhibited in experiments, incorporating derivatives of the plastic strain yields a nonlocal constitutive model. Rather than applying mixed methods, we propose an alternative method whereby the plastic deformation gradient is variationally projected from the elemental integration points onto a smoothed nodal field. Crucially, the projection utilizes the mapping between Lie groups and algebras in order to preserve essential physical properties, such as orthogonality of the plastic rotation tensor. Following the projection, the plastic strain field is directly differentiated to yield the Nye tensor. Additionally, an augmentation scheme is introduced within the global Newton iteration loop such that the computed Nye tensor field is fed back into the stress update procedure. Effectively, this method results in a fully implicit evolution of the constitutive model within a traditional displacement‐based formulation. An elemental projection method with explicit time integration of the plastic rotation tensor is compared as a reference. A series of numerical tests are performed for several element types in order to assess the robustness of the method, with emphasis placed upon polycrystalline domains and multi‐axis loading. Copyright © 2016 John Wiley & Sons, Ltd.
Truster, Timothy J.↗
A finite element computation of turbulent boundary layer flows with an algebraic stress turbulence model
An algebraic stress turbulence model and a computational procedure for turbulent boundary layer flows which is based on the semidiscrete Galerkin FEM are discussed. In the algebraic stress turbulence model, the eddy viscosity expression is obtained from the Reynolds stress turbulence model, and the turbulent kinetic energy dissipation rate equation is improved by including a production range time scale. Good agreement with experimental data is found for the examples of a fully developed channel flow, a fully developed pipe flow, a flat plate boundary layer flow, a plane jet exhausting into a moving stream, a circular jet exhausting into a moving stream, and a wall jet flow.
Kim, Sang-Wook↗
The semi-Markov unreliability range evaluator program
The SURE program is a design/validation tool for ultrareliable computer system architectures. The system uses simple algebraic formulas to compute accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. The mathematical formulas used in the program were derived from a mathematical theorem proven by Allan White under contract to NASA Langley Research Center. This mathematical theorem is discussed along with the user interface to the SURE program.
Butler, R. W.↗
LieART 2.0 – A Mathematica application for Lie Algebras and Representation Theory
In this paper, we present LieART 2.0 which contains substantial extensions to the Mathematica application LieART (Lie Algebras and Representation Theory) for computations frequently encountered in Lie algebras and representation theory, such as tensor product decomposition and subalgebra branching of irreducible representations. The basic procedure is unchanged—it computes root systems of Lie algebras, weight systems and several other properties of irreducible representations, but new features and procedures have been included to allow the extensions to be seamless. The new version of LieART continues to be user friendly. New extended tables of properties, tensor products and branching rules of irreducible representations are included in the supplementary material for use without Mathematica software. LieART 2.0 now includes the branching rules to special subalgebras for all classical and exceptional Lie algebras up to and including rank 15.
97 MATHEMATICS AND COMPUTING↗
BoBa
BoBa is a C++ software library for working with large matrices, tensors, and tensor decompositions. The library provides tools for dense matrix and tensor operations, tensor decompositions, and tensor decomposition methods that support modern CPU and GPU architectures. It includes portable abstractions for linear algebra, tensor algebra, and multidimensional computation. BoBa is intended for scientific computing applications that involve large multidimensional data sets or high dimensional mathematical models. Its capabilities support tasks such as data compression, linear algebra, efficient numerical computation, and the development of scalable algorithms for heterogeneous hardware. Tutorials, tests, and example applications are included to help users learn and apply the library.
Yao, Jin [Lawrence Livermore National Laboratory (↗
Non-intrusive data-driven model reduction for differential–algebraic equations derived from lifting transformations
In this paper we present a non-intrusive data-driven approach for model reduction of nonlinear systems. The approach considers the particular case of nonlinear partial differential equations (PDEs) that form systems of partial differential–algebraic equations (PDAEs) when lifted to polynomial form. Such systems arise, for example, when the governing equations include Arrhenius reaction terms (e.g., in reacting flow models) and thermodynamic terms (e.g., the Helmholtz free energy terms in a phase-field solidification model). Using the known structured form of the lifted algebraic equations, the approach computes the reduced operators for the algebraic equations explicitly, using straightforward linear algebra operations on the basis matrices. The reduced operators for the differential equations are inferred from lifted snapshot data using operator inference, which solves a linear least squares regression problem. The approach is illustrated for the nonlinear model of solidification of a pure material. The lifting transformations reformulate the solidification PDEs as a system of PDAEs that have cubic structure. The operators of the lifted system for this solidification example have affine dependence on key process parameters, permitting us to learn a parametric reduced model with operator inference. Numerical experiments show the effectiveness of the resulting reduced models in capturing key aspects of the solidification dynamics.
42 ENGINEERING↗
Efficient Adjoint Computation of Hybrid Systems of Differential Algebraic Equations with Applications in Power Systems
Sensitivity analysis is an important tool to describe power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitivity parameters. In this work, we investigate, implement, and test a discrete adjoint sensitivity approach whose computational effort is effectively independent of the number of sensitivity parameters. The proposed approach is highly efficient for calculating trajectory sensitivities of larger systems and is consistent, within machine precision, with the function whose sensitivity we are seeking. This is an essential feature for use in optimization applications. Moreover, our approach includes a consistent treatment of systems with switching, such as DC exciters, by deriving and implementing the adjoint jump conditions that arise from state and time-dependent discontinuities. The accuracy and the computational efficiency of the proposed approach are demonstrated in comparison with the forward sensitivity analysis approach.
24 POWER TRANSMISSION AND DISTRIBUTION↗