Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor 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

Thermal Radiation Transport with Tensor Trains

We present a novel tensor network algorithm to solve the time-dependent, gray thermal radiation transport equation. The method invokes a tensor train (TT) decomposition for the specific intensity. The efficiency of this approach is dictated by the rank of the decomposition. When the solution is “low rank,” the memory footprint of the specific intensity solution vector may be significantly compressed. The algorithm, following a step-then-truncate approach of a traditional discrete ordinates method, operates directly on the compressed state vector, thereby enabling large speedups for low-rank solutions. To achieve these speedups, we rely on a recently developed rounding approach based on the Gram-SVD. We detail how familiar S N algorithms for (gray) thermal transport can be mapped to this TT framework and present several numerical examples testing both the optically thick and thin regimes. The TT framework finds low-rank structure and supplies up to ≃60× speedups and ≃1000× compressions for problems demanding large angle counts, thereby enabling previously intractable SN calculations and supplying a promising avenue to mitigate ray effects.

79 ASTRONOMY AND ASTROPHYSICS↗

CFD validation in OECD/NEA t-junction benchmark.

When streams of rapidly moving flow merge in a T-junction, the potential arises for large oscillations at the scale of the diameter, D, with a period scaling as O(D/U), where U is the characteristic flow velocity. If the streams are of different temperatures, the oscillations result in experimental fluctuations (thermal striping) at the pipe wall in the outlet branch that can accelerate thermal-mechanical fatigue and ultimately cause pipe failure. The importance of this phenomenon has prompted the nuclear energy modeling and simulation community to establish a benchmark to test the ability of computational fluid dynamics (CFD) codes to predict thermal striping. The benchmark is based on thermal and velocity data measured in an experiment designed specifically for this purpose. Thermal striping is intrinsically unsteady and hence not accessible to steady state simulation approaches such as steady state Reynolds-averaged Navier-Stokes (RANS) models.1 Consequently, one must consider either unsteady RANS or large eddy simulation (LES). This report compares the results for three LES codes: Nek5000, developed at Argonne National Laboratory (USA), and Cabaret and Conv3D, developed at the Moscow Institute of Nuclear Energy Safety at (IBRAE) in Russia. Nek5000 is based on the spectral element method (SEM), which is a high-order weighted residual technique that combines the geometric flexibility of the finite element method (FEM) with the tensor-product efficiencies of spectral methods. Cabaret is a 'compact accurately boundary-adjusting high-resolution technique' for fluid dynamics simulation. The method is second-order accurate on nonuniform grids in space and time, and has a small dispersion error and computational stencil defined within one space-time cell. The scheme is equipped with a conservative nonlinear correction procedure based on the maximum principle. CONV3D is based on the immersed boundary method and is validated on a wide set of the experimental and benchmark data. The numerical scheme has a very small scheme diffusion and is the second and the first order accurate in space and time, correspondingly. We compare and contrast simulation results for three computational fluid dynamics codes CABARET, Conv3D, and Nek5000 for the T-junction thermal striping problem that was the focus of a recent OECD/NEA blind benchmark. The corresponding codes utilize finite-difference implicit large eddy simulation (ILES), finite-volume LES on fully staggered grids, and an LES spectral element method (SEM), respectively. The simulations results are in a good agreement with experimenatl data. We present results from a study of sensitivity to computational mesh and time integration interval, and discuss the next steps in the simulation of this problem.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Fermionic Isometric Tensor Network States in Two Dimensions

We generalize isometric tensor network states to fermionic systems, paving the way for efficient adaptations of 1D tensor network algorithms to 2D fermionic systems. As the first application of this formalism, we developed and benchmarked a time-evolving block-decimation (TEBD) algorithm for real-time and imaginary-time evolution. The imaginary-time evolution produces ground-state energies for gapped systems, systems with a Dirac point, and systems with gapless edge modes to good accuracy. Here, the real-time TEBD captures the scattering of two fermions and the chiral edge dynamics on the boundary of a Chern insulator.

2-dimensional systems↗

Acceleration of tensor-product operations for high-order finite element methods

This article is devoted to graphics processing unit (GPU) kernel optimization and performance analysis of three tensor-product operations arising in finite element methods. We provide a mathematical background to these operations and implementation details. Achieving close to peak performance for these operators requires extensive optimization because of the operators’ properties: low arithmetic intensity, tiered structure, and the need to store intermediate results during the kernel execution. We give a guided overview of optimization strategies and we present a performance model that allows us to compare the efficacy of these optimizations against an empirically calibrated roofline.

Świrydowicz, Kasia↗

Two-temperature scales in the triangular-lattice Heisenberg antiferromagnet

The anomalous thermodynamic properties of the paradigmatic frustrated spin-1/2 triangular-lattice Heisenberg antiferromagnet (TLH) has remained an open topic of research over decades, both experimentally and theoretically. We further the theoretical understanding based on the recently developed, powerful exponential tensor renormalization group method on cylinders and stripes in a quasi-one-dimensional (1D) setup, as well as a tensor product operator approach directly in 2D. The observed thermal properties of the TLH are in excellent agreement with two recent experimental measurements on the virtually ideal TLH material ${\mathrm{Ba}}_{8}{\mathrm{CoNb}}_{6}{\mathrm{O}}_{24}$. Remarkably, our numerical simulations reveal two crossover temperature scales, at ${T}_{l}/J{\sim}0.20$ and ${T}_{h}/J{\sim}0.55$, with $J$ the Heisenberg exchange coupling, which are also confirmed by a more careful inspection of the experimental data. We propose that in the intermediate regime between the low-temperature scale ${T}_{l}$ and the higher one ${T}_{h}$, the "rotonlike" excitations are activated with a strong chiral component and a large contribution to thermal entropies. Bearing remarkable resemblance to the renowned roton thermodynamics in liquid helium, these gapped excitations suppress the incipient ${120}^{{\circ}}$ order that emerges for temperatures below ${T}_{l}$.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗

Scale-adaptive tensor algebra for local many-body methods of electronic structure theory

While the formalism of multiresolution analysis (MRA), based on wavelets and adaptive integral representations of operators, is actively progressing in electronic structure theory (mostly on the independent-particle level and, recently, second-order perturbation theory), the concepts of multiresolution and adaptivity can also be utilized within the traditional formulation of correlated (many-particle) theory which is based on second quantization and the corresponding (generally nonorthogonal) tensor algebra. In this paper, we present a formalism called scale-adaptive tensor algebra (SATA) which exploits an adaptive representation of tensors of many-body operators via the local adjustment of the basis set quality. Given a series of locally supported fragment bases of a progressively lower quality, we formulate the explicit rules for tensor algebra operations dealing with adaptively resolved tensor operands. The formalism suggested is expected to enhance the applicability and reliability of local correlated many-body methods of electronic structure theory, especially those directly based on atomic orbitals (or any other localized basis functions).

Liakh, Dmitry I↗

X-ray Topographic Methods and Application to Analysis of Electronic Materials

Three supplementary X-ray techniques new to semiconductor applications are discussed. These are the Computer Aided Rocking Curve Analyzer, the Divergent Beam Method and a new method based on enhanced X-ray flourescence. The first method is used for quantitative mapping of an elastic or plastic strain field while the other two methods are used only to measure elastic strains. The divergent beam method is used for measuring the full strain tensor while the microfluorescence method is useful for monitoring strain uniformity. These methods are discussed in detail and examples of their application is presented. Among these are determination of the full strain ellipsoid in state-of-the-art liquid phase epitaxy deposited III-V epitaxial films; mapping of the plastic strain concentrations in tensile deformed Si; and quantitative determination of damage in V3Si due to ion implantation.

Mayo, W. E.↗

Georgia Tech Accelerated, Compressed, and Regularized Compute of Kinetic-based PDEs (Final Report)

This report summarizes the collaborative effort between Lawrence Livermore National Laboratory and Georgia Tech to enhance the BoBa library for tensor train computation in PDE solvers, with a target on kinetic equations and their continuum limits. We aimed to reduce computational cost and memory usage by replacing traditional array-based computations with tensor trains. We examined the compressibility of time-evolving solutions to the Euler equations with discontinuities. We also explored using the first invsicid and linear regularization of the compressible flow equations via the information geometric regularization (IGR). We explored this in a tensor train formulation. To identify that inverse terms in the IGR equations pose problems for tensor train formulations and investigate efficient methods for batched inversion of tensor trains.

97 MATHEMATICS AND COMPUTING↗

Comparison between explicit and implicit discretization strategies for a dissipative thermal environment

We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗

Data approximation using a blending type spline construction

Generalized expo-rational B-splines (GERBS) is a blending type spline construction where local functions at each knot are blended together by C{sup k}-smooth basis functions. One way of approximating discrete regular data using GERBS is by partitioning the data set into subsets and fit a local function to each subset. Partitioning and fitting strategies can be devised such that important or interesting data points are interpolated in order to preserve certain features. We present a method for fitting discrete data using a tensor product GERBS construction. The method is based on detection of feature points using differential geometry. Derivatives, which are necessary for feature point detection and used to construct local surface patches, are approximated from the discrete data using finite differences.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On-the-Fly Identification of Conformational Substates from Molecular Dynamics Simulations

We recently introduced a new method for discovering, characterizing, and monitoring spatiotemporal patterns in the conformational fluctuations in molecular dynamics simulation data ( J. Comput. Biol. 2010, 17 (3), 309 324). Significantly, our method, called Dynamic Tensor Analysis (DTA), can be performed as the simulation is progressing. It is therefore well-suited to analyzing long timescale simulations, which are critical for studying biologically relevant motions but may be too large for traditional analysis methods. In this paper, we demonstrate that the patterns discovered by DTA often correspond to functionally important conformational substates. In particular, we apply DTA to a 150 ns simulation of ubiquitin and discover patterns that provide unique insights into ubiquitin's ability to bind multiple substrates. Moreover, we take advantage of DTA's ability to identify patterns on different timescales and investigate how fast positional fluctuations may modulate slower, large-scale motions in functionally important regions. Our findings here suggest that DTA is well-suited to organizing, visualizing, and analyzing very large trajectories and discovering conformational substates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗

A GODUNOV METHOD FOR MULTIDIMENSIONAL RADIATION MAGNETOHYDRODYNAMICS BASED ON A VARIABLE EDDINGTON TENSOR

We describe a numerical algorithm to integrate the equations of radiation magnetohydrodynamics in multidimensions using Godunov methods. This algorithm solves the radiation moment equations in the mixed frame, without invoking any diffusion-like approximations. The moment equations are closed using a variable Eddington tensor whose components are calculated from a formal solution of the transfer equation at a large number of angles using the method of short characteristics. We use a comprehensive test suite to verify the algorithm, including convergence tests of radiation-modified linear acoustic and magnetosonic waves, the structure of radiation-modified shocks, and two-dimensional tests of photon bubble instability and the ablation of dense clouds by an intense radiation field. These tests cover a very wide range of regimes, including both optically thick and thin flows, and ratios of the radiation to gas pressure of at least 10{sup -4}-10{sup 4}. Across most of the parameter space, we find that the method is accurate. However, the tests also reveal there are regimes where the method needs improvement, for example when both the radiation pressure and absorption opacity are very large. We suggest modifications to the algorithm that will improve the accuracy in this case. We discuss the advantages of this method over those based on flux-limited diffusion. In particular, we find that the method is not only substantially more accurate, but often no more expensive than the diffusion approximation for our intended applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Research in Lattice Gauge Theory and in the Phenomenology of Neutrinos and Dark Matter

Research in theoretical elementary particle physics was performed by the PI Yannick Meurice and co-PI Mary Hall Reno. New techniques designed for precision calculations of strong interaction physics were developed using the tensor renormalization group method. Large-scale Monte Carlo simulations with dynamical quarks were performed for candidate models for Higgs compositeness. Ab-initio lattice gauge theory calculations of semileptonic decays of B-mesons observed in collider experiments and relevant to test the validity of the standard model were performed with the Fermilab/MILC collaboration. The phenomenology of strong interaction physics was applied to new predictions for physics processes in accelerator physics experiments and to cosmic ray production and interactions. A research focus has been on heavy quark production and their decays to neutrinos. The heavy quark contributions to atmospheric neutrino and muon fluxes have been evaluated, as have the neutrino fluxes from accelerator beams incident on heavy targets. Results are applicable to current and future particle physics experiments and to astrophysical neutrino detectors such as the IceCube Neutrino Observatory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Stochastic reconstruction and microstructure modeling of SMC chopped fiber composites

Here, to establish an integrated Processing-Microstructure-Property workflow for the prediction of material behaviors, this paper presents a new stochastic pseudo-3D microstructure reconstruction method for Sheet Molding Compounds (SMC) chopped fiber composites. The proposed method captures the bi-level microstructural features of SMC composites. At the higher level, a Voronoi diagram-based algorithm is developed to reconstruct the unique substructure features of SMC fiber tows. The geometry of Voronoi cells is adjusted by a Simulated Annealing (SA) algorithm to match the geometrical statistics of the real fiber tows. At the lower level, the algorithm assigns fiber orientation to each Voronoi cell (which represents a fiber tow). The fiber orientation angles are recovered from a statistical fiber orientation tensor. The proposed method is employed to establish a multi-layer pseudo-3D SMC Representative Volume Element (RVE) model for Finite Element Analysis (FEA) of SMC microstructure. This model enables the prediction of mechanical properties based on the material processing information (e.g. fiber orientation tensor obtained from compression molding simulation), and the microstructure information obtained from microscopic imaging for an SMC composite. Lastly, the predicted properties are successfully validated by experimental tensile tests.

36 MATERIALS SCIENCE↗