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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

AMG Preconditioners based on parallel hybrid coarsening and multi-objective graph matching

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package \texttt{PSCToolkit} to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$. We compute the matching by a parallel $2/3-\varepsilon$-approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

D'Ambra, Pasqua↗
DOE OSTI2018

Abstract Algebra Basics

To understand the mathematics behind Uncertainty Quantification (UQ), one first needs to become familiar with orthogonal polynomials, which in turn requires a grasp of abstract algebra. This note covers some of the basics of abstract algebra.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗
DOE OSTI2022

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗
DOE OSTI2016

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Unitarity methods in AdS/CFT

We develop a systematic unitarity method for loop-level AdS scattering amplitudes, dual to non-planar CFT correlators, from both bulk and boundary perspectives. We identify cut operators acting on bulk amplitudes that put virtual lines on shell, and show how the conformal partial wave decomposition of the amplitudes may be efficiently computed by gluing lower-loop amplitudes. A central role is played by the double discontinuity of the amplitude, which has a direct relation to these cuts. We then exhibit a precise, intuitive map between the diagrammatic approach in the bulk using cutting and gluing, and the algebraic, holographic unitarity method of [1] that constructs the non-planar correlator from planar CFT data. Our analysis focuses mostly on four-point, one-loop diagrams — we compute cuts of the scalar bubble, triangle and box, as well as some one-particle reducible diagrams — in addition to the five-point tree and four-point double-ladder. Analogies with S-matrix unitarity methods are drawn throughout.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

A high-performance implementation of atomistic spin dynamics simulations on x86 CPUs

Atomistic spin dynamics simulations provide valuable information about the energy spectrum of magnetic materials in different phases, allowing one to identify instabilities and the nature of their excitations. However, the time cost of evaluating the dynamical correlation function S(q,t) increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. In this work, here, we propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel, which results in further performance improvements of 44\% - 71\% on several relatively large lattice sizes when compared to the implementation that uses the GEMM subroutine in OpenBLAS, which is the state-of-the-art open source library for Basic Linear Algebra Subroutine (BLAS).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Software for the frontiers of quantum chemistry: An overview of developments in the Q-Chem 5 package

This article summarizes technical advances contained in the fifth major release of the Q-Chem quantum chemistry program package, covering developments since 2015. A comprehensive library of exchange-correlation functionals, along with a suite of correlated many-body methods, continues to be a hallmark of the Q-Chem software. The many-body methods include novel variants of both coupled-cluster and configuration-interaction approaches along with methods based on the algebraic diagrammatic construction and variational reduced density-matrix methods. Methods highlighted in Q-Chem 5 include a suite of tools for modeling core-level spectroscopy, methods for describing metastable resonances, methods for computing vibronic spectra, the nuclear-electronic orbital method, and several different energy decomposition analysis techniques. High-performance capabilities including multithreaded parallelism and support for calculations on graphics processing units are described. Q-Chem boasts a community of well over 100 active academic developers, and the continuing evolution of the software is supported by an "open teamware" model and an increasingly modular design.

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

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

OpenMP Target Task: Tasking and Target Offloading on Heterogeneous Systems

This work evaluated the use of OpenMP tasking with target GPU offloading as a potential solution for programming productivity and performance on heterogeneous systems. Also, it is proposed a new OpenMP specification to make the implementation of heterogeneous codes simpler by using OpenMP target task, which integrates both OpenMP tasking and target GPU offloading in a single OpenMP pragma. As a test case, the authors used one of the most popular and widely used Basic Linear Algebra Subprogram Level-3 routines: triangular solver (TRSM). To benefit from the heterogeneity of the current high-performance computing systems, the authors propose a different parallelization of the algorithm by using a nonuniform decomposition of the problem. This work used target GPU offloading inside OpenMP tasks to address the heterogeneity found in the hardware. This new approach can outperform the state-of-the-art algorithms, which use a uniform decomposition of the data, on both the CPU-only and hybrid CPU-GPU systems, reaching speedups of up to one order of magnitude. The performance that this approach achieves is faster than the IBM ESSL math library on CPU and competitive relative to a highly optimized heterogeneous CUDA version. One node of Oak Ridge National Laboratory’s supercomputer, Summit, was used for performance analysis.

Valero Lara, Pedro↗
DOE OSTI2015

Excitonic couplings between molecular crystal pairs by a multistate approximation

In this paper, we present a diabatization scheme to compute the excitonic couplings between an arbitrary number of states in molecular pairs. The method is based on an algebraic procedure to find the diabatic states with a desired property as close as possible to that of some reference states. In common with other diabatization schemes, this method captures the physics of the important short-range contributions (exchange, overlap, and charge-transfer mediated terms) but it becomes particularly suitable in presence of more than two states of interest. The method is formulated to be usable with any level of electronic structure calculations and to diabatize different types of states by selecting different molecular properties. These features make the diabatization scheme presented here especially appropriate in the context of organic crystals, where several excitons localized on the same molecular pair may be found close in energy. In this paper, the method is validated on the tetracene crystal dimer, a well characterized case where the charge transfer (CT) states are closer in energy to the Frenkel excitons (FE). The test system was studied as a function of an external electric field (to explore the effect of changing the relative energy of the CT excited state) and as a function of different intermolecular distances (to probe the strength of the coupling between FE and CT states). Additionally, we illustrate how the approximation can be used to include the environment polarization effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Kokkos Kernels v. 0.9

Linear Algebra Kernels and Graph Kernels are foundational technologies for scientific simulations. These foundational kernels need to run on several computer platforms that are popular for scientific simulations. KokkosKernels provides an implementation of different kernels that is portable to different architectures.

ECP↗
DOE OSTI2024

Evolution of the SLATE linear algebra library

SLATE (Software for Linear Algebra Targeting Exascale) is a distributed, dense linear algebra library targeting both CPU-only and GPU-accelerated systems, developed over the course of the Exascale Computing Project (ECP). While it began with several documents setting out its initial design, significant design changes occurred throughout its development. In some cases, these were anticipated: an early version used a simple consistency flag that was later replaced with a full-featured consistency protocol. In other cases, performance limitations and software and hardware changes prompted a redesign. Sequential communication tasks were parallelized; host-to-host MPI calls were replaced with GPU device-to-device MPI calls; more advanced algorithms such as Communication Avoiding LU and the Random Butterfly Transform (RBT) were introduced. Early choices that turned out to be cumbersome, error prone, or inflexible have been replaced with simpler, more intuitive, or more flexible designs. Applications have been a driving force, prompting a lighter weight queue class, nonuniform tile sizes, and more flexible MPI process grids. Of paramount importance has been building a portable library that works across several different GPU architectures – AMD, Intel, and NVIDIA – while keeping a clean and maintainable codebase. Here we explore the evolving design choices and their effects, both in terms of performance and software sustainability.

Gates, Mark↗
DOE OSTI2019

Exploring redshift-space distortions in large-scale structure

We explore and compare different ways large-scale structure observables in redshift-space and real space can be connected. These include direct computation in Lagrangian space, moment expansions and two formulations of the streaming model. Here we derive for the first time a Fourier space version of the streaming model, which yields an algebraic relation between the real- and redshift-space power spectra which can be compared to earlier, phenomenological models. By considering the redshift-space 2-point function in both configuration and Fourier space, we show how to generalize the Gaussian streaming model to higher orders in a systematic and computationally tractable way. We present a closed-form solution to the Zeldovich power spectrum in redshift space and use this as a framework for exploring convergence properties of different expansion approaches. While we use the Zeldovich approximation to illustrate these results, much of the formalism and many of the relations we derive hold beyond perturbation theory, and could be used with ingredients measured from N-body simulations or in other areas requiring decomposition of Cartesian tensors times plane waves. Lastly, we finish with a discussion of the redshift-space bispectrum, bias and stochasticity and terms in Lagrangian perturbation theory up to 1-loop order.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Lagrangian conditional statistics and flow topology in edge plasma turbulence

Lagrangian statistics and particle transport in edge plasma turbulence are investigated using the Hasegawa–Wakatani model and its modified version. The latter shows the emergence of pronounced zonal flows. Different values of the adiabaticity parameter are considered. The main goal is to characterize the role of coherent structures, i.e., vortices and zonal flows, and their impact on the Lagrangian statistics of particles. Computationally intensive long time simulations following ensembles of test particles over hundreds of eddy turnover times are considered in statistically stationary turbulent flows. The flow topology is characterized using the Lagrangian Okubo–Weiss criterion in order to split the flow into topologically different domains. In elliptic and hyperbolic regions, the probability density functions (PDFs) of the residence time have self-similar algebraic decaying tails. However, in the intermediate regions, the PDFs exhibit exponentially decaying tails. Topologically conditioned PDFs of the Lagrangian velocity, and acceleration and density fluctuations are likewise computed. The differences between the classical Hasegawa–Wakatani system and its modified version are assessed, and the role of zonal flows is highlighted. Here, the density flux spectrum, which characterizes the contributions of different length scales, is studied, and its inertial scaling is found to be in agreement with predictions based on dimensional arguments. Analyzing the angular change of particle tracers at different time scales, corresponding to coarse grained curvature, completes the study, and these multiscale geometric statistics quantify the directional properties of the particle motion in different flow regimes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Benchmarking near-term quantum devices with the variational quantum eigensolver and the Lipkin-Meshkov-Glick model

The variational quantum eigensolver is a promising algorithm for noisy intermediate scale quantum (NISQ) computation. Verification and validation of NISQ algorithms' performance on NISQ devices is an important task. Here, we consider the exactly diagonalizable Lipkin-Meshkov-Glick (LMG) model as a candidate for benchmarking NISQ computers. We use the Bethe Ansatz to construct eigenstates of the trigonometric LMG model using quantum circuits inspired by the LMG's underlying algebraic structure. We construct circuits with depth $\mathcal{O}$(N) and $\mathcal{O}$(log 2 N) that can prepare any trigonometric LMG eigenstate of N particles. The number of gates required for both circuits is $\mathcal{O}$(N). The energies of the eigenstates can then be measured and compared to the exactly known answers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗