Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer algebra system”

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

Downfolding of many-body Hamiltonians using active-space models: Extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms

Here, we discuss the extension of the recently introduced subsystem embedding subalgebra coupled cluster (SES-CC) formalism to unitary CC formalisms. In analogy to the standard single-reference SES-CC formalism, its unitary CC extension allows one to include the dynamical (outside the active space) correlation effects in an SES induced complete active space (CAS) effective Hamiltonian. In contrast to the standard single-reference SES-CC theory, the unitary CC approach results in a Hermitian form of the effective Hamiltonian. Additionally, for the double unitary CC (DUCC) formalism, the corresponding CAS eigenvalue problem provides a rigorous separation of external cluster amplitudes that describe dynamical correlation effects—used to define the effective Hamiltonian—from those corresponding to the internal (inside the active space) excitations that define the components of eigenvectors associated with the energy of the entire system. The proposed formalism can be viewed as an efficient way of downfolding many-electron Hamiltonian to the low-energy model represented by a particular choice of CAS. In principle, this technique can be extended to any type of CAS representing an arbitrary energy window of a quantum system. The Hermitian character of low-dimensional effective Hamiltonians makes them an ideal target for several types of full configuration interaction type eigensolvers. As an example, we also discuss the algebraic form of the perturbative expansions of the effective DUCC Hamiltonians corresponding to composite unitary CC theories and discuss possible algorithms for hybrid classical and quantum computing. Given growing interest in quantum computing, we provide energies for H 2 and Be systems obtained with the quantum phase estimator algorithm available in the Quantum Development Kit for the approximate DUCC Hamiltonians.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Efficient Integration of Algebraic Constraint for Exponential Time Integration

This work is a continuation of a previous project where the high efficiency of exponential integration methods for DRMHD systems was demonstrated. Often algebraic constraints must also be enforced for DRMHD systems of interest. Straightforward application of exponential methods to DRMHD equations with constraints leads to prohibitively computationally expensive methods. In this work, we propose new exponential schemes that allow the constraints to be removed from evaluation of exponential matrix functions which drastically reduces computational complexity by eliminating the need to perform computations enforcing constraints in exponential calculations while still preserving a high order of accuracy and allowing for a large time step even when the problem is stiff. This idea is similar to the W-methods and is achieved by carefully designing a method with the desired order of accuracy, even with an incomplete Jacobian matrix used as an argument of exponential-like functions. The constraints are accounted for by including them in the evaluation of the right-hand-side forcing function of the spatially discretized system. We study performance of the new methods on test problems and outline future research directions that this work opens.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum Spectral Methods for Differential Equations

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ϵ with complexity poly(log(1/ϵ)), no such algorithm was previously known for differential equations with time-dependent coefficients. In this work, we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd, log(1/ϵ)).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Integrability, normal forms, and magnetic axis coordinates

Integrable or near-integrable magnetic fields are prominent in the design of plasma confinement devices. Such a field is characterized by the existence of a singular foliation entirely consisting of invariant submanifolds. A compact regular leaf (a flux surface) of this foliation must be diffeomorphic to the two-torus. In a neighborhood of a flux surface, it is known that the magnetic field admits several exact smooth normal forms in which the field lines are straight. However, these normal forms break down near singular leaves, including elliptic and hyperbolic magnetic axes. In this work, the existence of exact smooth normal forms for integrable magnetic fields near elliptic and hyperbolic magnetic axes is established. In the elliptic case, smooth near-axis Hamada and Boozer coordinates are defined and constructed. Ultimately, these results establish previously conjectured smoothness properties for smooth solutions of the magnetohydrodynamic equilibrium equations. The key arguments are a consequence of a geometric reframing of integrability and magnetic fields: they are presymplectic systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dynamic Catalysis Fundamentals: I. Fast calculation of limit cycles in dynamic catalysis

Dynamic catalysis—the forced oscillation of catalytic reaction coordinate potential energy surfaces (PES)—has recently emerged as a promising method for the acceleration of heterogeneously-catalyzed reactions. Theoretical study of enhancement of rates and supra-equilibrium product yield via dynamic catalysis has, to-date, been severely limited by onerous computational demands of forward integration of stiff, coupled ordinary differential equations (ODEs) that are necessary to quantitatively describe periodic cycling between PESs. Here, we establish a new approach that reduces, by ≳108×, the computational cost of finding the time-averaged rate at dynamic steady state (i.e. the limit cycle for linear and nonlinear systems of kinetic equations). Our developments are motivated by and conceived from physical and mathematical insight drawn from examination of a simple, didactic case study for which closed-form solutions of rate enhancement are derived in explicit terms of periods of oscillation and elementary step rate constants. Generalization of such closed-form solutions to more complex catalytic systems is achieved by introducing a periodic boundary condition requiring the dynamic steady state solution to have the same periodicity as the kinetic oscillations and solving the corresponding differential equations by linear algebra or Newton-Raphson-based approaches. The methodology is well-suited to extension to non-linear systems for which we detail the potential for multiple solutions or solutions with different periodicities. For linear and non-linear systems alike, the acute decrement in computational expense enables rapid optimization of oscillation waveforms and, consequently, accelerates understanding of the key catalyst properties that enable maximization of reaction rates, conversions, and selectivities during dynamic catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Parametric reduced order models for graded lattice structures

Graded lattice structures, characterized by smoothly varying mechanical properties, hold significant promise for optimizing material distribution in advanced engineering applications. However, accurately modeling these structures poses substantial computational challenges due to the continuous geometric variations within their unit cells. Here, to address these challenges, this paper introduces a novel Efficient Reduced Order Model (EROM) that integrates the Matrix Discrete Empirical Interpolation Method (MDEIM) and Discrete Empirical Interpolation Method (DEIM) with polynomial regression to efficiently manage geometric parametrization in lattice structures. Unlike traditional reduced order models (ROMs) that require extensive precomputed libraries for each geometric configuration, our approach enables continuous geometric variations through a flexible algebraic formulation, significantly reducing computational costs while preserving high accuracy. The method constructs projection matrices for individual unit cells that can be efficiently assembled into global systems, leveraging the repetitive nature of lattice structures. Numerical studies demonstrate that our EROM achieves displacement errors below 1% and von Mises stress prediction errors below 4%, coupled with computational speedups exceeding two orders of magnitude compared to full-order simulations. The proposed method's modularity and scalability make it particularly suitable for design optimization and real-time simulation of functionally graded lattice structures, with applications spanning aerospace to biomedical engineering.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Entanglement versus entwinement in symmetric product orbifolds

We study the entanglement entropy of gauged internal degrees of freedom in a two dimensional symmetric product orbifold CFT, whose configurations consist of N strands sewn together into “long” strings, with wavefunctions symmetrized under permutations. In earlier work a related notion of “entwinement” was introduced. Here we treat this system analogously to a system of N identical particles. From an algebraic point of view, we point out that the reduced density matrix on k out of N particles is not associated with a subalgebra of operators, but rather with a linear subspace, which we explain is sufficient. In the orbifold CFT, we compute the entropy of a single strand in states holographically dual in the D1/D5 system to a conical defect geometry or a massless BTZ black hole and find a result identical to entwinement. We also calculate the entropy of two strands in the state that represents the conical defect; the result differs from entwinement. In this case, matching entwinement would require finding a gauge-invariant way to impose continuity across strands.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

LaRIS: Targeting Portability and Productivity for LAPACK Codes on Extreme Heterogeneous Systems by Using IRIS

In keeping with the trend of heterogeneity in high-performance computing, hardware manufacturers and vendors are developing new architectures and associated software stacks (e.g., libraries) to harness the best possible performance from commonly used kernels (e.g., linear algebra kernels). However, kernels tuned for one architecture are not portable to others. Moreover, the coexistence of different architectures in a single node makes orchestration difficult. To address these challenges, we introduce LaRIS, a portable framework for LAPACK functionalities. LaRIS ensures a separation between linear algebra algorithms and vendor-library kernels by using the IRIS run time and IRIS-BLAS library. Such abstraction at the algorithm level makes the implementation completely agnostic to the vendor library and architecture. LaRIS uses the IRIS run time to dynamically select the vendor-library kernel and suitable processor architecture at run time. Through LU factorization, we demonstrate that LaRIS can fully utilize different heterogeneous systems by launching and orchestrating different vendor-library kernels without any change in the source code.

Monil, M. A. H.↗
DOE OSTI2018

Semi-numerical solution to a fractal telegraphic dual-porosity fluid flow model

We present a semi-numerical solution to a fractal telegraphic dual-porosity fluid flow model. It combines Laplace transform and finite difference schemes. The Laplace transform handles the time variable whereas the finite difference method deals with the spatial coordinate. This semi-numerical scheme is not restricted by space discretization and allows the computation of a solution at any time without compromising numerical stability or the mass conservation principle. Our formulation results in a non-analytically-solvable second-order differential equation whose spatial discretization yields a tridiagonal linear algebraic system. Moreover, we describe comparisons between semi-numerical and semi-analytical solutions for particular cases. Results agree well with those from semi-analytic solutions. Furthermore, we expose a parametric analysis from the coupled model in order to show the effects of relevant parameters on pressure profiles and flow rates for the case where neither analytic nor semi-analytic solutions are available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Light-front puzzles

Abstract Light-front formulations of quantum field theories have many advantages for computing electroweak matrix elements of strongly interacting systems and other quantities that are used to study hadronic structure. The theory can be formulated in Hamiltonian form so non-perturbative calculations of the strongly interacting initial and final states are in principle reduced to linear algebra. These states are needed for calculating parton distribution functions and other types of distribution amplitudes that are used to understand the structure of hadrons. Light-front boosts are kinematic transformations so the strongly interacting states can be computed in any frame. This is useful for computing current matrix elements involving electroweak probes where the initial and final hadronic states are in different frames related by the momentum transferred by the probe. Finally in many calculations the vacuum is trivial so the calculations can be formulated in Fock space. The advantages of light front-field theory would not be interesting if the light-front formulation was not equivalent to the covariant or canonical formulations of quantum field theory. Many of the distinguishing properties of light-front quantum field theory are difficult to reconcile with canonical or covariant formulations of quantum field theory. This paper discusses the resolution of some of the apparent inconsistencies in canonical, covariant and light-front formulations of quantum field theory. The puzzles that will be discussed are (1) the problem of inequivalent representations (2) the problem of the trivial vacuum (3) the problem of ill-posed initial value problems (4) the problem of rotational covariance (5) the problem of zero modes and (6) the problem of spontaneously broken symmetries.

Physics↗
DOE OSTI2022

Performance of an Astrophysical Radiation Hydrodynamics Code under Scalable Vector Extension Optimization

We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be well suited. Here, we performed the performance analysis study on Ookami, an Apollo 80 platform utilizing the A64FX processor. We explored several compilers and performance anal-ysis packages and found the code did not perform as expected under scalable vector extension optimization, suggesting that a “deeper dive” into analyzing the code is worthwhile. However, a simple driver program that exercised basic sparse linear algebra routines used by V2D did show significant speedup with the use of the scalable vector extension optimization. We present the initial results from the study which used V2D on a relatively simple test problem that emphasized the repeated solution of sparse linear systems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Asymptotic symmetries of three dimensional gravity and the membrane paradigm

The asymptotic symmetry group of three-dimensional (anti) de Sitter space with Brown-Henneaux boundary conditions is the two dimensional conformal group with central charge c = 3 ℓ/ 2 G . Usually the asymptotic charge algebra is derived using the symplectic structure of the bulk Einstein equations. Here, we derive the asymptotic charge algebra by a different route. First, we formulate the dynamics of the boundary as a 1+1-dimensional dynamical system. Then we realize the boundary equations of motion as a Hamiltonian system on the dual Lie algebra, \( {\mathfrak{g}}^{\ast } \) , of the two-dimensional conformal group. Finally, we use the Lie-Poisson bracket on \( {\mathfrak{g}}^{\ast } \) to compute the asymptotic charge algebra. This streamlines the derivation of the asymptotic charge algebra because the Lie-Poisson bracket on the boundary is significantly simpler than the symplectic structure derived from the bulk Einstein equations. It also clarifies the analogy between the infinite dimensional symmetries of gravity and fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Scalable learning of potentials to predict time-dependent Hartree–Fock dynamics

We propose a framework to learn the time-dependent Hartree–Fock (TDHF) inter-electronic potential of a molecule from its electron density dynamics. Although the entire TDHF Hamiltonian, including the inter-electronic potential, can be computed from first principles, we use this problem as a testbed to develop strategies that can be applied to learn a priori unknown terms that arise in other methods/approaches to quantum dynamics, e.g., emerging problems such as learning exchange–correlation potentials for time-dependent density functional theory. We develop, train, and test three models of the TDHF inter-electronic potential, each parameterized by a four-index tensor of size up to 60 × 60 × 60 × 60. Two of the models preserve Hermitian symmetry, while one model preserves an eight-fold permutation symmetry that implies Hermitian symmetry. Across seven different molecular systems, we find that accounting for the deeper eight-fold symmetry leads to the best-performing model across three metrics: training efficiency, test set predictive power, and direct comparison of true and learned inter-electronic potentials. All three models, when trained on ensembles of field-free trajectories, generate accurate electron dynamics predictions even in a field-on regime that lies outside the training set. To enable our models to scale to large molecular systems, we derive expressions for Jacobian-vector products that enable iterative, matrix-free training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Composing preconditioners for multiphysics PDE systems with applications to Generalized MHD

New patch smoothers or relaxation techniques are developed for solving linear matrix equations coming from systems of discretized partial differential equations (PDEs). One key linear solver challenge for many PDE systems arises when the resulting discretization matrix has a near null space that has a large dimension, which can occur in generalized magnetohydrodynamic (GMHD) systems. Patch-based relaxation is highly effective for problems when the null space can be spanned by a basis of locally supported vectors. The patch-based relaxation methods that we develop can be used either within an algebraic multigrid (AMG) hierarchy or as stand-alone preconditioners. These patch-based relaxation techniques are a form of well-known overlapping Schwarz methods where the computational domain is covered with a series of overlapping sub-domains (or patches). Patch relaxation then corresponds to solving a set of independent linear systems associated with each patch. In the context of GMHD, we also reformulate the underlying discrete representation used to generate a suitable set of matrix equations. In general, deriving a discretization that accurately approximates the curl operator and the Hall term while also producing linear systems with physically meaningful near null space properties can be challenging. Unfortunately, many natural discretization choices lead to a near null space that includes non-physical oscillatory modes and where it is not possible to span the near null space with a minimal set of locally supported basis vectors. Further discretization research is needed to understand the resulting trade-offs between accuracy, stability, and ease in solving the associated linear systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗