Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix approximation”

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 289 records · Page 16

Identifying Entangled Physics Relationships Through Sparse Matrix Decomposition to Inform Plasma Fusion Design

We report a sustainable burn platform through inertial confinement fusion (ICF) has been an ongoing challenge for over 50 years. Mitigating engineering limitations and improving the current design involves an understanding of the complex coupling of physical processes. While sophisticated simulation codes are used to model ICF implosions, these tools contain necessary numerical approximation but miss physical processes that limit predictive capability. Identification of relationships between controllable design inputs to ICF experiments and measurable outcomes (e.g., neutron yield, neutron velocity, areal density) from performed experiments can help guide the future design of experiments and development of simulation codes, to potentially improve the accuracy of the computational models used to simulate ICF experiments. We use sparse matrix decomposition methods to identify clusters of a few related design variables. Sparse principal component analysis (SPCA) identifies groupings that are related to the physical origin of the variables (laser, hohlraum, and capsule). A variable importance analysis finds that in addition to variables highly correlated with neutron yield, such as picket power and laser energy, variables that represent a dramatic change of the ICF design, such as number of pulse steps, are also very important. The obtained sparse components are then used to train a random forest (RF) regression surrogate for predicting total yield. The RF performance on the training and testing data compares with the performance of the RF trained using all the design variables considered. This work is intended to inform design changes in future ICF experiments by augmenting the expert intuition and simulation results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The SparkPix-S ASIC for the sparsified readout of 1 MHz frame-rate X-ray cameras at LCLS-II: pixel design and simulation results

Exploiting the “sparse” nature of the information in XPCS (X-ray Photon Correlation Spectroscopy) and XSVS (Speckle Visibility Spectroscopy) experiments, we present the SparkPix-S, a 3-sides buttable Application Specific Integrated Circuit (ASIC) based on a sparsified readout strategy for large-format hybrid detectors. The SparkPix-S architecture, based on the successful ePix family, will be composed as follows: a front-end 2-D matrix of 384×352 square pixels with 50 µm pitch is arranged to match the dimensions of a PIN Si-sensor matrix; charge readout, signal shaping and amplitude discrimination is performed at pixel-level, by means of a low-power (<18 µW) analog processor, which, in case of an event, negotiates access to an analog bus placed every other column; on the chip periphery (balcony), the information on each bus is digitized by an array of successive approximation analog-to-digital converters (SAR-ADCs) running at 10 Msps; on the digital back-end the global logic will generate the output data stream using low-voltage differential signalling (LVDS). A first prototype of the SparkPix-S, with a reduced matrix size of 96×96 pixels, is currently under production on a 130 nm CMOS technology. Simulated performance results show an equivalent noise charge <60 el. r.m.s. at 1 MHz repetition rate, with a maximum input energy of 60 keV and capability to discriminate charge signals with equivalent energy as low as 900 eV.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

Probing supersymmetric black holes with surface defects

It has long been conjectured that the large N deconfinement phase transition of $\mathcal{N}$ = 4 SU(N) super-Yang-Mills corresponds via AdS/CFT to the Hawking-Page transition in which black holes dominate the thermal ensemble, and quantitative evidence of this has come through the recent matching of the superconformal index of $\frac{1}{16}$-BPS states to the supersymmetric black hole entropy. Here we introduce the half-BPS Gukov-Witten surface defect as a probe of the superconformal index, which also serves as an order parameter for the deconfinement transition. This can be studied directly in field theory as a modification of the usual unitary matrix model or in the dual description as a D3-brane probe in the background of a (complex) supersymmetric black hole. Using a saddle point approximation, we determine our defect index in the large N limit as a simple function of the chemical potentials and show independently that it is reproduced by the renormalized action of the brane in the black hole background. Along the way, we also comment on the Cardy limit and the thermodynamics of the D3-brane in the generalized ensemble. The defect index sharply distinguishes between the confining and the deconfining phases of the gauge theory and thus is a supersymmetric non-perturbative order parameter for these large N phase transitions which deserves further investigation. Finally, our work provides an example where the properties of a black hole coupled to an external system can be analyzed precisely.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Energy Gap of the Even-Denominator Fractional Quantum Hall State in Bilayer Graphene

Bernal bilayer graphene hosts even-denominator fractional quantum Hall states thought to be described by a Pfaffian wave function with non-Abelian quasiparticle excitations. Here, in this study, we report the quantitative determination of fractional quantum Hall energy gaps in bilayer graphene using both thermally activated transport and by direct measurement of the chemical potential. We find a transport activation gap of 5.1 K at B = 12 T for a half filled N = 1 Landau level, consistent with density matrix renormalization group calculations for the Pfaffian state. However, the measured thermodynamic gap of 11.6 K is smaller than theoretical expectations for the clean limit by approximately a factor of 2. We analyze the chemical potential data near fractional filling within a simplified model of a Wigner crystal of fractional quasiparticles with long-wavelength disorder, explaining this discrepancy. Our results quantitatively establish bilayer graphene as a robust platform for probing the non-Abelian anyons expected to arise as the elementary excitations of the even-denominator state.

36 MATERIALS SCIENCE↗

Randomized low-rank decompositions of nuclear three-body interactions

First-principles simulations of many-fermion systems are commonly limited by the computational requirements of processing large data objects. As a remedy, we propose the use of low-rank approximations of three-body interactions, which are the dominant such limitation in nuclear physics. We introduce a randomized decomposition technique to handle the excessively large matrix dimensions and study the sensitivity of low-rank properties to interaction details. The developed low-rank three-nucleon interactions are benchmarked in ab initio simulations of few- and many-body systems. Exploiting low-rank properties provides a promising route to extend the microscopic description of atomic nuclei to large systems where storage requirements exceed the computational capacities of the most advanced high-performance computing facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗

pyDecay: A CRAM-Based Isotope Decay Solver

This module (pyDecay) implements a Chebyshev Rational Approximation Method (CRAM) for solving isotope decay equations, based on the work of M. Pusa. It provides a numerically stable and efficient method for evaluating the matrix exponential involved in nuclear decay calculations. This implementation of CRAM relies on the incomplete partial factorization (IPF) algorithm published by Pusa [3], with corrections noted by Romano et al.

Skutnik, SteveEugene [Oak Ridge National Laborator↗

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - I : Theory

This paper discusses two cross section interpolation methods commonly found in popular nodal codes; the partial derivatives and multiple tables models. The motivation for choosing a model, and thus a case matrix structure, is a trade off between accuracy and computational cost. Due to decades of experience, there are default structures that are sufficient for current light water reactor analysis. However, this is not necessarily the case for advanced reactor designs. Therefore, it is advantageous to understand the sources of error in cross section interpolation models so that the quality of a case matrix may be improved. A mathematical framework for these models is presented in this work that provides a more rigorous connection between the nuclear engineering field's cross section interpolation methods and the broader mathematical field of function approximation. The two cross section models examined in this paper were found to utilize Lagrange interpolation and are a subset of Lagrange tensor products. Classical results of Lagrange polynomial error analysis were then applied to the partial derivative and multiple tables models to derive expressions for the total point-wise error. The analytical results classify the total error into two parts: the model form error and interpolation error. Finally, based on our observations, a better foundation for improving the quality of a case matrix is proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A numerically exact description of ultrafast vibrational decoherence in vibration-coupled electron transfer

Broadband pump–probe spectroscopy has been widely used to measure vibrational decoherence associated with the reaction coordinate in photoinduced ultrafast vibration-coupled electron transfer (VCET) reactions. These experiments provide insight into the interplay of intramolecular coordinates along the reaction coordinate. However, a general theoretical foundation for analyzing, and even for explaining rigorously, these data is lacking. In this work, we study vibrational decoherence in a model VCET reaction using the nearly exact time-dependent density matrix renormalization group simulation method. We explore how analyzing the density matrix with quantum information measures can help elucidate the evolution of vibrational coherence in simulations of dynamics. We examine how vibrational coherence is affected by electron transfer on the timescale of approximately 100 femtoseconds. Our results suggest that electron transfer, in the nonadiabatic model, changes the vibrational equilibrium position abruptly—an example of a “quantum quench” event. This explains the concomitant vibrational decoherence. We find that abrupt vibrational decoherence can be mitigated by wavepacket motion occurring on the timescale of the electron transfer.

Science & Technology - Other Topics↗

Wave function methods for canonical ensemble thermal averages in correlated many-fermion systems

We present a wave function representation for the canonical ensemble thermal density matrix by projecting the thermofield double state against the desired number of particles. Furthermore, the resulting canonical thermal state obeys an imaginary-time evolution equation. Starting with the mean-field approximation, where the canonical thermal state becomes an antisymmetrized geminal power (AGP) wave function, we explore two different schemes to add correlation: by number-projecting a correlated grand-canonical thermal state and by adding correlation to the number-projected mean-field state. As benchmark examples, we use number-projected configuration interaction and an AGP-based perturbation theory to study the hydrogen molecule in a minimal basis and the six-site Hubbard model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bayesian High-Rank Hankel Matrix Completion for Nonlinear Synchrophasor Data Recovery

Phasor measurement units (PMUs) provide high temporal-resolution synchrophasor measurements for power system monitoring and control. The frequent data quality issues, such as missing and bad data, prevent the incorporation of synchrophasor data in real-time operations. Most existing data-driven data recovery methods assume the power system dynamics can be approximated by a linear dynamical system, and the recovery performance degrades significantly when the power system is experiencing nonlinear dynamics during significant events. Here, this paper proposes a data-driven Bayesian nonlinear synchrophasor data recovery method (Ba-NSDR) that can recover a consecutive time period of simultaneous data losses or errors across all channels, even when the underlying system is highly nonlinear. The idea is to lift the Hankel matrix of the spatial-temporal synchrophasor data to a higher dimension such that the lifted Hankel matrix is low-rank in that space and can be processed with the kernel trick. Our proposed Bayesian method then infers the probabilistic distributions of synchrophasor from the partial observations. Some distinctive features of Ba-NSDR include an uncertainty index to measure the accuracy of the recovery result and the robustness to parameter selections. Our method is verified on both synthetic and recorded event datasets.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗

Disordered hydrogen adsorption at the three-fold site of W(110)

Hydrogen often forms disordered phases on metals; however, deciphering the atomic-scale behavior requires experimental and modeling techniques that directly probe the short-range order between neighboring hydrogen adsorbates. Here, to address this challenge, we applied direct recoil spectroscopy (DRS) to investigate hydrogen adsorption on the W(110) surface. We show that the recoiled hydrogen flux measured during DRS is sensitive to the short range order of the adsorbed hydrogen. Ordered hydrogen neighbors are much more efficient at dechanneling incident ions along low-index surface channels, strongly suppressing the recoiled hydrogen flux along these directions. By modeling the DRS measurements with molecular dynamics for ordered and disordered hydrogen phases, we find that at a hydrogen surface coverage of approximately Θ = 0.6, the hydrogen adsorbates are bound to three-fold sites in a disordered phase at room temperature. This finding is consistent with transfer-matrix scaling model calculations that suggest the transition to an ordered hydrogen phase occurs at a greater surface coverage of Θ = 0.83.

08 HYDROGEN↗

Quantum Monte Carlo calculation of {delta}C in the superallowed beta decay of 10C

We perform an ab initio quantum Monte Carlo calculation of the isospin-symmetry-breaking correction δC to the superallowed β decay of ¹⁰C. Using both phenomenological and chiral nuclear interactions, we evaluate the Fermi matrix element and quantify its deviation from the canonical √2 value. The resulting δC values lie in the range ≈ 0.15–0.25% and are consistent, within sizable uncertainties (approximately 34%–65% relative), across Hamiltonians, indicating no statistically significant dependence on the choice of nuclear interaction. The extracted values of Vud are also found to be compatible with current determinations within these uncertainties.

Piarulli, M↗

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↗

Distributed and communication-efficient solutions to linear equations with special sparse structure

In this paper we report two distributed and communication-efficient algorithms based on the multi-agent system are proposed to solve a system of linear equations with the Laplacian sparse system matrix. One algorithm is based on the gradient descent method in optimization. In this algorithm, the agents only share partial information instead of all of their collective state vectors to save significant communication. The other algorithm is obtained by approximating Newton’s method for a faster convergence rate. Although it requires twice as much communication as the first one, it is still communication-efficient given the low dimension of the information shared among agents. The convergence at a linear rate is proved for both algorithms, and a comprehensive comparison of their convergence rate, communication burden, and computation costs is also performed. The proposed algorithms can be applied to various systems to solve those problems that can be modeled as a system of linear equations with a Laplacian sparse system matrix. Simulation results with the electric power system illustrate their effectiveness.

42 ENGINEERING↗