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 991 records · Page 55

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

Effective long wavelength scalar dynamics in de Sitter

We discuss the effective infrared theory governing a light scalar's long wavelength dynamics in de Sitter spacetime. We show how the separation of scales around the physical curvature radius k / a ∼ H can be performed consistently with a window function and how short wavelengths can be integrated out in the Schwinger-Keldysh path integral formalism. At leading order, and for time scales Δ t >> H {sup −1}, this results in the well-known Starobinsky stochastic evolution. However, our approach allows for the computation of quantum UV corrections, generating an effective potential on which the stochastic dynamics takes place. The long wavelength stochastic dynamical equations are now second order in time, incorporating temporal scales Δ t ∼ H {sup −1} and resulting in a Kramers equation for the probability distribution—more precisely the Wigner function—in contrast to the more usual Fokker-Planck equation. This feature allows us to non-perturbatively evaluate, within the stochastic formalism, not only expectation values of field correlators, but also the stress-energy tensor of φ.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Information geometry of Gaussian channels

We define a local Riemannian metric tensor in the manifold of Gaussian channels and the distance that it induces. We adopt an information-geometric approach and define a metric derived from the Bures-Fisher metric for quantum states. The resulting metric inherits several desirable properties from the Bures-Fisher metric and is operationally motivated by distinguishability considerations: It serves as an upper bound to the attainable quantum Fisher information for the channel parameters using Gaussian states, under generic constraints on the physically available resources. Our approach naturally includes the use of entangled Gaussian probe states. We prove that the metric enjoys some desirable properties like stability and covariance. As a by-product, we also obtain some general results in Gaussian channel estimation that are the continuous-variable analogs of previously known results in finite dimensions. We prove that optimal probe states are always pure and bounded in the number of ancillary modes, even in the presence of constraints on the reduced state input in the channel. This has experimental and computational implications. It limits the complexity of optimal experimental setups for channel estimation and reduces the computational requirements for the evaluation of the metric: Indeed, we construct a converging algorithm for its computation. We provide explicit formulas for computing the multiparametric quantum Fisher information for dissipative channels probed with arbitrary Gaussian states and provide the optimal observables for the estimation of the channel parameters (e.g., bath couplings, squeezing, and temperature).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tensor effective interaction in self-consistent random-phase approximation calculations

We present a study of the effects of the tensor-isospin term of the effective interaction in Hartree-Fock and random-phase approximation calculations. We used finite-range forces of Gogny type, and we added to them a tensor-isospin term which behaves, at large internucleonic distances, as the analogous term of the microscopic interactions. The strength of this tensor force has been chosen to reproduce the experimental energy of the lowest 0{sup -} excited state in {sup 16}O, which shows large sensitivity to this term of the interaction. With these finite-range interactions, we have studied the effects of the tensor-isospin force in ground and excited states of carbon, oxygen, calcium, nickel, zirconium, tin, and lead isotopes. Our results show that the tensor force affects mainly the nucleon single-particle energies. However, we found some interesting cases where also bulk nuclear properties are sensitive to the tensor interaction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Uncertainty Quantification via Random Domain Decomposition and Probabilistic Collocation on Sparse Grids

Due to lack of knowledge or insufficient data, many physical systems are subject to uncertainty. Such uncertainty occurs on a multiplicity of scales. In this study, we conduct the uncertainty analysis of diffusion in random composites with two dominant scales of uncertainty: Large-scale uncertainty in the spatial arrangement of materials and small-scale uncertainty in the parameters within each material. A general two-scale framework that combines random domain decomposition (RDD) and probabilistic collocation method (PCM) on sparse grids to quantify the large and small scales of uncertainty, respectively. Using sparse grid points instead of standard grids based on full tensor products for both the large and small scales of uncertainty can greatly reduce the overall computational cost, especially for random process with small correlation length (large number of random dimensions). For one-dimensional random contact point problem and random inclusion problem, analytical solution and Monte Carlo simulations have been conducted respectively to verify the accuracy of the combined RDD-PCM approach. Additionally, we employed our combined RDD-PCM approach to two- and three-dimensional examples to demonstrate that our combined RDD-PCM approach provides efficient, robust and nonintrusive approximations for the statistics of diffusion in random composites.

97 MATHEMATICS AND COMPUTING↗

Derivation of general analytic gradient expressions for density-fitted post-Hartree-Fock methods: An efficient implementation for the density-fitted second-order Møller–Plesset perturbation theory

General analytic gradient expressions (with the frozen-core approximation) are presented for density-fitted post-HF methods. An efficient implementation of frozen-core analytic gradients for the second-order Møller–Plesset perturbation theory (MP2) with the density-fitting (DF) approximation (applying to both reference and correlation energies), which is denoted as DF-MP2, is reported. The DF-MP2 method is applied to a set of alkanes, conjugated dienes, and noncovalent interaction complexes to compare the computational cost of single point analytic gradients with MP2 with the resolution of the identity approach (RI-MP2) [F. Weigend and M. Häser, Theor. Chem. Acc. 97, 331 (1997); R. A. Distasio, R. P. Steele, Y. M. Rhee, Y. Shao, and M. Head-Gordon, J. Comput. Chem. 28, 839 (2007)]. In the RI-MP2 method, the DF approach is used only for the correlation energy. Our results demonstrate that the DF-MP2 method substantially accelerate the RI-MP2 method for analytic gradient computations due to the reduced input/output (I/O) time. Because in the DF-MP2 method the DF approach is used for both reference and correlation energies, the storage of 4-index electron repulsion integrals (ERIs) are avoided, 3-index ERI tensors are employed instead. Further, as in case of integrals, our gradient equation is completely avoid construction or storage of the 4-index two-particle density matrix (TPDM), instead we use 2- and 3-index TPDMs. Hence, the I/O bottleneck of a gradient computation is significantly overcome. Therefore, the cost of the generalized-Fock matrix (GFM), TPDM, solution of Z-vector equations, the back transformation of TPDM, and integral derivatives are substantially reduced when the DF approach is used for the entire energy expression. Further application results show that the DF approach introduce negligible errors for closed-shell reaction energies and equilibrium bond lengths.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

GPAW: An open Python package for electronic structure calculations

We review the GPAW open-source Python package for electronic structure calculations. GPAW is based on the projector-augmented wave method and can solve the self-consistent density functional theory (DFT) equations using three different wave-function representations, namely real-space grids, plane waves, and numerical atomic orbitals. The three representations are complementary and mutually independent and can be connected by transformations via the real-space grid. This multi-basis feature renders GPAW highly versatile and unique among similar codes. By virtue of its modular structure, the GPAW code constitutes an ideal platform for the implementation of new features and methodologies. Moreover, it is well integrated with the Atomic Simulation Environment (ASE), providing a flexible and dynamic user interface. In addition to ground-state DFT calculations, GPAW supports many-body GW band structures, optical excitations from the Bethe–Salpeter Equation, variational calculations of excited states in molecules and solids via direct optimization, and real-time propagation of the Kohn–Sham equations within time-dependent DFT. A range of more advanced methods to describe magnetic excitations and non-collinear magnetism in solids are also now available. In addition, GPAW can calculate non-linear optical tensors of solids, charged crystal point defects, and much more. Recently, support for graphics processing unit (GPU) acceleration has been achieved with minor modifications to the GPAW code thanks to the CuPy library. We end the review with an outlook, describing some future plans for GPAW.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Requirements on the gain calibration for LiteBIRD polarisation data with blind component separation

The detection of primordial B modes of the cosmic microwave background (CMB) could provide information about the early stages of the Universe's evolution. The faintness of this signal requires exquisite calibration accuracy and control of instrumental systematic effects which otherwise could bias the measurements. In this work, we study the impact of an imperfect relative polarisation gain calibration on the recovered value of the tensor-to-scalar ratio r for the LiteBIRD experiment, through the application of the blind Needlet Internal Linear Combination (NILC) foreground-cleaning method. We derive requirements on the relative calibration accuracy of the overall polarisation gain (Δg ν ) for each LiteBIRD frequency channel. Our results show that minimum variance techniques, as NILC, are less sensitive to systematic gain calibration uncertainties compared to a parametric approach, if the latter is not equipped with a proper modelling of these instrumental effects. In this study, the most stringent requirements are found in the channels where the CMB signal is relatively brighter, with the tightest constraints at 166 GHz (Δg ν ≈ 0.16%). This differs from the outcome of an analogous analysis performed with a parametric method, where the tightest requirements are obtained for the foreground-dominated channels. Gain calibration uncertainties, corresponding to the derived requirements, are then simultaneously propagated into all frequency channels. By doing so, we find that the overall impact on estimated r is lower than the total gain systematic budget for LiteBIRD approximately by a factor 5, due to the correlations of the impacts of gain calibration uncertainties in different frequency channels. In order to decouple the systematic effect from the specific choice of the model, we derive the requirements assuming constant spectral parameters for the foreground emission. To assess the robustness of the obtained results against more realistic scenarios, we repeat the analysis assuming sky models of intermediate and high complexity. In these further cases, we adopt an optimised NILC pipeline, called the Multi-Clustering NILC (MC-NILC). We find that the impact of gain calibration uncertainties on r is lower than the LiteBIRD gain systematics budget for the intermediate-complexity sky model. For the high-complexity case, instead, it would be necessary to tighten the requirements by a factor 1.8.

79 ASTRONOMY AND ASTROPHYSICS↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Determination of the Components of the Gyration Tensor of Quartz by Oblique Incidence Transmission Two-Modulator Generalized Ellipsometry

The two independent components of the gyration tensor of quartz, g{sub 11} and g{sub 33}, have been spectroscopically measured using a transmission two-modulator generalized ellipsometer. The method is used to determine the optical activity in crystals in directions other than the optic axis, where the linear birefringence is much larger than the optical activity.

36 MATERIALS SCIENCE↗

Structure-preserving numerical discretizations for domains with boundaries

This SAND report documents Exploratory Express LDRD Project 223790, "Structure-preserving numerical discretizations for domains with boundaries", which developed a method to incorporate consistent treatment of domain boundaries and arbitrary boundary conditions in discrete exterior calculus (DEC) for arbitrary polygonal (2D) and tensor-product structure prism (3D) grids. The new DEC required the development of novel discrete exterior derivatives, boundary operators, wedge products and Hodge stars. This was accomplished through the use of boundary extension and the blending of known 2D operators on the interior with 1D operators on the boundary. The Hodge star was based on the Voronoi Hodge star, and retained the limitation of a triangular circumcentric primal or dual grid along with low-order accuracy. In addition to the new DEC, two related software packages were written: one for the study of DEC operators on arbitrary polygonal and polyhedral grids using both symbolic and numerical approaches and one for a (thermal) shallow water testbed using TRiSK-type numerics. Immediately relevant (already funded, through CANGA) followup work is the development of a high-order, geometrically flexible Hodge star and structure-preserving, high-order, oscillation-limiting transport operators (using WENO) for n-forms on arbitrary 2D and 3D grids. This will provide all of the machinery required for a high-order version of TRiSK with boundaries on arbitrary 2D and tensor-product 3D grids, which is applicable to both the atmospheric (CRM in E3SM-MMF) and oceanic (MPAS-O) components of E3SM.

97 MATHEMATICS AND COMPUTING↗

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↗

TARDIS. I. A Constrained Reconstruction Approach to Modeling the z ~ 2.5 Cosmic Web Probed by Lyα Forest Tomography

Recent Lyα forest tomography measurements of the intergalactic medium (IGM) have revealed a wealth of cosmic structures at high redshift (z ~ 2.5). In this work, we present the Tomographic Absorption Reconstruction and Density Inference Scheme (TARDIS), a new chronocosmographic analysis tool for understanding the formation and evolution of these observed structures. Here, we use maximum likelihood techniques with a fast nonlinear gravitational model to reconstruct the initial density field of the observed regions. We find that TARDIS allows accurate reconstruction of smaller-scale structures than standard Wiener-filtering techniques. Applying this technique to mock Lyα forest data sets that simulate ongoing and future surveys such as CLAMATO, Subaru PFS, or the ELTs, we are able to infer the underlying matter density field at observed redshift and classify the cosmic web structures. We find good agreement with the underlying truth in both the characteristic eigenvalues and eigenvectors of the pseudo-deformation tensor, with the eigenvalues inferred from 30 m class telescopes correlated at r = 0.95 relative to the truth. As an output of this method, we are able to further evolve the inferred structures to late time (z = 0) and also track the trajectories of coeval z = 2.5 galaxies to their z = 0 cosmic web environments.

79 ASTRONOMY AND ASTROPHYSICS↗

Post-Newtonian gravitational bremsstrahlung

Formulas and numerical results for the gravitational radiation emitted during a low-deflection encounter between two massive bodies are presented. The results are valid through post-Newtonian order within general relativity. The gravitational waveform (transverse-traceless part of the metric perturbation tensor), the total luminosity and total emitted energy, the angular distribution of emitted energy (antenna pattern), and the frequency spectrum are discussed. A method of boosting the accuracy of these quantities to post-3/2-Newtonian order is presented. A numerical comparison of the results with previously reported results shows that the post-Newtonian method is reliable to better than 0.1% at v = 0.1c, to a few percent at v = 0.35c, and to 10-20% at v = 0.5c.

Turner, M.↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Symmetry reduction of tensor networks in many-body theory: I. Automated symbolic evaluation of SU(2) algebra

Abstract The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU (2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.

Tichai, A.↗

Discontinuous Galerkin finite element methods for gradient plasticity.

In this report we apply discontinuous Galerkin finite element methods to the equations of an incompatibility based formulation of gradient plasticity. The presentation is motivated with a brief overview of the description of dislocations within a crystal lattice. A tensor representing a measure of the incompatibility with the lattice is used in the formulation of a gradient plasticity model. This model is cast in a variational formulation, and discontinuous Galerkin machinery is employed to implement the formulation into a finite element code. Finally numerical examples of the model are shown.

36 MATERIALS SCIENCE↗