Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tensor network methods”

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 181 records · Page 10

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]↗

Application of multigrid methods to the solution of liquid crystal equations on a SIMD computer

We will describe a finite difference code for computing the equilibrium configurations of the order-parameter tensor field for nematic liquid crystals in rectangular regions by minimization of the Landau-de Gennes Free Energy functional. The implementation of the free energy functional described here includes magnetic fields, quadratic gradient terms, and scalar bulk terms through the fourth order. Boundary conditions include the effects of strong surface anchoring. The target architectures for our implementation are SIMD machines, with interconnection networks which can be configured as 2 or 3 dimensional grids, such as the Wavetracer DTC. We also discuss the relative efficiency of a number of iterative methods for the solution of the linear systems arising from this discretization on such architectures.

Farrell, Paul A.↗

Link prediction on evolving graphs using matrix and tensor factorizations.

The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for time periods 1 through T, can we predict the links in time period T + 1? Specifically, we look at bipartite graphs changing over time and consider matrix- and tensor-based methods for predicting links. We present a weight-based method for collapsing multi-year data into a single matrix. We show how the well-known Katz method for link prediction can be extended to bipartite graphs and, moreover, approximated in a scalable way using a truncated singular value decomposition. Using a CANDECOMP/PARAFAC tensor decomposition of the data, we illustrate the usefulness of exploiting the natural three-dimensional structure of temporal link data. Through several numerical experiments, we demonstrate that both matrix- and tensor-based techniques are effective for temporal link prediction despite the inherent difficulty of the problem.

99 GENERAL AND MISCELLANEOUS↗

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗

Virtual Electrochemical Strain Microscopy of Polycrystalline LiCoO2 Films

A recently developed technique, electrochemical strain microscopy (ESM), utilizes the strong coupling between ionic current and anisotropic volumetric chemical expansion of lithium-ion electrode materials to dynamically probe the sub-one-hundred? nm inter-facial kinetic intercalation properties. A numerical technique based on the finite element method was developed to analyze the underlying physics that govern the ESM signal generation and establish relations to battery performance. The performed analysis demonstrates that the diffusion path within a thin film is tortuous and the extent of lithium diffusion into the electrode is dependent on the SPM-tip-imposed overpotential frequency. The detected surface actuation gives rise to the development of an electromechanical hysteresis loop whose shape is dependent on grain size and overpotential frequency. Shape and tilting angle of the loop are classified into low and high frequency regimes, separated by a transition frequency which is also a function of lithium diffusivity and grain size, f T = D/l₂. Research shows that the crystallographic orientation of the surface actuated grain has a significant impact on the shape of the loop. The polycrystalline crystallographic orientation of the grains induces a diffusion path network in the electrode which impacts on the mechanical reliability of the battery. Simulations demonstrate that continuous battery cycling results in a cumulative capacity loss as a result of the hysteric non-reversible lithium intercalation. Furthermore, results suggest that ESM has the capability to infer the local out-of-plane lithium diffusivity and the out-of-plane contribution to Vegard tensor.

25 ENERGY STORAGE↗

AnisONet: A deep neural operator-based anisotropic permeability upscaler from pore to Darcy scale

Directional permeability variations, which govern directional fluid flow in porous media with anisotropy, are important to accurately predict flow behavior, reactive transport, and fluid–solid interactions for various processes such as enhanced geothermal systems, energy storage devices, and biological systems. However, the intricate architecture of porous media makes it difficult to predict directional permeabilities. In this work, we present a novel machine learning (ML) framework, AnisONet, built upon an integration of a convolutional neural network, Swin transformer, and the deep operator network architecture, designed to predict anisotropic permeability and upscale predictions to larger spatial domains. First, AnisONet was evaluated with three classes of two-dimensional (2D) porous media, including synthetic circular and elliptical grains and natural sandstone grains from micro-computed tomography images. A lattice Boltzmann model (LBM) was used to calculate directional permeabilities at every 10° angle, producing 19 data points per image of porous media. AnisONet is then trained to predict permeability as a function of rotation angle. AnisONet showed strong predictive capability of directional permeability. Second, we tested our model for five upscaling cases with a large image size in the finite-element method (FEM) for 2D Darcy flow with various permeability tensor construction methods. Overall, upscaled permeability tensors in FEM simulations produce a reasonably good match with LBM results, highlighting the importance of selecting appropriate tensor formation strategies for accurate permeability upscaling. AnisONet, as a directional permeability estimator, could be further developed for more complex geometries, with the potential to develop a foundational ML model for various applications in porous media.

42 ENGINEERING↗

Tensor network implementation of bulk entanglement spectrum

Many topologically nontrivial states of matter possess gapless degrees of freedom on the boundary, and when these boundary states delocalize into the bulk, a phase transition occurs, and the system becomes topologically trivial. We show that tensor networks provide a natural framework for analyzing such topological phase transitions in terms of the boundary degrees of freedom which mediate it. To do so, we make use of a correspondence between a topologically nontrivial ground state and its phase transition to a trivial phase established in T. Hsieh and L. Fu (arXiv:1305.1949). This involved computing the bulk entanglement spectrum (BES) of the ground state upon tracing out an extensive subsystem. Here, this work implements BES via tensor network representations of ground states. In this framework, the universality class of the quantum critical entanglement Hamiltonian in d spatial dimensions is either derived analytically or mapped to a classical statistical model in d +1 dimensions, which can be studied using Monte Carlo or tensor renormalization-group methods. As an example, we analytically derive the universality classes of topological phase transitions from the spin-1 chain Haldane phase and demonstrate that the Affleck-Kennedy-Lieb-Tasaki (AKLT) wave function (and its generalizations) remarkably contains critical six-vertex (and, in general, eight-vertex) models within it.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗

Non-negative Tensor Factorization for Robust Exploratory Big-Data Analytics

Currently, large multidimensional datasets are being accumulated in almost every field. Data are: (1) collected by distributed sensor networks in real-time all over the globe, (2) produced by large-scale experimental measurements or engineering activities, (3) generated by high-performance simulations, and (4) gathered by electronic communications and socialnetwork activities, etc. Simultaneous analysis of these ultra-large heterogeneous multidimensional datasets is often critical for scientific discoveries, decision-making, emergency response, and national and global security. The importance of such analyses mandates the development of the next-generation of robust machine learning (ML) methods and tools for bigdata exploratory analysis.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Cuboidal Liquid Crystal Phases Under Multiaxial Geometrical Frustration.

Cuboidal liquid crystal phases - the so-called blue phases - consist of a network of topological defects arranged into a cubic symmetry. They exhibit striking optical properties, including Bragg reflection in the visible range and fast response times. Confining surfaces can interfere with the packing of such a network, leading to structures that have not been explored before. In this work, a Landau-de Gennes free energy formalism for the tensor alignment field Q is used to investigate the behavior of chiral liquid crystals under non-isotropic confinement. The underlying free energy functional is solved by relying on a Monte Carlo method that facilitates efficient exploration of configuration space. The results of simulations are expressed in terms of phase diagrams as a function of chirality and temperature for three families of spheroids: oblate, spherical, and prolate. Upon deformation, blue phases adapt and transform to accommodate the geometrical constraints, thereby resulting in a wider range of thermal stability. For oblate spheroids, confinement interferes with the development of a full blue phase structure, resulting on a combination of half skyrmions. For prolate spheroids, the blue phases are hybridized and exhibit features of blue phases I and II. More generally, it is shown that mechanical deformation provides an effective means to control, manipulate and stabilize blue phases and cholesterics confined in tactoids.

Palacio-Betancur, Viviana↗

Neural network emulation of spontaneous fission

Large-scale computations of fission properties are an important ingredient for nuclear reaction network calculations simulating rapid neutron-capture process (the 𝑟 process) nucleosynthesis. Due to the large number of fissioning nuclei potentially contributing to the 𝑟 process, a microscopic description of fission based on nuclear density functional theory (DFT) is computationally challenging. Here, we explore the use of neural networks (NNs) to construct DFT emulators capable of predicting potential energy surfaces and collective inertia tensors across the whole nuclear chart, starting from a minimal set of DFT calculations. We use constrained Hartree-Fock-Bogoliubov (HFB) calculations to predict the potential energy and collective inertia tensor in the axial quadrupole and octupole collective coordinates, for a set of nuclei in the 𝑟-process region. We then employ NNs to emulate the HFB energy and collective inertia tensor across the considered region of the nuclear chart. Least-action pathways characterizing spontaneous fission half-lives and fragment yields are then obtained by means of the nudged elastic band method. The potential energy predicted by NNs agrees with the DFT value to within a root-mean-square error of 500 keV, and the collective inertia components agree to within an order of magnitude. These results are largely independent of the NN architecture. The exit points on the outer turning line are found to be well emulated. For the spontaneous fission half-lives the NN emulation provides values that are found to agree with the DFT predictions within a factor of 10 3 across more than 70 orders of magnitude. Neural networks are able to emulate the potential energy and collective inertia well enough to reasonably predict physical observables. Future directions of study, such as the inclusion of additional collective degrees of freedom and active learning, will improve the predictive power of microscopic theory and further enable large-scale fission studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SPARTAN (Scalable Probabilistic Application Reconfigurable Tensor Autonomous Network)

The technical founder of Ludwig Computing Inc has been competitively selected for support by Cyclotron Road, a U.S. Department of Energy (DOE) Advanced Manufacturing Office (AMO) Lab-Embedded Entrepreneurship Program (LEEP) through an approved merit review process. Ludwig Computing Inc, supported by the U.S. Department of Energy's Advanced Manufacturing Office through the Cyclotron Road program, has investigated the advantages of probabilistic computing for real-world compute-intensive applications. This research adds to the understanding of alternative computing paradigms by exploring a unique hardware-software co-design that integrates quantum computing methods with nature-inspired problem-solving techniques. The project's focus on areas such as combinatorial optimization, graph analytics, and machine learning demonstrates the potential for significant advancements in computational efficiency and performance. By harnessing natural randomness to streamline large circuits into fewer devices, Ludwig's approach enables massive parallelism, potentially offering higher throughput, speed, and energy efficiency compared to conventional hardware solutions. This work benefits the public by paving the way for more efficient computing solutions that could address complex real-world problems while potentially reducing energy consumption in data-intensive industries.

97 MATHEMATICS AND COMPUTING↗

Seismic source characterization of the Arabian Peninsula and Zagros Mountains from regional moment tensor and coda envelopes

Reliable estimates of moment magnitude and source mechanism for seismic events in the Middle East can be challenging due to a small number of openly available stations, the complex tectonic setting, and regions of high attenuation. Access to high-quality waveform data from well-calibrated regional seismic stations is fundamental in producing robust and stable estimates of earthquake source parameters, particularly when measurements of absolute ground motion amplitudes are required. Earthquake source mechanism and moment magnitude are invaluable information in the assessment of seismic hazard, plate motions, and the characterization of faults and regional stress field. The expansion of the Kingdom of Saudi Arabia’s national seismic network in the past several decades provides an opportunity to develop the capabilities of routine focal mechanism and moment magnitude estimations. In this study, we use time-domain full waveform moment tensor inversion and coda envelope–derived amplitude measurements to solve for earthquake source mechanism, moment magnitudes, and their source type. Furthermore, we compared the moment magnitudes calculated from the two methods and publicly available earthquake catalogs and discuss the implications of the obtained source parameters.

58 GEOSCIENCES↗

How to upload a physical quantum state into correlation space

In the framework of the computational tensor network [Phys. Rev. Lett. 98, 220503 (2007)], the quantum computation is performed in a virtual linear space called the correlation space. It was recently shown [Phys. Rev. Lett. 103, 050503 (2009)] that a state in a correlation space can be downloaded to the real physical space. In this paper, conversely, we study how to upload a state from a real physical space to the correlation space. After showing the impossibility of cloning a state between a real physical space and the correlation space, we propose a simple teleportation-like method of uploading. This method also enables the Gottesman-Chuang gate teleportation trick and entanglement swapping in the virtual-real hybrid setting. Furthermore, compared with the inverse of the downloading method by Cai et al. [Phys. Rev. Lett. 103, 050503 (2009)], which also works to upload, the proposed uploading method has several advantages.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The structure and migration of twin boundaries in tetragonal β -Sn: An application of machine learning based interatomic potentials

Although atomistic simulations have contributed significantly to our understanding of twin boundary structure and migration in metals and alloys with hexagonal close packed (HCP) crystal structures, few direct atomistic studies of twinning have been conducted for other types of low symmetry materials, in large part due to a lack of reliable interatomic potentials. In this work, we examine twin boundary structure and migration in a tetragonal material, β-Sn, comparing high resolution Transmission Electron Microscopy (TEM) images of deformation twins in β-Sn to the results of direct atomistic simulations using multiple interatomic potentials. ML-based potentials developed in this work are found to give results consistent with our experimental data, revealing faceted twin boundary structures formed by the nucleation and motion of twinning disconnections. We use bicrystallographic methods in combination with atomistic simulations to analyze the structure, energy and shear coupled migration of observed twin facets in β-Sn. In analogy to Prismatic-Basal (PB/BP) interfaces in HCP metals, we discover low energy asymmetric Prismatic-A-plane (PA/AP) interfaces important to twin growth in β-Sn. Finally, a Moment Tensor Potential (MTP) and Rapid Artificial Neural Network (RANN) interatomic potential suitable for studying twinning and phase transformations in Sn are made publicly available as part of this work.

36 MATERIALS SCIENCE↗

High-resolution source imaging and moment tensor estimation of acoustic emissions during brittle creep of basalt undergoing carbonation

SUMMARY As the high-frequency analogue to field-scale earthquakes, acoustic emissions (AEs) provide a valuable complement to study rock deformation mechanisms. During the load-stepping creep experiments with CO2-saturated water injection into a basaltic sample from Carbfix site in Iceland, 8791 AE events are detected by at least one of the seven piezoelectric sensors. Here, we apply a cross-correlation-based source imaging method, called geometric-mean reverse-time migration (GmRTM) to locate those AE events. Besides the attractive picking-free feature shared with other waveform-based methods (e.g. time-reversal imaging), GmRTM is advantageous in generating high-resolution source images with reduced imaging artefacts, especially for experiments with relatively sparse receivers. In general, the imaged AE locations are found to be scattered across the sample, suggesting a complicated fracture network rather than a well-defined major shear fracture plane, in agreement with X-ray computed tomography imaging results after retrieval of samples from the deformation apparatus. Clustering the events in space and time using the nearest-neighbour approach revealed a group of ‘repeaters’, which are spatially co-located over an elongated period of time and likely indicate crack, or shear band growth. Furthermore, we select 2196 AE events with high signal-to-noise-ratio (SNR) and conduct moment tensor estimation using the adjoint (backpropagated) strain tensor fields at the locations of AE sources. The resulting AE locations and focal mechanisms support our previously assertion that creep of basalt at the experimental conditions is accommodated dominantly by distributed microcracking.

58 GEOSCIENCES↗

Certifying almost all quantum states with few single-qubit measurements

Certifying that an n -qubit state synthesized in the laboratory is close to a given target state is a fundamental task in quantum information science. However, existing rigorous protocols applicable to general target states have potentially prohibitive resource requirements in the form of either deep quantum circuits or exponentially many single-qubit measurements. Here we prove that almost all n -qubit target states, including those with exponential circuit complexity, can be certified from only O ( n 2 ) single-qubit measurements. Given access to the target state’s amplitudes, our protocol requires only O ( n 3 ) classical computation. This result is established by a technique that relates certification to the mixing time of a random walk. Our protocol has applications for benchmarking quantum systems, for optimizing quantum circuits to generate a desired target state and for learning and verifying neural networks, tensor networks and various other representations of quantum states using only single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties of a synthesized state that would otherwise require an exponential number of measurements on the state. We demonstrate these applications in numerical experiments with up to 120 qubits and observe an advantage over existing methods such as cross-entropy benchmarking.

information theory and computation↗

Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations

Tensor factorizations with nonnegativity constraints have found application in analysing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g. count data), which leads to sparse tensors that can be modelled by sparse factor matrices. In this paper, we investigate efficient techniques for computing an appropriate canonical polyadic tensor factorization based on the Kullback–Leibler divergence function. We propose novel subproblem solvers within the standard alternating block variable approach. Our new methods exploit structure and reformulate the optimization problem as small independent subproblems. We employ bound-constrained Newton and quasi-Newton methods. Finally, we compare our algorithms against other codes, demonstrating superior speed for high accuracy results and the ability to quickly find sparse solutions.

97 MATHEMATICS AND COMPUTING↗