Search NASA⌕ Search

SEARCH · Search NASA

Results for “General Algebraic Systems”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Development, Implementation, and Verification of Partially-Ionized Collisional Multifluid Plasma Models in Drekar

We consider the development of multifluid models for partially ionized multispecies plasmas. The models are composed of a standard set of five-moment fluid equations for each species plus a description of electromagnetics. The most general model considered utilizes a full set of fluid equations for each charge state of each atomic species, plus a set of fluid equations for electrons. The fluid equations are coupled through source terms describing electromagnetic coupling, ionization, recombination, charge exchange, and elastic scattering collisions in the low-density coronal limit. The form of each of these source terms is described in detail, and references for required rate coefficients are identified for a diverse range of atomic species. Initial efforts have been made to extend these models to incorporate some higher-density collisional effects, including ionization potential depression and three- body recombination. Some reductions of the general multifluid model are considered. First, a reduced multifluid model is derived which averages over all of the charge states (including neutrals) of each atomic species in the general multifluid model. The resulting model maintains full consistency with the general multifluid model from which it is derived by leveraging a quasi-steady-state collisional ionization equilibrium assumption to recover the ionization fractions required to make use of the general collision models. Further reductions are briefly considered to derive certain components of a single-fluid magnetohydrodynamics (MHD) model. In this case, a generalized Ohm's law is obtained, and the standard MHD resistivity is expressed in terms of the collisional models used in the general multifluid model. A number of numerical considerations required to obtain robust implementations of these multifluid models are discussed. First, an algebraic flux correction (AFC) stabilization approach for a continuous Galerkin finite element discretization of the multifluid system is described in which the characteristic speeds used in the stabilization of the fluid systems are synchronized across all species in the model. It is demonstrated that this synchronization is crucial in order to obtain a robust discretization of the multifluid system. Additionally, several different formulations are considered for describing the electromagnetics portion of the multifluid system using nodal continuous Galerkin finite element discretizations. The formulations considered include a parabolic divergence cleaning method and an implicit projection method for the traditional curl formulation of Maxwell's equations, a purely- hyperbolic potential-based formulation of Maxwell's equations, and a mixed hyperbolic-elliptic potential-based formulation of Maxwell's equations. Some advantages and disadvantages of each formulation are explored to compare solution robustness and the ease of use of each formulation. Numerical results are presented to demonstrate the accuracy and robustness of various components of our implementation. Analytic solutions for a spatially homogeneous damped plasma oscillation are derived in order to verify the implementation of the source terms for electromagnetic coupling and elastic collisions between fluid species. Ionization balance as a function of electron temperature is evaluated for several atomic species of interest by comparing to steady-state calculations using various sets of ionization and recombination rate coefficients. Several test problems in one and two spatial dimensions are used to demonstrate the accuracy and robustness of the discretization and stabilization approach for the fluid components of the multifluid system. This includes standard test problems for electrostatic and electromagnetic shock tubes in the two-fluid and ideal shock-MHD limits, a cylindrical diocotron instability, and the GEM challenge magnetic reconnection problem. A one-dimensional simplified prototype of an argon gas puff configuration as deployed on Sandia's Z-machine is used as a demonstration to exercise the full range of capabilities associated with the general multifluid model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗
DOE OSTI2026

NCCS High Performance GMRES Mixed Precision

HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.

Kashi, Aditya [Oak Ridge National Laboratory (ORNL↗
DOE OSTI2024

Modeling of Macroscopic Dynamics in Three-Dimensional Plasma Configurations (Final Technical Report)

A numerical simulation-based study to investigate the stability properties of inherently three-dimensional plasma magnetic configurations is presented. These configurations, called stellarators and heliotrons, use external helical coils to provide the twisting magnetic field that is required to confine ionized plasma particles. In contrast to the tokamak configuration, which nominally has the property of axisymmetry, electrical current does not need to be induced in stellarator and heliotron plasma. Experiments have shown that these three-dimensional configurations are remarkably robust to macroscopic instability, even when driven to relatively high levels of plasma pressure. Our understanding of how the plasma is able to withstand macroscopic instability will be enhanced by the work proposed here. The effort will generalize existing numerical modeling capability, and it will apply the new capability to model macroscopic dynamics in these three-dimensional configurations. The development work has been applied to the NIMROD simulation code (https://nimrodteam.org) that was originally based on axisymmetric problem domains. It has been generalized to accommodate the three-dimensional shaping of the plasma volume in stellarators and heliotrons. Its use of equilibrium data has also been generalized, and the implementation allows different numerical representation of the magnetic field. Analysis has been performed to inform the selection of numerical methods, and a method to accelerate the iterative solution of the necessary algebraic systems has been developed and implemented. Verification of the new NIMSTELL code on benchmark problems has also been an important part of the effort.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Fermionic systems for quantum information people

The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity superselection in the fermionic case on the other. We discuss these two fundamental differences extensively, and illustrate these through the Jordan–Wigner representation in a coherent, self-contained, pedagogical way, from the point of view of quantum information theory. Our perspective leads us to develop useful new tools for the treatment of fermionic systems, such as the fermionic (quasi-)tensor product, fermionic canonical embedding, fermionic partial trace, fermionic products of maps and fermionic embeddings of maps. We formulate these by direct, easily applicable formulas, without mode permutations, for arbitrary partitionings of the modes. It is also shown that fermionic reduced states can be calculated by the fermionic partial trace, containing the proper phase factors. We also consider variants of the notions of fermionic mode correlation and entanglement, which can be endowed with the usual, local operation based motivation, if the parity superselection rule is imposed. We also elucidate some other fundamental points, related to joint map extensions, which make the parity superselection inevitable in the description of fermionic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Energetically consistent model reduction for metriplectic systems

The metriplectic formalism is useful for describing complete dynamical systems which conserve energy and produce entropy. This creates challenges for model reduction, as the elimination of high-frequency information will generally not preserve the metriplectic structure which governs long-term stability of the system. Based on proper orthogonal decomposition, a provably convergent metriplectic reduced-order model is formulated which is guaranteed to maintain the algebraic structure necessary for energy conservation and entropy formation. Further, numerical results on benchmark problems show that the proposed method is remarkably stable, leading to improved accuracy over long time scales at a moderate increase in cost over naive methods.

42 ENGINEERING↗
DOE OSTI2024

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

System and method for identifying and comparing code by semantic abstractions

Certain embodiments of the present invention are configured to facilitate analyzing computer code more efficiently. For example, by conducting a first level abstraction (e.g., symbolic interpretation and algebraic simplification) and a second level abstraction (e.g., generalization) of the computer code, the analysis may more accurately account for variations in the code that may occur as a result of register renaming, instruction reordering, choice of instructions, etc. while minimizing the cost of computations required to perform the analysis.

Lakhotia, Arun↗
DOE OSTI2021

Cell-Edge Detection via Selective Cooperation and Generalized Canonical Correlation

Improving the uplink quality of service for users located around the boundaries between cells is a key challenge in cellular systems. Existing approaches relying on power control throttle the rates of cell-center users, while multi-user detection requires accurate channel estimates for the cell-edge users, which is another challenge due to their low received signal-to-noise ratio (SNR). Utilizing the fact that cell-edge user signals are weak but common (received at roughly equal power) at different base stations (BSs), this paper establishes a connection between cell-edge user detection and generalized canonical correlation analysis (GCCA). It puts forth a GCCA-based method that leverages selective BS cooperation to recover the cell-edge user signal subspace even at low SNR. The cell-edge user signals can then be extracted from the resulting mixture via algebraic signal processing techniques. The paper includes theoretical analysis showing why GCCA recovers the correct subspace containing the cell-edge user signals under mild conditions. The proposed method can also identify the number of cell-edge users in the system, i.e., the common subspace dimension. Simulations reveal significant performance improvement relative to various multiuser detection techniques. Cell-edge detection performance is further studied as a function of how many / which BSs are selected, and it is shown that using the closest three BS is always the best choice.

base station cooperation↗
DOE OSTI2020

Evaluation of a nonlinear variational multiscale method for fluid transport problems

Diverse transport problems, especially those based on fluid flow models, are intrinsically multiscale and nonlinear, characteristics that often lead to intricate dynamics such as the development of instabilities and turbulence. Computational simulations that resolve all scales in these problems are often unfeasible, prompting to coarse-grained simulation strategies in which small-scale features are modeled instead of resolved. Variational Multiscale (VMS) methods, and particularly residual-based Large-Eddy Simulation (LES) approaches, have proven effective and robust for the coarse-grained simulation of complex transport problems. VMS methods avoid the assumption of separable nonlinearity and the reliance on empirical small-scale models by using a variational decomposition of scales together with a residual-based approximation of the small-scales. Evaluation of a nonlinear VMS approach, denoted as VMS n , is presented for the coarse-grained simulation of transient-advective-diffusive-reactive (TADR) transport problems arising from fluid flow models. In contrast to classical VMS approaches that neglect the effect of the small scales on the transport operator, VMS n treats the inter-dependence between large- and small-scales upfront. The treatment of inter-scale coupling involves the solution of a local algebraic nonlinear system describing the evolution of the small-scales. The VMS n approach is complemented with two algebraic approximations of the small-scales: one based on the main diagonal of the transport matrices and another that preserves transport fluxes and is suitable for generic TADR systems. The suitability of the VMS n approach for handling general TADR problems and regimes is evaluated with benchmark incompressible, compressible, and magnetohydrodynamic laminar flow problems, the incompressible Taylor-Green vortex flow, the turbulent free jet, and the two-temperature arc in crossflow. Furthermore, simulation results show that VMS n leads to minor improvements in accuracy with respect to the classical VMS for the laminar flow problems, but to significantly greater accuracy for the turbulent flows and the unsteady plasma flow problems, while using the same cohesive numerical formulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Thermal coupled cluster theory for SU(2) systems

Coupled cluster (CC) has established itself as a powerful theory to study correlated quantum many-body systems. Finite-temperature generalizations of CC theory have attracted considerable interest and have been shown to work as nicely as the ground-state theory. However, most of these recent developments address only fermionic or bosonic systems. The distinct structure of the su(2) algebra requires the development of a similar thermal CC theory for spin degrees of freedom. In this paper, we provide a formulation of our thermofield-inspired thermal CC for SU(2) systems. Here, we apply the thermal CC to the Lipkin-Meshkov-Glick system as well as the one-dimensional transverse field Ising model as benchmark applications to highlight the accuracy of thermal CC in the study of finite-temperature phase diagrams in SU(2) systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
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 OSTI2023

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Phase separation and ripening in a viscoelastic gel

The process of phase separation in elastic solids and viscous fluids is of fundamental importance to the stability and function of soft materials. We explore the dynamics of phase separation and domain growth in a viscoelastic material such as a polymer gel. Using analytical theory and Monte Carlo simulations, we report a domain growth regime in which the domain size increases algebraically with a ripening exponent α that depends on the viscoelastic properties of the material. For a prototypical Maxwell material, we obtain α = 1 , which is markedly different from the well-known Ostwald ripening process with α = 1 / 3 . We generalize our theory to systems with arbitrary power-law relaxation behavior and discuss our findings in the context of the long-term stability of materials as well as recent experimental results on phase separation in cross-linked networks and cytoskeleton.

Science & Technology - Other Topics↗
DOE OSTI2023

QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation

The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum system simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, and so on, trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Applications in QASMBench can be launched and verified on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum. For evaluation, we measure the execution fidelity of a subset of QASMBench applications on 12 IBM-Q machines through density matrix state tomography, comprising 25K circuit evaluations. In addition we also compare the fidelity of executions among the IBM-Q machines, the IonQ QPU and the Rigetti Aspen M-1 system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Spacetime quantum mechanics for bosonic and fermionic systems

We provide a Hilbert space approach to quantum mechanics where space and time are treated on an equal footing. Our approach replaces the standard dependence on an external classical time parameter with a spacetime-symmetric algebraic structure, thereby unifying the axioms that traditionally distinguish the treatment of spacelike and timelike separations. Standard quantum evolution can be recovered from timelike correlators, defined by means of a quantum action operator, a quantum version of the action of classical mechanics. The corresponding map also provides an alternative perspective on the path integral formulation that, in the case of fermions, does not require the use of Grassmann variables. In addition, the formalism can be interpreted in terms of generalized quantum states, codifying both the conventional information of a quantum system at a given time and its evolution. We show that these states are solutions to a quantum principle of stationary action grounded in timelike correlations and pseudo-entropies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗
DOE OSTI2025

Almost strong zero modes at finite temperature

Interacting fermionic chains exhibit extended regions of topological degeneracy of their ground states as a result of the presence of Majorana or parafermionic zero modes localized at the edges. In the opposite limit of infinite temperature, the corresponding nonintegrable spin chains, obtained via generalized Jordan-Wigner mapping, are known to host so-called almost strong zero modes, which are long-lived with respect to any bulk excitations. Here we study the fairly unexplored territory that bridges these two extreme cases of zero and infinite temperature. We blend two established techniques for states, the Lanczos series expansion and a tensor network ansatz, uplifting them to the level of operator algebra. This allows us to efficiently simulate large system sizes for arbitrarily long timescales and to extract the temperature-dependent decay rates. We observe that for the Kitaev-Hubbard model, the decay rate of the edge mode depends exponentially on the inverse temperature 𝛽, and on an effective energy scale Δ eff that is greater than the thermodynamic gap of the system Δ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗