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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Many-Body Effects in FeN4 Center Embedded in Graphene

We introduce a computational approach to study porphyrin-like transition metal complexes, bridging density functional theory and exact many-body techniques, such as the density matrix renormalization group (DMRG). We first derive a multi-orbital Anderson impurity Hamiltonian starting from first principles considerations that qualitatively reproduce generalized gradient approximation (GGA)+U results when ignoring inter-orbital Coulomb repulsion U ′ and Hund exchange J. An exact canonical transformation is used to reduce the dimensionality of the problem and make it amenable to DMRG calculations, including all many-body terms (both intra- and inter-orbital), which are treated in a numerically exact way. We apply this technique to FeN 4 centers in graphene and show that the inclusion of these terms has dramatic effects: as the iron orbitals become single occupied due to the Coulomb repulsion, the inter-orbital interaction further reduces the occupation, yielding a non-monotonic behavior of the magnetic moment as a function of the interactions, with maximum polarization only in a small window at intermediate values of the parameters. Furthermore, U ′ changes the relative position of the peaks in the density of states, particularly on the iron d z 2 orbital, which is expected to affect the binding of ligands greatly.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Microstructural Assessment of a Multiple-Intermetallic-Strengthened Aluminum Alloy Produced from Gas-Atomized Powder by Hot Extrusion and Friction Extrusion

An aluminum (Al) matrix with various transition metal (TM) additions is an effective alloying approach for developing high-specific-strength materials for use at elevated temperatures. Conventional fabrication processes such as casting or fusion-related methods are not capable of producing Al–TM alloys in bulk form. Solid phase processing techniques, such as extrusion, have been shown to maintain the microstructure of Al–TM alloys. In this study, extrusions are fabricated from gas-atomized aluminum powders (≈100–400 µm) that contain 12.4 wt % TM additives and an Al-based matrix reinforced by various Al–Fe–Cr–Ti intermetallic compounds (IMCs). Two different extrusion techniques, conventional hot extrusion and friction extrusion, are compared using fabricating rods. During extrusion, the strengthening IMC phases were extensively refined as a result of severe plastic deformation. Furthermore, the quasicrystal approximant IMC phase (70.4 wt % Al, 20.4 wt % Fe, 8.7 wt % Cr, 0.6 wt % Ti) observed in the powder precursor is replaced by new IMC phases such as Al3.2Fe and Al45Cr7-type IMCs. The Al3Ti-type IMC phase is partially dissolved into the Al matrix during extrusion. The combination of linear and rotational shear in the friction extrusion process caused severe deformation in the powders, which allowed for a higher extrusion ratio, eliminated linear voids, and resulted in higher ductility while maintaining strength comparable to that resulting from hot extrusion. Results from equilibrium thermodynamic calculations show that the strengthening IMC phases are stable at elevated temperatures (up to ≈ 600 °C), thus enhancing the high-temperature strength of the extrudates.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Possible continuous transition from fractional quantum Hall to stripe phase at ν e = 7 / 3

We study the phase diagram of the ν e = 7/3 state in the N=1 Landau level in the presence of band mass anisotropy. Using the density matrix renormalization group on an infinite cylinder geometry, we find a continuous transition from the topologically ordered Laughlin fractional quantum Hall state to a stripe phase with a period of approximately five and a half magnetic lengths. The transition is driven by the condensation of the magnetoroton mode which becomes gapless at the critical point. We interpret the transition within the composite-boson theory as the onset of stripe order in a superfluid background, resulting from the roton mode going soft.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2020

Samarium isotope compositions of uranium ore concentrates: A novel nuclear forensic signature

Uranium ore is mined and milled to produce uranium ore concentrate (UOC), a regulated product of the nuclear fuel cycle. Additionally, diversion of UOC from the fuel cycle into possible weapons production is a key concern in global nonproliferation efforts. As such, the ability to trace the origin of seized nuclear materials is imperative to law enforcement efforts. Although isotopic signatures of UOCs have proven fruitful to pinpoint sample provenance, new isotopic signatures are needed because most existing isotopic signatures are not indicative of the original ore body from which the U is derived. In this work, we developed a new method to separate samarium (Sm) from a U-rich sample matrix and report the first Sm isotope compositions of 32 UOCs derived from a variety of worldwide uranium mines. Relative to terrestrial standards, approximately half the UOCs have resolved and anticorrelated 149 Sm- 150 Sm isotope compositions, consistent with the capture of thermal neutrons by 149 Sm in the ore body. The UOCs with anomalous Sm isotope compositions tend to derive from older (~>1.5Ga) and higher-grade ore bodies, although other factors, such as the presence of neutron moderators like water, also play a role. Nonetheless, the Sm isotope compositions of UOCs directly reflects the neutron fluence over the history of the original ore body and can be used to discern different geologic conditions associated with that ore body. Overall, this work demonstrates the potential use of Sm isotopes as a novel nuclear forensics signature for origin assessment of UOCs.

58 GEOSCIENCES↗
DOE OSTI2020

A Monte Carlo Approach to Approximating the Effects of Pore Geometry on the Phase Behavior of Soil Freezing

Abstract Freezing in porous media is associated with a host of dynamic phenomena that stem from the presence and mobility of premelted liquid at subzero temperatures. Accurate assessments of the progressive liquid‐ice phase transition is required for predictive models of frost damage, glacier‐till coupling, and many other cold regions processes, as well as for evaluating the capacity for water storage in near‐surface extraterrestrial environments. We use a Monte Carlo approach to sample the pore space in a synthetic 3D packing of poly‐dispersed spherical particles and evaluate local geometrical constraints that allow us to assess changes in the relative proportions of pore fluid and ice. By approximating the phase boundary geometry in fine‐grained pores while considering both the curvature of the liquid‐ice interface and wetting interactions with matrix particles, our model predicts changes in phase equilibrium in granular media over a broad temperature range, where present accounting for the colligative effects of chloride and perchlorate solutes. In addition to formulating the constitutive behavior needed to better understand properties and processes in frozen soils, our results also provide insight into other aspects of phase equilibria in porous media, including the formation of methane hydrates in permafrost and marine sediments, and the partitioning between liquid water and vapor in the vadose zone.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A high-order Shifted Interface Method for Lagrangian shock hydrodynamics

Here, we present a new method for two-material Lagrangian hydrodynamics, which combines the Shifted Interface Method (SIM) with a high-order Finite Element Method. Our approach relies on an exact (or sharp) material interface representation, that is, it uses the precise location of the material interface. The interface is represented by the zero level-set of a continuous high-order finite element function that moves with the material velocity. This strategy allows to evolve curved material interfaces inside curved elements. By reformulating the original interface problem over a surrogate (approximate) interface, located in proximity of the true interface, the SIM avoids cut cells and the associated problematic issues regarding implementation, numerical stability, and matrix conditioning. Accuracy is maintained by modifying the original interface conditions using Taylor expansions. We demonstrate the performance of the proposed algorithms on established numerical benchmarks in one, two and three dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Analytic techniques for solving the transport equations in electroweak baryogenesis

We develop an efficient method for solving transport equations, particularly in the context of electroweak baryogenesis. It provides fully-analytical results under mild approximations and can also test semi-analytical results, which are applicable in more general cases. Key elements of our method include the reduction of the second-order differential equations to first order, representing the set of coupled equations as a block matrix of the particle densities and their derivatives, identification of zero modes, and block decomposition of the matrix. We apply our method to calculate the baryon asymmetry of the Universe (BAU) in a Standard Model effective field theory framework of complex Yukawa couplings to determine the sensitivity of the resulting BAU to modifications of various model parameters and rates, and to estimate the effect of the commonly-used thin-wall approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗
DOE OSTI2022

Vibrational Entropy of Crystalline Solids from Covariance of Atomic Displacements

The vibrational entropy of a solid at finite temperature is investigated from the perspective of information theory. Ab initio molecular dynamics (AIMD) simulations generate ensembles of atomic configurations at finite temperature from which we obtain the N-body distribution of atomic displacements, ρN. We calculate the information-theoretic entropy from the expectation value of lnρN. At a first level of approximation, treating individual atomic displacements independently, our method may be applied using Debye–Waller B-factors, allowing diffraction experiments to obtain an upper bound on the thermodynamic entropy. At the next level of approximation we correct the overestimation through inclusion of displacement covariances. We apply this approach to elemental body-centered cubic sodium and face-centered cubic aluminum, showing good agreement with experimental values above the Debye temperatures of the metals. Below the Debye temperatures, we extract an effective vibrational density of states from eigenvalues of the covariance matrix, and then evaluate the entropy quantum mechanically, again yielding good agreement with experiment down to low temperatures. Our method readily generalizes to complex solids, as we demonstrate for a high entropy alloy. Further, our method applies in cases where the quasiharmonic approximation fails, as we demonstrate by calculating the HCP/BCC transition in Ti.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Entanglement and many-body effects in collective neutrino oscillations

Collective neutrino oscillations play a crucial role in transporting lepton flavor in astrophysical settings, such as supernovae, where the neutrino density is large. In this regime, neutrino-neutrino interactions are important and simulations in the mean-field approximation show evidence for collective oscillations occurring at timescales much shorter than those associated with vacuum oscillations. In this work, we study the out-of-equilibrium dynamics of a corresponding spin model using matrix product states and show how collective bipolar oscillations can be triggered by many-body correlations if appropriate initial conditions are present. We find entanglement entropies scaling at most logarithmically in the system size suggesting that classical tensor network methods could be efficient in describing collective neutrino dynamics more generally. These observation provide a clear path forward, not only to increase the accuracy of current simulations, but also to elucidate the mechanism behind collective flavor oscillations without resorting to the mean-field approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Nucleon axial and pseudoscalar form factors using twisted-mass fermion ensembles at the physical point

We compute the nucleon axial and pseudoscalar form factors using three N f = 2 + 1 + 1 twisted-mass fermion ensembles with all quark masses tuned to approximately their physical values. The values of the lattice spacings of these three physical point ensembles are 0.080, 0.068, and 0.057 fm and spatial sizes 5.1, 5.44, and 5.47 fm, respectively, yielding m π L > 3.6 . Convergence to the ground-state matrix elements is assessed using multistate fits. We study the momentum dependence of the three form factors and check the partially conserved axial-vector current (PCAC) hypothesis and the pion pole dominance (PPD). We show that in the continuum limit, the PCAC and PPD relations are satisfied. We also show that the Goldberger-Treimann relation is approximately fulfilled and determine the Goldberger-Treiman discrepancy. Our final results are g A = 1.245 ( 28 ) ( 14 ) for the nucleon axial charge, ⟨ r A 2 ⟩ = 0.339 ( 48 ) ( 06 ) fm 2 for the axial radius, g π N N ≡ lim Q 2 → − m π 2 G π N N ( Q 2 ) = 13.25 ( 67 ) ( 69 ) for the pion-nucleon coupling constant, and G P ( 0.88 m μ 2 ) ≡ g P * = 8.99 ( 39 ) ( 49 ) for the induced pseudoscalar form factor at the muon capture point. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2021

Compact representations of structured BFGS matrices

For general large-scale optimization problems compact representations exist in which recursive quasi-Newton update formulas are represented as compact matrix factorizations. For problems in which the objective function contains additional structure, recent structured quasi-Newton methods exploit available second-derivative information and approximate unavailable second derivatives. Here, this article develops the compact representations of two structured Broyden-Fletcher-Goldfarb-Shanno update formulas. The compact representations enable efficient limited memory and initialization strategies. Two limited memory line search algorithms are described for which extensive numerical results demonstrate the efficacy of the algorithms, including comparisons to IPOPT on large machine learning problems, and to L-BFGS on a real world large scale ptychographic imaging application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Preconditioning for Hyper-reduction in Reduced Order Models

Many projection-based reduced order models (pROM) that utilize the governing equation and data to accelerate physical simulations can be applied to nonlinear dynamical systems. To avoid full order model (FOM) scale update for each time step, hyperreduction techniques are developed to sample high dimensional nonlinear terms. Our study aims to investigate if preconditioning the least-squares problem used for the nonlinear approximation can improve the robustness of the condition number of the problem while achieving high accuracy. In our study, we use the row-normalization matrix motivated by the Christoffel function as the preconditioner and solve the corresponding weighted least-squares problem. Numerical results for Lagrangian hydrodynamics examples are analyzed to explore how the preconditioner works compared to existing hyper-reduction techniques.

97 MATHEMATICS AND COMPUTING↗