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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Fast Transient Simulations for Multi-Segment Transmission Lines with a Graphical Model

This paper studies a computationally efficient algebraic graph theory engine for simulating time-domain one-dimensional waves in a multi-segment transmission line, such as for reflectometry applications. Efficient simulation of time-domain signals in multi-segment transmission lines is challenging because the number of propagation paths (and therefore the number of operations) increases exponentially with each new interface. We address this challenge through the use of a frequency-domain, algebraic graphical model of wave propagation, which is then converted to the time domain via the Fourier transform. We use this model to achieve an exact, stable, and computationally efficient (O(NQ), where N is the number of segments and Q is the bandwidth) approach for studying one-dimensional wave propagation. Our approach requires the reflection and transmission coefficients for each interface and each segment's complex propagation constant. Furthermore, we compare our simulation results with known analytical solutions.

42 ENGINEERING↗
DOE OSTI2016

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an $\mathcal{O}(n)$ solution process for many large sparse linear systems. A hierarchy of progressively coarser grids which utilize complementary relaxation and interpolation operators is constructed. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grid matrices and reduced there. However, large parallel communication costs often limit parallel scalability. Furthermore, as the multigrid hierarchy is formed, each coarse matrix is formed through a triple matrix product. The resulting coarse grids often have significantly more nonzeros per row than the original fine-grid operator, thereby generating high parallel communication costs associated with sparse matrix-vector multiplication (SpMV) on coarse levels. In this paper, we introduce a method that systematically removes entries in coarse-grid matrices after the hierarchy is formed, leading to improved communication costs. We sparsify by removing weakly connected or unimportant entries in the matrix, leading to improved solve time. The main trade-off is that if the heuristic identifying unimportant entries is used too aggressively, then AMG convergence can suffer. To counteract this, the original hierarchy is retained, allowing entries to be reintroduced into the solver hierarchy if convergence is too slow. This enables a balance between communication cost and convergence, as necessary. In this paper we present new algorithms for reducing communication and present a number of computational experiments in support.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On the Varieties of Commutative Metabelian Algebras

The paper presents new results on varieties of commutative metabelian algebras over a field of zero characteristic. We study the structure of the multilinear part of the variety of all commutative metabelian algebras as a module of the symmetric group. Two almost nilpotent varieties are introduced and studied in this class of algebras. We prove the nonexistence of other almost nilpotent commutative metabelian varieties of subexponential growth.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

On the τ-Compactness of Products of τ -Measurable Operators Adjoint to Semi-Finite Von Neumann Algebras

Let M be the von Neumann algebra of operators in a Hilbert space H and τ be an exact normal semi-finite trace on M. We obtain inequalities for permutations of products of τ-measurable operators. We apply these inequalities to obtain new submajorizations (in the sense of Hardy, Littlewood, and Pólya) of products of τ -measurable operators and a sufficient condition of orthogonality of certain nonnegative τ-measurable operators. We state sufficient conditions of the τ –compactness of products of self-adjoint τ -measurable operators and obtain a criterion of the τ -compactness of the product of a nonnegative τ-measurable operator and an arbitrary τ -measurable operator. We present an example that shows that the nonnegativity of one of the factors is substantial. We also state a criterion of the elementary nature of the product of nonnegative operators from M . All results are new for the *-algebra B(H) of all bounded linear operators in H endowed with the canonical trace τ = tr.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Exponential growth of codimensions of identities of algebras with unity

The asymptotic behaviour is studied of exponentially bounded sequences of codimensions of identities of algebras with unity. A series of algebras is constructed for which the base of the exponential increases by exactly 1 when an outer unity is adjoined to the original algebra. It is shown that the PI-exponents of unital algebras can take any value greater than 2, and the exponents of finite-dimensional unital algebras form a dense subset in the domain [2,∞). Bibliography: 34 titles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Non-Galerkin Coarse Grids for Algebraic Multigrid

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Uniqueness of Addition in Lie Algebras of Chevalley Type over Rings with 1/2 and 1/3

In this paper, it is proved that Lie algebras of Chevalley type (A{sub n}, B{sub n}, C{sub n}, D{sub n}, E{sub 6}, E{sub 7}, E{sub 8}, F{sub 4}, and G{sub 2}) over associative commutative rings with 1/2 (with 1/2 and 1/3 in the case of G{sub 2}) have unique addition. As a corollary of this theorem, we note the uniqueness of addition in semisimple Lie algebras of Chevalley type over fields of characteristic ≠ 2 (≠ 2, 3 in the case of G{sub 2}).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Quantization of the Sobolev space of half-differentiable functions

A quantization of the Sobolev space V=H{sub 0}{sup 1/2}(S{sup 1},R) of half- differentiable functions on the circle, which is closely connected with string theory, is constructed. The group QS(S{sup 1}) of quasisymmetric circle homeomorphisms acts on V by reparametrizations, but this action is not smooth. Nevertheless, a quantum infinitesimal action of QS(S{sup 1}) on V can be defined, which enables one to construct a quantum algebra of observables which is associated with the system (V,QS(S{sup 1})). Bibliography: 7 titles. (paper)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A fast and accurate modeling approach for water and steam thermodynamics with practical applications in district heating system simulation

In U.S. district heating (DH) systems, steam is the most common heat transport medium. Industry demand for new advanced modeling capabilities of complete steam DH systems is increasing; however, the existing models for water/steam thermodynamics are too slow for large system simulations because of computationally expensive algebraic loops that require the solution to nonlinear systems of equations. For practical applications, this work presents a novel split-medium approach that implements numerically efficient liquid water models alongside various water/steam models, breaking costly algebraic loops by decoupling mass and energy balance equations. New component models for steam DH systems are also presented. We implemented the models in the equation based Modelica language and evaluated accuracy and computing speed across multiple scales: from fundamental thermodynamic properties to complete districts featuring 10 to 200 buildings. Compared to district models with the IF97 water/steam model and equipment models from the Modelica Standard Library, the new implementation improves the scaling rate for large districts from cubic to quadratic with negligible compromise to accuracy. Additionally, for an annual simulation with 180 buildings, this translates to a computing time reduction from 33 to 1-1.5 h. These results are critically important for industry practitioners to simulate steam DH systems at large scales.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

Sufficient Condition for Consistency of Infinite Systems

Based on the theory of double series, we obtain a sufficient condition for the existence of strictly partial solutions to infinite systems of linear algebraic equations. We prove series expansion theorems for infinite determinants of Gaussian infinite matrices. Examples of application of the proposed condition are given.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Invariants of the Cox rings of double flag varieties of low complexity for exceptional groups

We find the algebras of unipotent invariants of the Cox rings for all double flag varieties of complexity 0 and 1 for the exceptional simple algebraic groups; namely, we obtain presentations of these algebras in terms of generators and relations. It is well known that such an algebra is free in the case of complexity 0. In this paper, we show that, in the case of complexity 1, the algebra in question is either a free algebra or a hypersurface. A similar result for classical groups was previously obtained by the author. Knowing the structure of this algebra enables one to decompose tensor products of some irreducible representations effectively into irreducible summands and to obtain some branching rules. Bibliography: 10 titles. (paper)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Bootstrap AMG for spectral clustering

Graph Laplacian is a popular tool for analyzing graphs, particularly in graph partitioning and clustering. Given a notion of similarity (via an adjacency matrix), graph clustering refers to identifying different groups such that vertices in the same group are more similar compared to vertices across different groups. Data clustering can be reformulated in terms of a graph clustering problem when the given set of data is represented as a graph, also known as similarity graph. In this context, eigenvectors of the graph Laplacian are often used to obtain a new geometric representation of the original data set that generally enhances cluster properties and improves cluster detection. Here, we apply a bootstrap algebraic multigrid (AMG) method that constructs a set of vectors associated with the graph Laplacian. These vectors, referred to as algebraically smooth ones, span a low-dimensional Euclidean space, which we use to represent the data, enabling cluster detection both in synthetic and in realistic well-clustered graphs. We show that, in the case of a good quality bootstrap AMG, the computed smooth vectors employed in the construction of the final AMG operator, which by construction is spectrally equivalent to the originally given graph Laplacian, accurately approximate the space in the lower portion of the spectrum of the preconditioned operator. Thus, our approach can be viewed as a spectral clustering technique associated with the generalized spectral problem (Laplace operator versus the final AMG operator), and hence, it can be seen as an extension of the classical spectral clustering that employs a standard eigenvalue problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Optimal matrix approximants in structural identification

Problems of model correlation and system identification are central in the design, analysis, and control of large space structures. Of the numerous methods that have been proposed, many are based on finding minimal adjustments to a model matrix sufficient to introduce some desirable quality into that matrix. In this work, several of these methods are reviewed, placed in a modern framework, and linked to other previously known ideas in computational linear algebra and optimization. This new framework provides a point of departure for a number of new methods which are introduced here. Significant among these is a method for stiffness matrix adjustment which preserves the sparsity pattern of an original matrix, requires comparatively modest computational resources, and allows robust handling of noisy modal data. Numerical examples are included to illustrate the methods presented herein.

Beattie, C. A.↗
DOE OSTI2022

Topological field theory with Haagerup symmetry

Here, we construct a (1 + 1)d topological field theory (TFT) whose topological defect lines (TDLs) realize the transparent Haagerup $\mathscr{H}$ 3 fusion category. This TFT has six vacua, and each of the three non-invertible simple TDLs hosts three defect operators, giving rise to a total of 15 point-like operators. The TFT data, including the three-point coefficients and lasso diagrams, are determined by solving all the sphere four-point crossing equations and torus one-point modular invariance equations. We further verify that the Cardy states furnish a non-negative integer matrix representation under TDL fusion. While many of the constraints we derive are not limited to this particular TFT with six vacua, we leave open the construction of TFTs with two or four vacua. Finally, TFTs realizing the Haagerup $\mathscr{H}$ 1 and $\mathscr{H}$ 2 fusion categories can be obtained by gauging algebra objects. This article makes a modest offering in our pursuit of exotica and the quest for their eventual conformity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

On Volterra quadratic stochastic operators with continual state space

Let (X,F) be a measurable space, and S(X,F) be the set of all probability measures on (X,F) where X is a state space and F is σ - algebraon X. We consider a nonlinear transformation (quadratic stochastic operator) defined by (Vλ)(A) = ∫{sub X}∫{sub X}P(x,y,A)dλ(x)dλ(y), where P(x, y, A) is regarded as a function of two variables x and y with fixed A ∈ F . A quadratic stochastic operator V is called a regular, if for any initial measure the strong limit lim{sub n→∞} V{sup n }(λ) is exists. In this paper, we construct a family of quadratic stochastic operators defined on the segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

The phase topology of a special case of Goryachev integrability in rigid body dynamics

The phase topology of a special case of Goryachev integrability in the problem of motion of a rigid body in a fluid is investigated using the method of Boolean functions, which was developed by Kharlamov for algebraically separated systems. The bifurcation diagram of the moment map is found and the Fomenko invariant, which classifies the systems up to rough Liouville equivalence, is specified. Bibliography: 15 titles. (paper)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

On centres of relatively free associative algebras with a Lie nilpotency identity

We study central polynomials of a relatively free Lie nilpotent algebra F{sup (n)} of degree n. We prove a product theorem, which generalizes the well-known results of Latyshev and Volichenko. We construct generalized Hall polynomials, by using which we prove that the core centre of the algebra F{sup (n)} is nontrivial for any n⩾5. We obtain a number of special results when n=5 and 6. Bibliography: 27 titles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

R-matrix and Mickelsson algebras for orthosymplectic quantum groups

Let g be a complex orthogonal or symplectic Lie algebra and g′ ⊂ g the Lie subalgebra of rank rk g′ = rk g − 1 of the same type. We give an explicit construction of generators of the Mickelsson algebra Z{sub q}(g, g′) in terms of Chevalley generators via the R-matrix of U{sub q}(g)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗