Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix 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.

178 records · Page 10
All sourcesNASA NTRSDOE OSTI
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 OSTI2020

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Finite-temperature many-body perturbation theory for electrons: Algebraic recursive definitions, second-quantized derivation, linked-diagram theorem, general-order algorithms, and grand canonical and canonical ensembles

A comprehensive and detailed account is presented for the finite-temperature many-body perturbation theory for electrons that expands in power series all thermodynamic functions on an equal footing. Algebraic recursions in the style of the Rayleigh–Schrödinger perturbation theory are derived for the grand potential, chemical potential, internal energy, and entropy in the grand canonical ensemble and for the Helmholtz energy, internal energy, and entropy in the canonical ensemble, leading to their sum-over-states analytical formulas at any arbitrary order. For the grand canonical ensemble, these sum-over-states formulas are systematically transformed to sum-over-orbitals reduced analytical formulas by the quantum-field-theoretical techniques of normal-ordered second quantization and Feynman diagrams extended to finite temperature. It is found that the perturbation corrections to energies entering the recursions have to be treated as a nondiagonal matrix, whose off-diagonal elements are generally nonzero within a subspace spanned by degenerate Slater determinants. They give rise to a unique set of linked diagrams—renormalization diagrams—whose resolvent lines are displaced upward, which are distinct from the well-known anomalous diagrams of which one or more resolvent lines are erased. A linked-diagram theorem is introduced that proves the size-consistency of the finite-temperature many-body perturbation theory at any order. General-order algorithms implementing the recursions establish the convergence of the perturbation series toward the finite-temperature full-configuration-interaction limit unless the series diverges. As a result, the normal-ordered Hamiltonian at finite temperature sheds light on the relationship between the finite-temperature Hartree–Fock and first-order many-body perturbation theories.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗
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

Spectral deferred correction methods for high-order accuracy in poroelastic problems

In this work, we investigate high-order accuracy in time integration by examining two operator splitting methods for poroelastic problems: the two-pass and the spectral deferred correction (SDC) methods. To enhance the order of accuracy, the two-pass method partitions a coupled operator symmetrically, whereas the SDC method corrects truncation errors by establishing an error equation. These high-order methods are applied to underlying solution strategies, i.e., monolithic, fixed-stress sequential, and undrained sequential methods. We observe that semi-discretized systems from spatial discretization have forms similar to those of index-1 differential algebraic equations (DAEs), causing order reduction against the two-pass method when it is used in conjunction with either the monolithic or sequential method. On the other hand, the SDC in conjunction with the monolithic method exhibits the desired second-order accuracy in poroelastic problems while increasing the order of accuracy for index-1 DAEs. However, the SDC in conjunction with either of the two sequential methods does not achieve the desired order of accuracy, and maintains first order because the flow equation for poroelasticity has an additional approximation associated with the volumetric strain rate term, which does not yield exactly the same forms as those of conventional DAEs. Thus, the monolithic SDC method can achieve higher-order accuracy, but may require higher computational costs because it involves solving matrix systems larger than those for the sequential methods.

02 PETROLEUM↗
DOE OSTI2022

Closures for multicomponent reacting flows based on dispersion analysis

This work presents algebraic closure models associated with advective transport and nonlinear reactions in a Reynolds-averaged Navier-Stokes context for a system of species subject to binary reactions and transport by advection and diffusion. Expanding upon analysis originally developed for non-reactive transport in the context of Taylor dispersion of scalars, this work extends the modified gradient diffusion model explicated by Peters [N. Peters, Turbulent Combustion, Cambridge Monographs on Mechanics (Cambridge University Press, Cambridge, 2000)] and based on work by Corrsin [S. Corrsin, The reactant concentration spectrum in turbulent mixing with a first-order reaction, J. Fluid Mech. 11, 407 (1961)] beyond single-component transport phenomena and involving nonlinear reactions. The presented model forms, from this weakly nonlinear extension of the original dispersion theory, lead to an analytic expression for the eddy diffusivity matrix that explicitly captures the influence of the reaction kinetics on the closure operators. Furthermore, we demonstrate that the derived model form directly translates between flow topologies through a priori and a posteriori testing of a binary species system subject to homogeneous isotropic turbulence. Using two- and three-dimensional direct numerical simulations involving laminar and turbulent flows, it is shown that this framework improves prediction of mean quantities compared to previous results. Lastly, the presented model form, collapses to the earlier gradient diffusion and its modified version derived by Corrsin in the limits of nonreactive species and linear reactions, respectively.

42 ENGINEERING↗
DOE OSTI2024

Hybrid analysis of radiative corrections to neutron decay with current algebra and effective field theory

We introduce a useful framework for high-precision studies of the neutron beta decay by merging the current algebra description and the fixed-order effective field theory calculation of the electroweak radiative corrections to the neutron axial form factor. We discuss the advantages of this hybrid method and show that it only requires a minimal amount of lattice QCD inputs to achieve a 10 –4 theory accuracy for the Standard Model prediction of the neutron lifetime and the axial-to-vector coupling ratio λ, both important to the search for physics beyond the Standard Model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Two-fermion negativity and confinement in the Schwinger model

We consider the fermionic (logarithmic) negativity between two fermionic modes in the Schwinger model. Recent results pointed out that fermionic systems can exhibit stronger entanglement than bosonic systems, exhibiting a negativity that decays only algebraically. The Schwinger model is described by fermionic excitations at short distances, while its asymptotic spectrum is the one of a bosonic theory. We show that the two-mode negativity detects this confining, fermion-to-boson transition, shifting from an algebraic decay to an exponential decay at distances of the order of the de Broglie wavelength of the first excited state. We derive analytical expressions in the massless Schwinger model and confront them with tensor network simulations. We also perform tensor network simulations in the massive model, which is not solvable analytically, and close to the Ising quantum critical point of the Schwinger model, where we show that the negativity behaves as its bosonic counterpart. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A parallel strategy for density functional theory computations on accelerated nodes

Using the Löwdin orthonormalization of tall-skinny matrices as a proxy-app for wavefunction-based Density Functional Theory solvers, we investigate a distributed memory parallel strategy focusing on Graphics Processing Unit (GPU)-accelerated nodes as available on some of the top ranked supercomputers at the present time. Here we present numerical results in the strong limit regime, as it is particularly relevant for First-Principles Molecular Dynamics. We also examine how matrix product-based iterative solvers provide a competitive alternative to dense eigensolvers on GPUs, allowing to push the strong scaling limit of these computations to a larger number of distributed tasks. Our strategy, which relies on replicated Gram matrices and efficient collective communications using the NCCL library, leads to a time-to-solution under 0.5 s for the Löwdin orthonormalization of a tall-skinny matrix of 3000 columns on Summit at Oak Ridge Leadership Facility (OLCF). Given the similarity in computational operations between one iteration of a DFT solver and this proxy-app, this shows the possibility of solving accurately the DFT equations well under a minute for 3000 electronic wave functions, and thus perform First-Principles molecular dynamics of physical systems much larger than traditionally solved on CPU systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

ROM-Based Surrogate Systems Modeling of EBR-II

We report the System Analysis Module (SAM), developed and maintained by Argonne National Laboratory, is designed to provide whole-plant transient safety analysis capabilities for a number of advanced non-light water reactors, including sodium-cooled fast reactor (SFR), lead-cooled fast reactor (LFR), and molten salt reactor (MSR)/fluoride-salt-cooled high-temperature reactor (FHR) designs. SAM is primarily constructed as a systems-level analysis tool, with the potential to incorporate reduced order models from three-dimensional computational fluid dynamics (CFD) simulations to improve characterization of complex, multidimensional physics. It is recognized that the computational expense associated with CFD can be intractable for various engineering analyses, such as uncertainty quantification, inference, and design optimization. This paper explores the reducibility of a SAM model using recent advances in randomized linear algebra techniques, which attempt to find recurring patterns in the various realizations generated by a model after randomly perturbing all its input parameters. The reduction is described in terms of fewer degrees of freedom (DOFs), referred to as the active DOFs, for the model variables such as input model parameters and model responses. The results indicate that there is significant room for additional reduction that may be leveraged for additional computational gains when employing SAM for engineering-intensive analyses that require repeated model executions. Different from physics-based reduction approaches, the proposed approach allows one to estimate upper bounds on the reduction errors, which are rigorously developed in this work. Finally, different methods for surrogate model construction, such as regression and neural network-based training, are employed to correlate the input and output active DOFs, which are related back to the original variables using matrix-based linear transformations.

42 ENGINEERING↗
DOE OSTI2024

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A review on recent machine learning applications for imaging mass spectrometry studies

Imaging mass spectrometry (IMS) is a powerful analytical technique widely used in biology, chemistry, and materials science fields that continue to expand. IMS provides a qualitative compositional analysis and spatial mapping with high chemical specificity. The spatial mapping information can be 2D or 3D depending on the analysis technique employed. Due to the combination of complex mass spectra coupled with spatial information, large high-dimensional datasets (hyperspectral) are often produced. Therefore, the use of automated computational methods for an exploratory analysis is highly beneficial. The fast-paced development of artificial intelligence (AI) and machine learning (ML) tools has received significant attention in recent years. These tools, in principle, can enable the unification of data collection and analysis into a single pipeline to make sampling and analysis decisions on the go. There are various ML approaches that have been applied to IMS data over the last decade. Here, in this review, we discuss recent examples of the common unsupervised (principal component analysis, non-negative matrix factorization, k-means clustering, uniform manifold approximation and projection), supervised (random forest, logistic regression, XGboost, support vector machine), and other methods applied to various IMS datasets in the past five years. The information from this review will be useful for specialists from both IMS and ML fields since it summarizes current and representative studies of computational ML-based exploratory methods for IMS.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Duality and form factors in the thermally deformed two-dimensional tricritical Ising model

The thermal deformation of the critical point action of the 2D tricritical Ising model gives rise to an exact scattering theory with seven massive excitations based on the exceptional E_7 E 7 Lie algebra. The high and low temperature phases of this model are related by duality. This duality guarantees that the leading and sub-leading magnetisation operators, \sigma(x) σ ( x ) and \sigma'(x) σ ′ ( x ) , in either phase are accompanied by associated disorder operators, \mu(x) μ ( x ) and \mu'(x) μ ′ ( x ) . Working specifically in the high temperature phase, we write down the sets of bootstrap equations for these four operators. For \sigma(x) σ ( x ) and \sigma'(x) σ ′ ( x ) , the equations are identical in form and are parameterised by the values of the one-particle form factors of the two lightest \mathbb{Z}_2 ℤ 2 odd particles. Similarly, the equations for \mu(x) μ ( x ) and \mu'(x) μ ′ ( x ) have identical form and are parameterised by two elementary form factors. Using the clustering property, we show that these four sets of solutions are eventually not independent; instead, the parameters of the solutions for \sigma(x)/\sigma'(x) σ ( x ) / σ ′ ( x ) are fixed in terms of those for \mu(x)/\mu'(x) μ ( x ) / μ ′ ( x ) . We use the truncated conformal space approach to confirm numerically the derived expressions of the matrix elements as well as the validity of the \Delta Δ -sum rule as applied to the off-critical correlators. We employ the derived form factors of the order and disorder operators to compute the exact dynamical structure factors of the theory, a set of quantities with a rich spectroscopy which may be directly tested in future inelastic neutron or Raman scattering experiments.

Cortes Cubero, Axel↗
DOE OSTI2020

Machine learning Frenkel Hamiltonian parameters to accelerate simulations of exciton dynamics

In this manuscript, we develop multiple machine learning (ML) models to accelerate a scheme for parameterizing site-based models of exciton dynamics from all-atom configurations of condensed phase sexithiophene systems. This scheme encodes the details of a system’s specific molecular morphology in the correlated distributions of model parameters through the analysis of many single-molecule excited-state electronic-structure calculations. These calculations yield excitation energies for each molecule in the system and the network of pair-wise intermolecular electronic couplings. In this work, we demonstrate that the excitation energies can be accurately predicted using a kernel ridge regression (KRR) model with Coulomb matrix featurization. We present two ML models for predicting intermolecular couplings. The first one utilizes a deep neural network and bi-molecular featurization to predict the coupling directly, which we find to perform poorly. The second one utilizes a KRR model to predict unimolecular transition densities, which can subsequently be analyzed to compute the coupling. We find that the latter approach performs excellently, indicating that an effective, generalizable strategy for predicting simple bimolecular properties is through the indirect application of ML to predict higher-order unimolecular properties. Such an approach necessitates a much smaller feature space and can incorporate the insight of well-established molecular physics.

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

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗