Defense of Supervised and Unsupervised Machine Learning Models
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
The spatial formulation of the elastoplastic dynamic problem for finite deformations is considered. A thermodynamic argument leads to an additive decomposition of the spatial rate of deformation tensor and allows an operator split of the evolutionary equations of the problem into elastic and plastic parts. This operator split is taken as the basis for the definition of a global product algorithm. In the context of finite element discretization the product algorithm entails, for every time step, the solution of a nonlinear elastodynamic problem followed by the application of plastic algorithms that operate on the stresses and internal variables at the integration points and bring in the plastic constitutive equations. Suitable plastic algorithms are discussed for the cases of perfect and hardening plasticity and viscoplasticity. The proposed formalism does not depend on any notion of smoothness of the yield surface and is applicable to arbitrary convex elastic regions, with or without corners. The stabiity properties of the global product algorithm are shown to be identical to those of the algorithm used for the integration of the nonlinear elastodynamic problem. Numerical examples illustrate the accuracy of the method.
We introduce an approach for approximate real-time evolution of quantum systems using tensor renormalization group (TRG) methods originally developed for imaginary time. We use higher-order TRG to generate a coarse-grained time evolution operator for a 1+1D transverse Ising model with a longitudinal field. We show that the standard tensor norm used for the singular value decomposition-based truncation is degenerate and propose an alternate method to discriminate. We show that it is effective and efficient in evolving Gaussian wave packets for one and two particles in the disordered phase, while ordered phase behavior is more challenging to capture. We compare our algorithm with local simulators for universal quantum computers and discuss possible benchmarking in the near future.
We develop algorithms and software that uses the D-Wave 2000Q quantum annealer to solve several types of Boolean tensor factorization problems. Boolean tensor factorization refers to the problem of representing a high-dimensional tensor filled with Boolean values as a product of smaller Boolean core tensors and Boolean matrices. We consider different tensor factorization models, including Boolean Tensor Train, Boolean Tucker, and Boolean Hierarchical Tucker. As an exact decomposition of a given type may not exist in the general case, the objective is to minimize the difference between the input high-dimensional tensor and the product of the lower-dimensional tensors of the proposed factorization, using a specified tensor norm. In our approach, we reduce the Boolean tensor factorization problem to a sequence of quadratic unconstrained binary optimization problems suitable for the D-Wave 2000Q quantum annealer. Although current quantum technology is still fairly restricted in the problems it can tackle, we show that complex tensor factorization problems as the ones addressed by us can be solved efficiently and accurately.
We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of the Cholesky decomposition (CD) of electron repulsion integrals in molecular ensembles and employs tensor hypercontraction (THC) to efficiently compress low-rank Cholesky blocks. By representing the Cholesky vectors in a mixed format, keeping high-rank blocks in block-sparse form and compressing low-rank blocks with THC, we reduce the scaling of exchange-energy evaluation from quartic to robust cubic in the number of molecular orbitals N, while lowering memory from cubic toward quadratic. Benchmark analyses on one-, two-, and three-dimensional molecular ensembles (up to ∼1,200 orbitals) show that (a) the number of nonzeros in Cholesky tensors grows linearly with system size across dimensions; (b) the average numerical rank increases sublinearly and does not saturate at these sizes; and (c) rank heterogeneity─some blocks nearly full rank and many low rank, naturally motivates the proposed mixed block sparsity and THC scheme for efficient calculation of exchange energy. In conclusion, we demonstrate that the mixed scheme yields cubic wall-time scaling with favorable prefactors and preserves AFQMC accuracy.
The half-life of the famous C 14 β decay is anomalously long, with different mechanisms: the tensor force, cross-shell mixing, and three-body forces, proposed to explain the cancellations that lead to a small transition matrix element. In this study, we revisit and analyze the role of the tensor force for the β decay of C 14 as well as of neighboring isotopes. We add a tensor force to the Gogny interaction, and derive an effective Hamiltonian for shell-model calculations. The calculations were carried out in a p – s d model space to investigate cross-shell effects. Furthermore, we decompose the wave functions according to the total orbital angular momentum L in order to analyze the effects of the tensor force and cross-shell mixing. The inclusion of the tensor force significantly improves the shell-model calculations of the β -decay properties of carbon isotopes. In particular, the anomalously slow β decay of C 14 can be explained by the isospin T = 0 part of the tensor force, which changes the components of N 14 with the orbital angular momentum L = 0 , 1 , and results in a dramatic suppression of the Gamow-Teller transition strength. At the same time, the description of other nearby β decays are improved. Decomposition of wave function into L components illuminates how the tensor force modifies nuclear wave functions, in particular suppression of β -decay matrix elements. Cross-shell mixing also has a visible impact on the β -decay strength. Inclusion of the tensor force does not seem to significantly change, however, binding energies of the nuclei within the phenomenological interaction.
A data-driven projection-based reduced-order model (ROM) for nonlinear thermal radiative transfer (TRT) problems is presented. The TRT ROM is formulated by (i) a hierarchy of low-order quasidiffusion (aka variable Eddington factor) equations for moments of the radiation intensity and (ii) the normalized Boltzmann transport equation (BTE). The multilevel system of moment equations is derived by projection of the BTE onto a sequence of subspaces which represent elements of the phase space of the problem. Exact closure for the moment equations is provided by the Eddington tensor. A Petrov-Galerkin (PG) projection of the normalized BTE is formulated using a proper orthogonal decomposition (POD) basis representing the normalized radiation intensity over the whole phase space and time. The Eddington tensor linearly depends on the solution of the normalized BTE. By linear superposition of the POD basis functions, a low-rank expansion of the Eddington tensor is constructed with coefficients defined by the PG projected normalized BTE. The material energy balance (MEB) equation is coupled with the effective gray low-order equations which exist on the same dimensional scale as the MEB equation. The resulting TRT ROM is structure and asymptotic preserving. A detailed analysis of the ROM is performed on the classical Fleck-Cummings (F-C) TRT multigroup test problem in 2D geometry. Numerical results are presented to demonstrate the ROM's effectiveness in the simulation of radiation wave phenomena. Importantly, the ROM is shown to produce solutions with sufficiently high accuracy while using low-rank approximation of the normalized BTE solution. Essential physical characteristics of supersonic radiation wave are preserved in the ROM solutions.
A Bargmann spacetime is a constrained five-dimensional setting that, while introducing no new physical degrees of freedom beyond those of ordinary four-dimensional spacetime, permits Galilei physics to be expressed with a tensor formalism that respects the distinction between mass and energy while affording the conceptual and technical advantages of a spacetime metric. This framework offers a route to a strong-field ‘Galilei general relativity’ approximating the usual Poincaré general relativity introduced by Einstein. In preparation for modeling core-collapse supernovae, where such an approximation would be useful, this work generalizes the kinetic-energy–momentum–mass 5-flux 𝒯 and its associated spacetime tensor law from a simple fluid of constant particle mass to a baryon fluid whose multiple nuclear species can interconvert rest mass and internal energy. The spacetime tensor law on Bargmann–Galilei spacetime 𝐵𝒢 and its decompositions relative to comoving (‘Lagrangian’) and fiducial (‘Eulerian’) observers are derived in detail. The formalism is rendered more suitable for core-collapse supernova modeling by an extension from strict 𝐵𝒢 to a regime that might be denoted as 𝐵𝒢+: microscopically Poincaré yet macroscopically Galilei. This extension accommodates energy generation by nuclear composition changes and allows comoving energy density and pressure to contribute relative to mass density, while preserving the simplifications of Galilei bulk fluid flow and the streamlined geometry governed by the Bargmann–Galilei spacetime metric.
We study the evolution equation for magnetic energy density for a non-relativistic magnetized plasma in the (Lagrangian) reference frame comoving with the electron bulk velocity. Analyzing the terms that arise due to the ideal electric field, namely, perpendicular electron compression and magnetic field line bending, we recast them to reveal a quantity with a functional form analogous to the often-studied pressure–strain interaction term that describes one piece of internal energy density evolution of the species in a plasma, except with the species pressure tensor replaced by the magnetic stress tensor. We dub it the “magnetic stress–strain interaction.” We discuss decompositions of the magnetic stress–strain interaction analogous to those used for pressure–strain interaction. These analogies facilitate the interpretation of the evolution of the various forms of energy in magnetized plasmas and should be useful for a wide array of applications, including magnetic reconnection, turbulence, collisionless shocks, and wave–particle interactions. We display and analyze all the terms that can change magnetic energy density in the Lagrangian reference frame of the electrons using a particle-in-cell simulation of magnetic reconnection.
This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.
Low dimensional dynamical systems which model a fully developed turbulent wall layer were derived.The model is based on the optimally fast convergent proper orthogonal decomposition, or Karhunen-Loeve expansion. This decomposition provides a set of eigenfunctions which are derived from the autocorrelation tensor at zero time lag. Via Galerkin projection, low dimensional sets of ordinary differential equations in time, for the coefficients of the expansion, were derived from the Navier-Stokes equations. The energy loss to the unresolved modes was modeled by an eddy viscosity representation, analogous to Heisenberg's spectral model. A set of eigenfunctions and eigenvalues were obtained from direct numerical simulation of a plane channel at a Reynolds number of 6600, based on the mean centerline velocity and the channel width flow and compared with previous work done by Herzog. Using the new eigenvalues and eigenfunctions, a new ten dimensional set of ordinary differential equations were derived using five non-zero cross-stream Fourier modes with a periodic length of 377 wall units. The dynamical system was integrated for a range of the eddy viscosity prameter alpha. This work is encouraging.
The time-dependent Navier-Stokes equations are numerically integrated for two-dimensional incompressible viscous flow in a shear-driven square cavity. Using a time-splitting method and finite differences on a staggered mesh, the momentum and pressure equations are directly solved by a tensor product method where one finite difference direction is diagonalized by eigenvalue decomposition. The effects of increasing Reynolds number are studied and the developing boundary layer is captured by using a finely clustered mesh. At Re = 30,000 the flow is in a continuously developing unsteady regime. Power spectrum plots indicate that the unsteady flow oscillates with one fundamental frequency and exhibits some characteristics of transition between laminar and turbulent states.
Despite advancements in high-performance computing and modern numerical algorithms, computational cost remains prohibitive for multi-query kinetic plasma simulations. Here, in this work, we develop data-driven reduced-order models (ROMs) for collisionless electrostatic plasma dynamics, based on the kinetic Vlasov-Poisson equation. Our ROM approach projects the equation onto a linear subspace defined by the proper orthogonal decomposition (POD) modes. We introduce an efficient tensorial method to update the nonlinear term using a precomputed third-order tensor. We capture multiscale behavior with a minimal number of POD modes by decomposing the solution manifold into multiple time windows and creating temporally local ROMs. We consider two strategies for decomposition: one based on the physical time and the other based on the electric field energy. Applied to the 1D1V Vlasov–Poisson simulations, that is, prescribed E-field, Landau damping, and two-stream instability, we demonstrate that our ROMs accurately capture the total energy of the system both for parametric and time extrapolation cases. The temporally local ROMs are more efficient and accurate than the single ROM. In addition, in the two-stream instability case, we show that the energy-windowing reduced-order model (EW-ROM) is more efficient and accurate than the time-windowing reduced-order model (TW-ROM). With the tensorial approach, EW-ROM solves the equation approximately 90 times faster than Eulerian simulations while maintaining a maximum relative error of 7.5% for the training data and 11% for the testing data.
Not Available
In Eulerian finite element simulations, the mesh moves relative to the material. After every change of position between the mesh and the material, the state variables are interpolated to the new mesh position, which is referred to as advection. Large strain crystal plasticity models are based on the multiplicative decomposition of the total deformation gradient. Further, the stress is evaluated as a function of the thermoelastic strain, temperature, and other state variables. Advection of tensor quantities, such as the strain, is coupled with possibly significant advection errors. In an effort to reduce the advection errors, we develop two rate forms of an established dislocation density-based continuum model. To that end, we replace the multiplicative decomposition of the deformation gradient with the additive decomposition of the velocity gradient, and define the stress rate instead of the total stress. The Eulerian implementation is compared with Lagrangian calculations, and two numerical examples with severe deformation levels are presented.
Glueballs are investigated through gluonic operators on two $ N_f=2+1 $ RBC/UKQCD gauge ensembles at the physical pion mass. The statistical errors of glueball correlation functions are considerably reduced through the cluster decomposition error reduction (CDER) method. The Bethe-Salpeter wave functions are obtained for the scalar, tensor, and pseudoscalar glueballs by using spatially extended glueball operators defined through the gauge potential $ A_\mu(x) $ in the Coulomb gauge. These wave functions exhibit similar features of non-relativistic two-gluon systems and are used to optimize the signals of the related correlation functions at the early time regions, where the ground state masses are extracted. These masses are close to those from the quenched approximation and indicate the possible existence of glueballs at the physical point. The resonance feature of glueballs and the mixing with conventional mesons and multi-hadron systems should be considered in a more systematic lattice study.
A practical finite element method is presented for geometrically nonlinear (von Karman) plate problems. Symmetric strain energy tensors provide an efficient formulation and solution, and allow the effects of initial imperfections to be considered. An unbalanced force iteration is employed, with the advantage that the time consuming Gauss decomposition needs to be performed only once. The convergence is controlled by an automatically computed relaxation factor, and this makes the method applicable in advanced stages of non-linearity. Several different triangular elements are used in explicitly deriving the required tensors.
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.