Search NASA⌕ Search

SEARCH · Search NASA

Results for “Primitive matrix”

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.

15 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Aggregation of Leslie matrix models with application to ten diverse animal species

Some grouping is necessary when constructing a Leslie matrix model because it involves discretizing a continuous process of births and deaths. Here, the level of grouping is determined by the number of age classes and frequency of sampling. It is largely unknown what is lost or gained by using fewer age classes, and I address this question using aggregation theory. I derive an aggregator for a Leslie matrix model using weighted least squares, determine what properties an aggregated matrix inherits from the original matrix, evaluate aggregation error, and measure the influence of aggregation on asymptotic and transient behaviors. To gauge transient dynamics, I employ reactivity of the standardized Leslie matrix. I apply the aggregator to 10 Leslie models developed for animal populations drawn from a diverse set of species. Several properties are inherited by the aggregated matrix: (a) it is a Leslie matrix; (b) it is irreducible whenever the original matrix is irreducible; (c) it is primitive whenever the original matrix is primitive; and (d) its stable population growth rate and stable age distribution are consistent with those of the original matrix if the least squares weights are equal to the original stable age distribution. In the application, depending on the population modeled, when the least squares weights do not follow the stable age distribution, the stable population growth rate of the aggregated matrix may or may not be approximately consistent with that of the original matrix. Transient behavior is lost with high aggregation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

On the convergence of the fixed point method for solving neutron transport alpha eigenvalue problems

It was shown that the Fixed Point Method (also known as the Rayleigh Quotient Method) is several times faster than the Critical Search Method for solving neutron transport alpha eigenvalue problems. It was also shown that the Fixed Point Method is able to determine the alpha eigenvalues of sub-critical systems that are beyond the reach of the Critical Search Method. Despite these significant advances, the Fixed Point Method remains an unproven algorithm. Here, this report provides a proof.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Adapting Secure MultiParty Computation to Support Machine Learning in Radio Frequency Sensor Networks

In this project we developed and validated algorithms for privacy-preserving linear regression using a new variant of Secure Multiparty Computation (MPC) we call "Hybrid MPC" (hMPC). Our variant is intended to support low-power, unreliable networks of sensors with low-communication, fault-tolerant algorithms. In hMPC we do not share training data, even via secret sharing. Thus, agents are responsible for protecting their own local data. Only the machine learning (ML) model is protected with information-theoretic security guarantees against honest-but-curious agents. There are three primary advantages to this approach: (1) after setup, hMPC supports a communication-efficient matrix multiplication primitive, (2) organizations prevented by policy or technology from sharing any of their data can participate as agents in hMPC, and (3) large numbers of low-power agents can participate in hMPC. We have also created an open-source software library named "Cicada" to support hMPC applications with fault-tolerance. The fault-tolerance is important in our applications because the agents are vulnerable to failure or capture. We have demonstrated this capability at Sandia's Autonomy New Mexico laboratory through a simple machine-learning exercise with Raspberry Pi devices capturing and classifying images while flying on four drones.

42 ENGINEERING↗
DOE OSTI2024

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗
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 OSTI2021

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Discontinuous Galerkin discretization for quantum simulation of chemistry

All-electron electronic structure methods based on the linear combination of atomic orbitals method with Gaussian basis set discretization offer a well established, compact representation that forms much of the foundation of modern correlated quantum chemistry calculations—on both classical and quantum computers. Despite their ability to describe essential physics with relatively few basis functions, these representations can suffer from a quartic growth of the number of integrals. Recent results have shown that, for some quantum and classical algorithms, moving to representations with diagonal two-body operators can result in dramatically lower asymptotic costs, even if the number of functions required increases significantly. We introduce a way to interpolate between the two regimes in a systematic and controllable manner, such that the number of functions is minimized while maintaining a block-diagonal structure of the two-body operator and desirable properties of an original, primitive basis. Techniques are analyzed for leveraging the structure of this new representation on quantum computers. Empirical results for hydrogen chains suggest a scaling improvement from O(N 4.5 ) in molecular orbital representations to O(N 2.6 ) in our representation for quantum evolution in a fault-tolerant setting, and exhibit a constant factor crossover at 15 to 20 atoms. Moreover, we test these methods using modern density matrix renormalization group methods classically, and achieve excellent accuracy with respect to the complete basis set limit with a speedup of 1–2 orders of magnitude with respect to using the primitive or Gaussian basis sets alone. These results suggest our representation provides significant cost reductions while maintaining accuracy relative to molecular orbital or strictly diagonal approaches for modest-sized systems in both classical and quantum computation for correlated systems.

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

Lattice realizations of topological defects in the critical (1+1)-d three-state Potts model

Topological/perfectly-transmissive defects play a fundamental role in the analysis of the symmetries of two dimensional conformal field theories (CFTs). In the present work, spin chain regularizations for these defects are proposed and analyzed in the case of the three-state Potts CFT. In particular, lattice versions for all the primitive defects are presented, with the remaining defects obtained from the fusion of the primitive ones. The defects are obtained by introducing modified interactions around two given sites of an otherwise homogeneous spin chain with periodic boundary condition. The various primitive defects are topological on the lattice except for one, which is topological only in the scaling limit. The lattice models are analyzed using a combination of exact diagonalization and density matrix renormalization group techniques. Low-lying energy spectra for different defect Hamiltonians as well as entanglement entropy of blocks located symmetrically around the defects are computed. The latter provides a convenient way to compute the g-function which characterizes various defects. Finally, the eigenvalues of the line operators in the “crossed channel” and fusion of different defect lines are also analyzed. The results are all in agreement with expectations from conformal field theory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Search for meteoritic GEMS II: Comparison of inclusions in amorphous silicates from the Paris chondrite and from anhydrous chondritic interplanetary dust particles

Amorphous silicates containing abundant nano-inclusions have been reported in the Paris CM chondrite (Leroux et al., 2015). They have chemical and morphological similarities to glass with embedded metal and sulfides (GEMS) found in interplanetary dust particles (IDPs) and micrometeorites believed to originate from comets. We used scanning transmission electron microscopy (STEM) with energy-dispersive X-ray spectroscopy (EDS) and nanodiffraction to study the chemistry and mineralogy of these inclusions in order to understand the origin of the GEMS-like material in Paris and its possible relationships to other materials found in primitive chondritic materials including IDP GEMS. EDS and diffraction analyses indicate compositional and mineralogical differences between the nanophase inclusions in cometary GEMS and Paris GEMS-like material. Metal inclusions are notably absent within Paris amorphous silicate. Ni-rich sulfides, including pentlandite, are common in even the least altered matrix material of Paris, while they are absent in GEMS-bearing IDPs and Ultracarbonaceous Antarctic Micrometeorites (UCAMMs). From examination of the inclusions, we cannot yet confirm or refute the possibility that GEMS-like material in Paris is related to cometary GEMS. The distinct compositions and mineralogy of the Paris material may be due to aqueous alteration of cometary GEMS precursors, but they may also denote an independent origin for meteoritic GEMS-like assemblages.

58 GEOSCIENCES↗
DOE OSTI2020

Exponential time differencing for the tracer equations appearing in primitive equation ocean models

The tracer equations are part of the primitive equations used in ocean modeling and describe the transport of tracers, such as temperature, salinity or chemicals, in the ocean. Depending on the number of tracers considered, several equations may be added to and coupled to the dynamics system. In many relevant situations, the time-step requirements of explicit methods imposed by the transport and mixing in the vertical direction are more restrictive than those for the horizontal, and this may cause the need to use very small time steps if a fully explicit method is employed. To overcome this issue, we propose an exponential time differencing (ETD) solver where the vertical terms (transport and diffusion) are treated with a matrix exponential, whereas the horizontal terms are dealt with in an explicit way. In this work, we investigate numerically the computational speed-ups that can be obtained over other semi-implicit methods, and we analyze the advantages of the method in the case of multiple tracers.

42 ENGINEERING↗
DOE OSTI2022

Real-space representation of the quasiparticle self-consistent GW self-energy and its application to defect calculations

The quasiparticle self-consistent (QS) GW (G for Green's function, W for screened Coulomb interaction) approach incorporates the corrections of the quasiparticle energies from their Kohn-Sham density functional theory (DFT) eigenvalues by means of an energy-independent and Hermitian self-energy matrix usually given in the basis set of the DFT eigenstates. By expanding these into an atom-centered basis set (specifically here the linearized muffin-tin orbitals) a real space representation of the self-energy corrections becomes possible. In this work, We show that this representation is relatively short-ranged. This offers opportunities to construct the self-energy of a complex system from parts of the system by a cut-and-paste method. Specifically for a point defect, represented in a large supercell, the self-energy can be constructed from those of the host and a smaller defect-containing cell. The self-energy of the periodic host can be constructed simply from a GW calculation for the primitive cell. We show for the case of the As Ga in GaAs that the defect part can already be well represented by a minimal eight-atom cell and allows us to construct the self-energy for a 64-atom cell in good agreement with direct QSGW calculations for the large cell. Using this approach to an even larger 216-atom cell shows the defect band approaches an isolated defect level. The calculations also allow us to identify a second defect band which appears as a resonance near the conduction band minimum. The results on the extracted defect levels agree well with Green's function calculations for an isolated defect and with experimental data.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Primitive to conventional geometry projection for efficient phonon transport calculations

Abstract The primitive Wigner-Seitz cell and corresponding first Brillouin zone (FBZ) are typically used in calculations of lattice vibrational and transport properties as they contain the smallest number of degrees of freedom and thus have the cheapest computational cost. However, in complex materials, the FBZ can take on irregular shapes where lattice symmetries are not apparent. Thus, conventional cells (with more atoms and regular shapes) are often used to describe materials, though dynamical and transport calculations are more expensive. Here we discuss an efficient anharmonic lattice dynamic method that maps conventional cell dynamics to primitive cell dynamics based on translational symmetries. Such symmetries have not been utilized in typical lattice dynamical calculations. This leads to phase interference conditions that act like conserved quantum numbers and a conservation rule for phonon scattering that is hidden in conventional dynamics which significantly reduces the computational cost. We demonstrate this method for phonon transport in a variety of materials with inputs from first-principles calculations and attribute its efficiency to reduced scattering phase space and fewer summations in scattering matrix element calculations.

36 MATERIALS SCIENCE↗
DOE OSTI2020

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Triple oxygen and hydrogen stable isotope composition of hydroxyl water in Orgueil (CI-type) and Tagish Lake (C2-type) carbonaceous chondrites

The primitive carbonaceous chondrites are of interest to cosmochemical science because they contain relatively large amounts of ‘water’ (H 2 O and/or OH – ) within phyllosilicate minerals. This water is evidence for the accretion of ices by their parent planetesimals, and thus represents an archive of the isotopic compositions of H 2 O in the protoplanetary environments. Here, in this study, we used thermogravimetry-enabled laser spectroscopy (TGA-IRIS) analyses of the Orgueil and Tagish Lake meteorites to make δ 2 H, δ 18 O, and Δ′ 17 O measurements of the H 2 O and OH – contained in the different hydrous minerals that comprise each meteorite. In Orgueil, we measured mass-weighted averages of OH – in the saponite and serpentine phyllosilicate matrix to be δ 2 H = 192 ‰, δ 18 O = 1.5 ‰, which are unquestionably of extraterrestrial origin with Δ′ 17 O = 1.0 ‰. For Tagish Lake, analogous values of OH– in the saponite and serpentine phyllosilicate matrix are δ 2 H = 704 ‰, δ 18 O = 11.3 ‰, and are similarly unambiguously extraterrestrial with Δ′ 17 O = 0.82 ‰. We estimate that the parent H 2 O involved in aqueous alteration of Orgueil had δ 18 O value ≥ +23 ‰. In Orgueil, we interpret the phyllosilicate petrographic relationships, and the δ 18 O values of OH – in saponite and serpentine to indicate that saponite formed first, at a lower temperature by 35 to 53 °C than serpentine. This suggests that the Orgueil parent body experienced increasing temperature during the phase of active aqueous alteration (prograde) which set the δ 18 O OH values of the serpentine and saponite. In the case of Tagish Lake, serpentine formed at a lower temperature by 32 to 60 °C than saponite, for the simplest case with constant δ 18 O H2O values. If serpentine formed first, followed by saponite formation at 32 to 60 °C °C higher temperature, this suggests that Tagish Lake sample TL1 underwent prograde aqueous alteration as the parent body heated up. We find evidence that the parent H 2 O for Orgueil, Tagish Lake sample TL1, and Murchison (based on data from a previous study) may have had Δ′ 17 O values of >0.64 ‰.

Aqueous alteration↗